./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/40_barrier_vf.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/40_barrier_vf.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 5eef73b6b2655059556d731e3a5babc181132142f2417a2cf863165dd8efda84 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:12:25,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:12:25,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:12:25,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:12:25,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:12:25,345 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:12:25,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:12:25,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:12:25,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:12:25,349 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:12:25,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:12:25,350 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:12:25,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:12:25,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:12:25,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:12:25,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:12:25,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:12:25,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:12:25,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:12:25,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:12:25,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:12:25,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:12:25,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:12:25,358 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:12:25,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:12:25,360 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:12:25,361 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:12:25,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:12:25,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:12:25,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:12:25,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:12:25,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:12:25,363 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:12:25,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:12:25,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:12:25,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:12:25,365 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:12:25,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:12:25,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:12:25,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:12:25,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:12:25,367 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:12:25,381 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:12:25,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:12:25,382 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:12:25,382 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:12:25,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:12:25,382 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:12:25,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:12:25,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:12:25,383 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:12:25,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:12:25,383 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:12:25,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:12:25,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:12:25,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:12:25,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:12:25,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:12:25,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:12:25,384 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:12:25,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:12:25,385 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:12:25,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:12:25,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:12:25,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:12:25,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:12:25,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:12:25,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:12:25,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:12:25,386 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:12:25,386 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:12:25,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:12:25,386 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:12:25,386 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:12:25,387 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:12:25,387 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 -> 5eef73b6b2655059556d731e3a5babc181132142f2417a2cf863165dd8efda84 [2022-02-20 20:12:25,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:12:25,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:12:25,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:12:25,580 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:12:25,581 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:12:25,582 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2022-02-20 20:12:25,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba05bcdb/eb78fa53662845138e1fac5b0e11313c/FLAG7c3c16264 [2022-02-20 20:12:26,015 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:12:26,016 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2022-02-20 20:12:26,026 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba05bcdb/eb78fa53662845138e1fac5b0e11313c/FLAG7c3c16264 [2022-02-20 20:12:26,036 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba05bcdb/eb78fa53662845138e1fac5b0e11313c [2022-02-20 20:12:26,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:12:26,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:12:26,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:12:26,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:12:26,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:12:26,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:12:26" (1/1) ... [2022-02-20 20:12:26,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5be5ed41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:26, skipping insertion in model container [2022-02-20 20:12:26,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:12:26" (1/1) ... [2022-02-20 20:12:26,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:12:26,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:12:26,301 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-02-20 20:12:26,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/40_barrier_vf.i[31163,31176] [2022-02-20 20:12:26,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:12:26,463 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:12:26,486 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-02-20 20:12:26,501 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/40_barrier_vf.i[31163,31176] [2022-02-20 20:12:26,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:12:26,535 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:12:26,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:26 WrapperNode [2022-02-20 20:12:26,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:12:26,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:12:26,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:12:26,539 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:12:26,544 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:12:26" (1/1) ... [2022-02-20 20:12:26,558 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:12:26" (1/1) ... [2022-02-20 20:12:26,575 INFO L137 Inliner]: procedures = 174, calls = 25, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 78 [2022-02-20 20:12:26,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:12:26,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:12:26,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:12:26,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:12:26,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:26" (1/1) ... [2022-02-20 20:12:26,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:26" (1/1) ... [2022-02-20 20:12:26,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:26" (1/1) ... [2022-02-20 20:12:26,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:26" (1/1) ... [2022-02-20 20:12:26,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:26" (1/1) ... [2022-02-20 20:12:26,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:26" (1/1) ... [2022-02-20 20:12:26,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:26" (1/1) ... [2022-02-20 20:12:26,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:12:26,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:12:26,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:12:26,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:12:26,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:26" (1/1) ... [2022-02-20 20:12:26,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:12:26,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:12:26,631 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:12:26,634 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:12:26,658 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-02-20 20:12:26,659 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-02-20 20:12:26,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:12:26,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-20 20:12:26,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:12:26,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:12:26,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:12:26,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:12:26,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-20 20:12:26,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:12:26,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:12:26,662 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:12:26,727 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:12:26,728 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:12:26,848 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:12:26,889 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:12:26,889 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 20:12:26,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:12:26 BoogieIcfgContainer [2022-02-20 20:12:26,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:12:26,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:12:26,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:12:26,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:12:26,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:12:26" (1/3) ... [2022-02-20 20:12:26,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed26006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:12:26, skipping insertion in model container [2022-02-20 20:12:26,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:26" (2/3) ... [2022-02-20 20:12:26,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ed26006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:12:26, skipping insertion in model container [2022-02-20 20:12:26,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:12:26" (3/3) ... [2022-02-20 20:12:26,905 INFO L111 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2022-02-20 20:12:26,915 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:12:26,916 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:12:26,916 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:12:26,916 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:12:26,966 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,966 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,966 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,966 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,967 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,967 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,967 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,967 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,967 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,969 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,969 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,969 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,969 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,969 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,970 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,975 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,975 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,975 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,976 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,976 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,976 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,979 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,979 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,979 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,979 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,980 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,987 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,988 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,988 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,988 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,988 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,998 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:26,998 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,001 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,001 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,001 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,002 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,002 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,002 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,002 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,011 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:12:27,053 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:12:27,058 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:12:27,058 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 20:12:27,069 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 54 transitions, 113 flow [2022-02-20 20:12:27,089 INFO L129 PetriNetUnfolder]: 4/65 cut-off events. [2022-02-20 20:12:27,095 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:12:27,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 65 events. 4/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2022-02-20 20:12:27,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 54 transitions, 113 flow [2022-02-20 20:12:27,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 54 transitions, 113 flow [2022-02-20 20:12:27,113 INFO L129 PetriNetUnfolder]: 2/47 cut-off events. [2022-02-20 20:12:27,114 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:12:27,114 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:27,114 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:12:27,115 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:12:27,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:27,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1260215165, now seen corresponding path program 1 times [2022-02-20 20:12:27,126 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:27,126 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245810193] [2022-02-20 20:12:27,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:27,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:12:27,213 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:12:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:12:27,244 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:12:27,245 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:12:27,246 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 3 remaining) [2022-02-20 20:12:27,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-02-20 20:12:27,248 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-02-20 20:12:27,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:12:27,251 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2022-02-20 20:12:27,253 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-02-20 20:12:27,253 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-02-20 20:12:27,281 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,281 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,282 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,282 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,282 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,282 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,282 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,283 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,283 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,283 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,283 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,283 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,284 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,284 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,284 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,285 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,285 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,285 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,285 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,286 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,286 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,286 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,286 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,287 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,287 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,287 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,288 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,288 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,288 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,288 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,289 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,289 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,289 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,289 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,290 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,290 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,290 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,290 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,291 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,291 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,292 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,292 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,292 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,292 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,292 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,292 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,293 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,293 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,293 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,293 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,293 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,293 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,294 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,294 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,294 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,295 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,295 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,295 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,295 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,295 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,296 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,296 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,296 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,296 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,297 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,297 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,297 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,297 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,298 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,298 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,298 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,298 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,299 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,299 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,299 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,299 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,300 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,300 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,300 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,300 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,301 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,301 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,301 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,301 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,301 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,302 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,302 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,302 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,303 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,303 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,303 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,303 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,303 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,303 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:27,304 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:12:27,306 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:12:27,307 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:12:27,307 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 20:12:27,308 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 78 places, 78 transitions, 168 flow [2022-02-20 20:12:27,327 INFO L129 PetriNetUnfolder]: 7/102 cut-off events. [2022-02-20 20:12:27,343 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-02-20 20:12:27,345 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 7/102 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 191 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 66. Up to 6 conditions per place. [2022-02-20 20:12:27,345 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 78 transitions, 168 flow [2022-02-20 20:12:27,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 78 transitions, 168 flow [2022-02-20 20:12:27,357 INFO L129 PetriNetUnfolder]: 4/75 cut-off events. [2022-02-20 20:12:27,358 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:12:27,358 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:27,358 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] [2022-02-20 20:12:27,358 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:12:27,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:27,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1346439990, now seen corresponding path program 1 times [2022-02-20 20:12:27,359 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:27,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247432089] [2022-02-20 20:12:27,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:27,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:12:27,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {81#true} [309] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {81#true} is VALID [2022-02-20 20:12:27,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {81#true} [296] 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] {81#true} is VALID [2022-02-20 20:12:27,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {81#true} [313] L-1-1-->L-1-2: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] {81#true} is VALID [2022-02-20 20:12:27,625 INFO L290 TraceCheckUtils]: 3: Hoare triple {81#true} [314] L-1-2-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {81#true} is VALID [2022-02-20 20:12:27,626 INFO L290 TraceCheckUtils]: 4: Hoare triple {81#true} [293] L16-->L16-1: Formula: (and (= (select |v_#valid_4| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {81#true} is VALID [2022-02-20 20:12:27,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {81#true} [270] L16-1-->L16-2: Formula: (= (select (select |v_#memory_int_3| 1) 0) 48) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] {81#true} is VALID [2022-02-20 20:12:27,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {81#true} [316] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_4| 1) 1) 0) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] {81#true} is VALID [2022-02-20 20:12:27,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {81#true} [306] L16-3-->L16-4: Formula: (and (= (select |v_#valid_5| 2) 1) (= 16 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {81#true} is VALID [2022-02-20 20:12:27,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {81#true} [307] L16-4-->L705: Formula: (= v_~count~0_6 0) InVars {} OutVars{~count~0=v_~count~0_6} AuxVars[] AssignedVars[~count~0] {83#(= ~count~0 0)} is VALID [2022-02-20 20:12:27,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {83#(= ~count~0 0)} [295] L705-->L706: Formula: (= v_~MTX~0_9 0) InVars {} OutVars{~MTX~0=v_~MTX~0_9} AuxVars[] AssignedVars[~MTX~0] {83#(= ~count~0 0)} is VALID [2022-02-20 20:12:27,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {83#(= ~count~0 0)} [300] L706-->L-1-3: Formula: (= v_~COND~0_4 0) InVars {} OutVars{~COND~0=v_~COND~0_4} AuxVars[] AssignedVars[~COND~0] {83#(= ~count~0 0)} is VALID [2022-02-20 20:12:27,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {83#(= ~count~0 0)} [315] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83#(= ~count~0 0)} is VALID [2022-02-20 20:12:27,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {83#(= ~count~0 0)} [305] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83#(= ~count~0 0)} is VALID [2022-02-20 20:12:27,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {83#(= ~count~0 0)} [280] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {83#(= ~count~0 0)} is VALID [2022-02-20 20:12:27,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {83#(= ~count~0 0)} [304] L-1-6-->L732: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_4|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_4|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#t~0#1.base] {83#(= ~count~0 0)} is VALID [2022-02-20 20:12:27,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {83#(= ~count~0 0)} [287] L732-->L733-7: Formula: (and (= |v_ULTIMATE.start_main_~#t~0#1.offset_5| 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t~0#1.base_5| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t~0#1.base_5| 0)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t~0#1.base_5|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_5| 4) |v_#length_3|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_5|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {83#(= ~count~0 0)} is VALID [2022-02-20 20:12:27,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {83#(= ~count~0 0)} [320] L733-7-->L733-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83#(= ~count~0 0)} is VALID [2022-02-20 20:12:27,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {83#(= ~count~0 0)} [273] L733-1-->L733-2: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {83#(= ~count~0 0)} is VALID [2022-02-20 20:12:27,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {83#(= ~count~0 0)} [321] L733-2-->L733-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {83#(= ~count~0 0)} is VALID [2022-02-20 20:12:27,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {83#(= ~count~0 0)} [283] L733-3-->L733-4: Formula: (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t~0#1.base_1| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t~0#1.base_1|) |v_ULTIMATE.start_main_~#t~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre5#1_2|)) |v_#memory_int_1|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] {83#(= ~count~0 0)} is VALID [2022-02-20 20:12:27,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {83#(= ~count~0 0)} [370] L733-4-->thr1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre5#1_8| v_thr1Thread1of2ForFork0_thidvar0_2) (= |v_thr1Thread1of2ForFork0_#in~arg#1.base_4| 0) (= v_thr1Thread1of2ForFork0_thidvar1_2 0) (= |v_thr1Thread1of2ForFork0_#in~arg#1.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_8|} OutVars{thr1Thread1of2ForFork0_#res#1.base=|v_thr1Thread1of2ForFork0_#res#1.base_4|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_8|, thr1Thread1of2ForFork0_~arg#1.base=|v_thr1Thread1of2ForFork0_~arg#1.base_4|, thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1_12|, thr1Thread1of2ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of2ForFork0_Barrier2_#t~post4#1_10|, thr1Thread1of2ForFork0_thidvar1=v_thr1Thread1of2ForFork0_thidvar1_2, thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_12|, thr1Thread1of2ForFork0_~arg#1.offset=|v_thr1Thread1of2ForFork0_~arg#1.offset_4|, thr1Thread1of2ForFork0_thidvar0=v_thr1Thread1of2ForFork0_thidvar0_2, thr1Thread1of2ForFork0_#in~arg#1.base=|v_thr1Thread1of2ForFork0_#in~arg#1.base_4|, thr1Thread1of2ForFork0_#res#1.offset=|v_thr1Thread1of2ForFork0_#res#1.offset_4|, thr1Thread1of2ForFork0_#in~arg#1.offset=|v_thr1Thread1of2ForFork0_#in~arg#1.offset_4|} AuxVars[] AssignedVars[thr1Thread1of2ForFork0_#res#1.base, thr1Thread1of2ForFork0_~arg#1.base, thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of2ForFork0_Barrier2_#t~post4#1, thr1Thread1of2ForFork0_thidvar1, thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread1of2ForFork0_~arg#1.offset, thr1Thread1of2ForFork0_thidvar0, thr1Thread1of2ForFork0_#in~arg#1.base, thr1Thread1of2ForFork0_#res#1.offset, thr1Thread1of2ForFork0_#in~arg#1.offset] {83#(= ~count~0 0)} is VALID [2022-02-20 20:12:27,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {83#(= ~count~0 0)} [346] thr1ENTRY-->L727: Formula: (and (= |v_thr1Thread1of2ForFork0_#in~arg#1.offset_1| |v_thr1Thread1of2ForFork0_~arg#1.offset_1|) (= |v_thr1Thread1of2ForFork0_~arg#1.base_1| |v_thr1Thread1of2ForFork0_#in~arg#1.base_1|)) InVars {thr1Thread1of2ForFork0_#in~arg#1.base=|v_thr1Thread1of2ForFork0_#in~arg#1.base_1|, thr1Thread1of2ForFork0_#in~arg#1.offset=|v_thr1Thread1of2ForFork0_#in~arg#1.offset_1|} OutVars{thr1Thread1of2ForFork0_~arg#1.base=|v_thr1Thread1of2ForFork0_~arg#1.base_1|, thr1Thread1of2ForFork0_~arg#1.offset=|v_thr1Thread1of2ForFork0_~arg#1.offset_1|, thr1Thread1of2ForFork0_#in~arg#1.base=|v_thr1Thread1of2ForFork0_#in~arg#1.base_1|, thr1Thread1of2ForFork0_#in~arg#1.offset=|v_thr1Thread1of2ForFork0_#in~arg#1.offset_1|} AuxVars[] AssignedVars[thr1Thread1of2ForFork0_~arg#1.base, thr1Thread1of2ForFork0_~arg#1.offset] {83#(= ~count~0 0)} is VALID [2022-02-20 20:12:27,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {83#(= ~count~0 0)} [347] L727-->L727-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {83#(= ~count~0 0)} is VALID [2022-02-20 20:12:27,641 INFO L290 TraceCheckUtils]: 23: Hoare triple {83#(= ~count~0 0)} [348] L727-1-->L718: Formula: true InVars {} OutVars{thr1Thread1of2ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of2ForFork0_Barrier2_#t~post4#1_1|} AuxVars[] AssignedVars[thr1Thread1of2ForFork0_Barrier2_#t~post4#1] {83#(= ~count~0 0)} is VALID [2022-02-20 20:12:27,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {83#(= ~count~0 0)} [349] L718-->L718-1: Formula: (and (not (= |v_thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= |v_thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1_1|) (= (ite (= (mod v_~MTX~0_61 256) 0) 1 0) |v_thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_1|) (= 1 v_~MTX~0_60)) InVars {~MTX~0=v_~MTX~0_61} OutVars{thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_1|, ~MTX~0=v_~MTX~0_60, thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~MTX~0, thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1] {83#(= ~count~0 0)} is VALID [2022-02-20 20:12:27,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {83#(= ~count~0 0)} [350] L718-1-->L719: Formula: (= |v_thr1Thread1of2ForFork0_Barrier2_#t~post4#1_3| v_~count~0_1) InVars {~count~0=v_~count~0_1} OutVars{thr1Thread1of2ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of2ForFork0_Barrier2_#t~post4#1_3|, ~count~0=v_~count~0_1} AuxVars[] AssignedVars[thr1Thread1of2ForFork0_Barrier2_#t~post4#1] {84#(= |thr1Thread1of2ForFork0_Barrier2_#t~post4#1| 0)} is VALID [2022-02-20 20:12:27,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {84#(= |thr1Thread1of2ForFork0_Barrier2_#t~post4#1| 0)} [351] L719-->L719-1: Formula: (= (+ |v_thr1Thread1of2ForFork0_Barrier2_#t~post4#1_5| 1) v_~count~0_2) InVars {thr1Thread1of2ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of2ForFork0_Barrier2_#t~post4#1_5|} OutVars{thr1Thread1of2ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of2ForFork0_Barrier2_#t~post4#1_5|, ~count~0=v_~count~0_2} AuxVars[] AssignedVars[~count~0] {85#(and (<= ~count~0 1) (not (<= (+ (div ~count~0 4294967296) 1) 0)))} is VALID [2022-02-20 20:12:27,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {85#(and (<= ~count~0 1) (not (<= (+ (div ~count~0 4294967296) 1) 0)))} [352] L719-1-->L720: Formula: true InVars {} OutVars{thr1Thread1of2ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of2ForFork0_Barrier2_#t~post4#1_7|} AuxVars[] AssignedVars[thr1Thread1of2ForFork0_Barrier2_#t~post4#1] {85#(and (<= ~count~0 1) (not (<= (+ (div ~count~0 4294967296) 1) 0)))} is VALID [2022-02-20 20:12:27,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {85#(and (<= ~count~0 1) (not (<= (+ (div ~count~0 4294967296) 1) 0)))} [353] L720-->L721: Formula: (= (mod v_~count~0_3 4294967296) 3) InVars {~count~0=v_~count~0_3} OutVars{~count~0=v_~count~0_3} AuxVars[] AssignedVars[] {82#false} is VALID [2022-02-20 20:12:27,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {82#false} [355] L721-->L721-1: Formula: (= v_~COND~0_1 1) InVars {} OutVars{~COND~0=v_~COND~0_1} AuxVars[] AssignedVars[~COND~0] {82#false} is VALID [2022-02-20 20:12:27,652 INFO L290 TraceCheckUtils]: 30: Hoare triple {82#false} [357] L721-1-->L724-6: Formula: (= v_~count~0_4 0) InVars {} OutVars{~count~0=v_~count~0_4} AuxVars[] AssignedVars[~count~0] {82#false} is VALID [2022-02-20 20:12:27,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {82#false} [359] L724-6-->L725: Formula: (and (= |v_thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1_7|) (not (= |v_thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1_7| 0)) (= 0 v_~MTX~0_54) (= (ite (= (mod v_~MTX~0_55 256) 1) 1 0) |v_thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_7|)) InVars {~MTX~0=v_~MTX~0_55} OutVars{thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1_7|, ~MTX~0=v_~MTX~0_54, thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1_7|} AuxVars[] AssignedVars[~MTX~0, thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1] {82#false} is VALID [2022-02-20 20:12:27,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {82#false} [361] L725-->L728: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {82#false} is VALID [2022-02-20 20:12:27,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {82#false} [364] L728-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {82#false} is VALID [2022-02-20 20:12:27,655 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:12:27,656 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:12:27,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247432089] [2022-02-20 20:12:27,657 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247432089] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:12:27,657 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:12:27,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:12:27,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927030556] [2022-02-20 20:12:27,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:12:27,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 34 [2022-02-20 20:12:27,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:12:27,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:12:27,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:12:27,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:12:27,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:12:27,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:12:27,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:12:27,753 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 78 [2022-02-20 20:12:27,756 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 78 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 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:12:27,756 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:12:27,756 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 78 [2022-02-20 20:12:27,757 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:12:28,184 INFO L129 PetriNetUnfolder]: 191/585 cut-off events. [2022-02-20 20:12:28,184 INFO L130 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-02-20 20:12:28,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 585 events. 191/585 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3421 event pairs, 26 based on Foata normal form. 290/850 useless extension candidates. Maximal degree in co-relation 931. Up to 168 conditions per place. [2022-02-20 20:12:28,197 INFO L132 encePairwiseOnDemand]: 63/78 looper letters, 67 selfloop transitions, 17 changer transitions 0/120 dead transitions. [2022-02-20 20:12:28,198 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 120 transitions, 435 flow [2022-02-20 20:12:28,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:12:28,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:12:28,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 434 transitions. [2022-02-20 20:12:28,215 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7948717948717948 [2022-02-20 20:12:28,215 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 434 transitions. [2022-02-20 20:12:28,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 434 transitions. [2022-02-20 20:12:28,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:12:28,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 434 transitions. [2022-02-20 20:12:28,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 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:12:28,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 78.0) internal successors, (624), 8 states have internal predecessors, (624), 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:12:28,226 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 78.0) internal successors, (624), 8 states have internal predecessors, (624), 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:12:28,227 INFO L186 Difference]: Start difference. First operand has 78 places, 78 transitions, 168 flow. Second operand 7 states and 434 transitions. [2022-02-20 20:12:28,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 120 transitions, 435 flow [2022-02-20 20:12:28,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 120 transitions, 433 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-02-20 20:12:28,233 INFO L242 Difference]: Finished difference. Result has 74 places, 77 transitions, 243 flow [2022-02-20 20:12:28,234 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=243, PETRI_PLACES=74, PETRI_TRANSITIONS=77} [2022-02-20 20:12:28,237 INFO L334 CegarLoopForPetriNet]: 78 programPoint places, -4 predicate places. [2022-02-20 20:12:28,237 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 77 transitions, 243 flow [2022-02-20 20:12:28,347 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4677 states, 4674 states have (on average 2.743260590500642) internal successors, (12822), 4676 states have internal predecessors, (12822), 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:12:28,364 INFO L78 Accepts]: Start accepts. Automaton has has 4677 states, 4674 states have (on average 2.743260590500642) internal successors, (12822), 4676 states have internal predecessors, (12822), 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 34 [2022-02-20 20:12:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:12:28,365 INFO L470 AbstractCegarLoop]: Abstraction has has 74 places, 77 transitions, 243 flow [2022-02-20 20:12:28,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.0) internal successors, (235), 5 states have internal predecessors, (235), 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:12:28,365 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:28,366 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:12:28,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:12:28,366 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:12:28,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:28,367 INFO L85 PathProgramCache]: Analyzing trace with hash -205340232, now seen corresponding path program 1 times [2022-02-20 20:12:28,367 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:28,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496348590] [2022-02-20 20:12:28,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:28,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:12:28,383 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:12:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:12:28,404 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:12:28,404 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:12:28,405 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 4 remaining) [2022-02-20 20:12:28,405 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-02-20 20:12:28,405 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-02-20 20:12:28,405 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-02-20 20:12:28,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:12:28,406 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 20:12:28,406 WARN L235 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-02-20 20:12:28,406 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-02-20 20:12:28,416 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,416 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,416 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,416 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,416 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,416 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,416 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,417 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,418 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,419 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,420 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,421 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,421 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,421 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,421 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,421 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,421 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,422 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,422 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,422 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,422 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,422 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,422 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,422 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,423 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,423 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,423 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,423 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,423 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,423 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,423 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,424 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,424 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,424 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,424 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,424 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,424 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,424 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,425 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,425 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,425 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,425 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,425 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,425 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,426 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,426 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,426 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,426 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,426 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,426 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,426 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,427 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,428 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,429 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,430 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,431 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,432 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,432 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,432 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,432 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,432 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,432 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,432 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,432 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,433 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,433 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,433 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,433 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,433 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,434 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,434 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,434 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,434 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,434 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,434 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,435 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,435 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,435 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,435 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,435 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,435 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,436 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,436 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,436 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,436 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,436 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_Barrier2_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,437 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:28,438 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:12:28,439 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:12:28,439 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:12:28,439 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-02-20 20:12:28,441 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 102 transitions, 225 flow [2022-02-20 20:12:28,449 INFO L129 PetriNetUnfolder]: 10/139 cut-off events. [2022-02-20 20:12:28,449 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-02-20 20:12:28,450 INFO L84 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 139 events. 10/139 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 315 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 106. Up to 8 conditions per place. [2022-02-20 20:12:28,451 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 102 transitions, 225 flow [2022-02-20 20:12:28,451 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 102 transitions, 225 flow [2022-02-20 20:12:28,455 INFO L129 PetriNetUnfolder]: 4/74 cut-off events. [2022-02-20 20:12:28,456 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:12:28,456 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:28,456 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] [2022-02-20 20:12:28,456 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 20:12:28,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:28,457 INFO L85 PathProgramCache]: Analyzing trace with hash -235705645, now seen corresponding path program 1 times [2022-02-20 20:12:28,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:28,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845030136] [2022-02-20 20:12:28,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:28,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:12:28,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#true} [411] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105#true} is VALID [2022-02-20 20:12:28,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} [398] 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] {105#true} is VALID [2022-02-20 20:12:28,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {105#true} [415] L-1-1-->L-1-2: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] {105#true} is VALID [2022-02-20 20:12:28,523 INFO L290 TraceCheckUtils]: 3: Hoare triple {105#true} [416] L-1-2-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {105#true} is VALID [2022-02-20 20:12:28,523 INFO L290 TraceCheckUtils]: 4: Hoare triple {105#true} [395] L16-->L16-1: Formula: (and (= (select |v_#valid_4| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {105#true} is VALID [2022-02-20 20:12:28,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {105#true} [372] L16-1-->L16-2: Formula: (= (select (select |v_#memory_int_3| 1) 0) 48) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] {105#true} is VALID [2022-02-20 20:12:28,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {105#true} [418] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_4| 1) 1) 0) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] {105#true} is VALID [2022-02-20 20:12:28,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {105#true} [408] L16-3-->L16-4: Formula: (and (= (select |v_#valid_5| 2) 1) (= 16 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {105#true} is VALID [2022-02-20 20:12:28,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {105#true} [409] L16-4-->L705: Formula: (= v_~count~0_6 0) InVars {} OutVars{~count~0=v_~count~0_6} AuxVars[] AssignedVars[~count~0] {107#(= ~count~0 0)} is VALID [2022-02-20 20:12:28,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {107#(= ~count~0 0)} [397] L705-->L706: Formula: (= v_~MTX~0_9 0) InVars {} OutVars{~MTX~0=v_~MTX~0_9} AuxVars[] AssignedVars[~MTX~0] {107#(= ~count~0 0)} is VALID [2022-02-20 20:12:28,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {107#(= ~count~0 0)} [402] L706-->L-1-3: Formula: (= v_~COND~0_4 0) InVars {} OutVars{~COND~0=v_~COND~0_4} AuxVars[] AssignedVars[~COND~0] {107#(= ~count~0 0)} is VALID [2022-02-20 20:12:28,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {107#(= ~count~0 0)} [417] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#(= ~count~0 0)} is VALID [2022-02-20 20:12:28,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {107#(= ~count~0 0)} [407] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#(= ~count~0 0)} is VALID [2022-02-20 20:12:28,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {107#(= ~count~0 0)} [382] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {107#(= ~count~0 0)} is VALID [2022-02-20 20:12:28,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {107#(= ~count~0 0)} [406] L-1-6-->L732: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_4|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_4|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#t~0#1.base] {107#(= ~count~0 0)} is VALID [2022-02-20 20:12:28,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {107#(= ~count~0 0)} [389] L732-->L733-7: Formula: (and (= |v_ULTIMATE.start_main_~#t~0#1.offset_5| 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t~0#1.base_5| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t~0#1.base_5| 0)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t~0#1.base_5|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_5| 4) |v_#length_3|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_5|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {107#(= ~count~0 0)} is VALID [2022-02-20 20:12:28,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {107#(= ~count~0 0)} [422] L733-7-->L733-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#(= ~count~0 0)} is VALID [2022-02-20 20:12:28,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {107#(= ~count~0 0)} [375] L733-1-->L733-2: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {107#(= ~count~0 0)} is VALID [2022-02-20 20:12:28,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {107#(= ~count~0 0)} [423] L733-2-->L733-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {107#(= ~count~0 0)} is VALID [2022-02-20 20:12:28,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {107#(= ~count~0 0)} [385] L733-3-->L733-4: Formula: (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t~0#1.base_1| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t~0#1.base_1|) |v_ULTIMATE.start_main_~#t~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre5#1_2|)) |v_#memory_int_1|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] {107#(= ~count~0 0)} is VALID [2022-02-20 20:12:28,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {107#(= ~count~0 0)} [495] L733-4-->thr1ENTRY: Formula: (and (= |v_thr1Thread1of3ForFork0_#in~arg#1.base_4| 0) (= |v_thr1Thread1of3ForFork0_#in~arg#1.offset_4| 0) (= v_thr1Thread1of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre5#1_12|) (= v_thr1Thread1of3ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_12|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_12|, thr1Thread1of3ForFork0_#in~arg#1.offset=|v_thr1Thread1of3ForFork0_#in~arg#1.offset_4|, thr1Thread1of3ForFork0_~arg#1.base=|v_thr1Thread1of3ForFork0_~arg#1.base_4|, thr1Thread1of3ForFork0_#res#1.base=|v_thr1Thread1of3ForFork0_#res#1.base_4|, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_12|, thr1Thread1of3ForFork0_#in~arg#1.base=|v_thr1Thread1of3ForFork0_#in~arg#1.base_4|, thr1Thread1of3ForFork0_#res#1.offset=|v_thr1Thread1of3ForFork0_#res#1.offset_4|, thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_10|, thr1Thread1of3ForFork0_~arg#1.offset=|v_thr1Thread1of3ForFork0_~arg#1.offset_4|, thr1Thread1of3ForFork0_thidvar1=v_thr1Thread1of3ForFork0_thidvar1_2, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_12|, thr1Thread1of3ForFork0_thidvar0=v_thr1Thread1of3ForFork0_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_#in~arg#1.offset, thr1Thread1of3ForFork0_~arg#1.base, thr1Thread1of3ForFork0_#res#1.base, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of3ForFork0_#in~arg#1.base, thr1Thread1of3ForFork0_#res#1.offset, thr1Thread1of3ForFork0_Barrier2_#t~post4#1, thr1Thread1of3ForFork0_~arg#1.offset, thr1Thread1of3ForFork0_thidvar1, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread1of3ForFork0_thidvar0] {107#(= ~count~0 0)} is VALID [2022-02-20 20:12:28,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {107#(= ~count~0 0)} [448] thr1ENTRY-->L727: Formula: (and (= |v_thr1Thread1of3ForFork0_~arg#1.base_1| |v_thr1Thread1of3ForFork0_#in~arg#1.base_1|) (= |v_thr1Thread1of3ForFork0_#in~arg#1.offset_1| |v_thr1Thread1of3ForFork0_~arg#1.offset_1|)) InVars {thr1Thread1of3ForFork0_#in~arg#1.offset=|v_thr1Thread1of3ForFork0_#in~arg#1.offset_1|, thr1Thread1of3ForFork0_#in~arg#1.base=|v_thr1Thread1of3ForFork0_#in~arg#1.base_1|} OutVars{thr1Thread1of3ForFork0_#in~arg#1.offset=|v_thr1Thread1of3ForFork0_#in~arg#1.offset_1|, thr1Thread1of3ForFork0_~arg#1.base=|v_thr1Thread1of3ForFork0_~arg#1.base_1|, thr1Thread1of3ForFork0_~arg#1.offset=|v_thr1Thread1of3ForFork0_~arg#1.offset_1|, thr1Thread1of3ForFork0_#in~arg#1.base=|v_thr1Thread1of3ForFork0_#in~arg#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_~arg#1.base, thr1Thread1of3ForFork0_~arg#1.offset] {107#(= ~count~0 0)} is VALID [2022-02-20 20:12:28,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {107#(= ~count~0 0)} [449] L727-->L727-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {107#(= ~count~0 0)} is VALID [2022-02-20 20:12:28,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {107#(= ~count~0 0)} [450] L727-1-->L718: Formula: true InVars {} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_1|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1] {107#(= ~count~0 0)} is VALID [2022-02-20 20:12:28,530 INFO L290 TraceCheckUtils]: 24: Hoare triple {107#(= ~count~0 0)} [451] L718-->L718-1: Formula: (and (not (= |v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= |v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_1|) (= (ite (= (mod v_~MTX~0_61 256) 0) 1 0) |v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_1|) (= 1 v_~MTX~0_60)) InVars {~MTX~0=v_~MTX~0_61} OutVars{~MTX~0=v_~MTX~0_60, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_1|, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~MTX~0, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1] {107#(= ~count~0 0)} is VALID [2022-02-20 20:12:28,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {107#(= ~count~0 0)} [452] L718-1-->L719: Formula: (= |v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_3| v_~count~0_1) InVars {~count~0=v_~count~0_1} OutVars{~count~0=v_~count~0_1, thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_3|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1] {108#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)} is VALID [2022-02-20 20:12:28,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {108#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)} [453] L719-->L719-1: Formula: (= (+ |v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_5| 1) v_~count~0_2) InVars {thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_5|} OutVars{~count~0=v_~count~0_2, thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_5|} AuxVars[] AssignedVars[~count~0] {109#(and (<= ~count~0 1) (not (<= (+ (div ~count~0 4294967296) 1) 0)))} is VALID [2022-02-20 20:12:28,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {109#(and (<= ~count~0 1) (not (<= (+ (div ~count~0 4294967296) 1) 0)))} [454] L719-1-->L720: Formula: true InVars {} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_7|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1] {109#(and (<= ~count~0 1) (not (<= (+ (div ~count~0 4294967296) 1) 0)))} is VALID [2022-02-20 20:12:28,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {109#(and (<= ~count~0 1) (not (<= (+ (div ~count~0 4294967296) 1) 0)))} [455] L720-->L721: Formula: (= (mod v_~count~0_3 4294967296) 3) InVars {~count~0=v_~count~0_3} OutVars{~count~0=v_~count~0_3} AuxVars[] AssignedVars[] {106#false} is VALID [2022-02-20 20:12:28,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {106#false} [457] L721-->L721-1: Formula: (= v_~COND~0_1 1) InVars {} OutVars{~COND~0=v_~COND~0_1} AuxVars[] AssignedVars[~COND~0] {106#false} is VALID [2022-02-20 20:12:28,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {106#false} [459] L721-1-->L724-6: Formula: (= v_~count~0_4 0) InVars {} OutVars{~count~0=v_~count~0_4} AuxVars[] AssignedVars[~count~0] {106#false} is VALID [2022-02-20 20:12:28,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {106#false} [461] L724-6-->L725: Formula: (and (= (ite (= (mod v_~MTX~0_55 256) 1) 1 0) |v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_7|) (= 0 v_~MTX~0_54) (not (= |v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_7| 0))) InVars {~MTX~0=v_~MTX~0_55} OutVars{~MTX~0=v_~MTX~0_54, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_7|, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~MTX~0, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1] {106#false} is VALID [2022-02-20 20:12:28,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {106#false} [463] L725-->L728: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#false} is VALID [2022-02-20 20:12:28,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {106#false} [466] L728-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {106#false} is VALID [2022-02-20 20:12:28,534 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:12:28,535 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:12:28,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845030136] [2022-02-20 20:12:28,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845030136] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:12:28,535 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:12:28,535 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:12:28,535 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582066410] [2022-02-20 20:12:28,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:12:28,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 34 [2022-02-20 20:12:28,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:12:28,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:12:28,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:12:28,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:12:28,561 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:12:28,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:12:28,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:12:28,562 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 102 [2022-02-20 20:12:28,563 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 102 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 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:12:28,563 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:12:28,563 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 102 [2022-02-20 20:12:28,563 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:12:29,903 INFO L129 PetriNetUnfolder]: 5046/10012 cut-off events. [2022-02-20 20:12:29,903 INFO L130 PetriNetUnfolder]: For 1432/1432 co-relation queries the response was YES. [2022-02-20 20:12:29,931 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18914 conditions, 10012 events. 5046/10012 cut-off events. For 1432/1432 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 87022 event pairs, 964 based on Foata normal form. 3867/13423 useless extension candidates. Maximal degree in co-relation 8026. Up to 3530 conditions per place. [2022-02-20 20:12:29,992 INFO L132 encePairwiseOnDemand]: 82/102 looper letters, 132 selfloop transitions, 25 changer transitions 0/201 dead transitions. [2022-02-20 20:12:29,993 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 201 transitions, 787 flow [2022-02-20 20:12:29,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:12:29,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:12:30,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 594 transitions. [2022-02-20 20:12:30,001 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8319327731092437 [2022-02-20 20:12:30,002 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 594 transitions. [2022-02-20 20:12:30,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 594 transitions. [2022-02-20 20:12:30,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:12:30,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 594 transitions. [2022-02-20 20:12:30,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 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:12:30,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 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:12:30,006 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 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:12:30,007 INFO L186 Difference]: Start difference. First operand has 102 places, 102 transitions, 225 flow. Second operand 7 states and 594 transitions. [2022-02-20 20:12:30,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 201 transitions, 787 flow [2022-02-20 20:12:30,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 201 transitions, 771 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-02-20 20:12:30,016 INFO L242 Difference]: Finished difference. Result has 95 places, 109 transitions, 371 flow [2022-02-20 20:12:30,017 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=371, PETRI_PLACES=95, PETRI_TRANSITIONS=109} [2022-02-20 20:12:30,018 INFO L334 CegarLoopForPetriNet]: 102 programPoint places, -7 predicate places. [2022-02-20 20:12:30,019 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 109 transitions, 371 flow [2022-02-20 20:12:33,305 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 103437 states, 103434 states have (on average 3.7038691339404837) internal successors, (383106), 103436 states have internal predecessors, (383106), 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:12:33,602 INFO L78 Accepts]: Start accepts. Automaton has has 103437 states, 103434 states have (on average 3.7038691339404837) internal successors, (383106), 103436 states have internal predecessors, (383106), 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 34 [2022-02-20 20:12:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:12:33,603 INFO L470 AbstractCegarLoop]: Abstraction has has 95 places, 109 transitions, 371 flow [2022-02-20 20:12:33,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 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:12:33,604 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:33,604 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] [2022-02-20 20:12:33,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:12:33,608 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 20:12:33,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:33,609 INFO L85 PathProgramCache]: Analyzing trace with hash -514918960, now seen corresponding path program 1 times [2022-02-20 20:12:33,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:33,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884079674] [2022-02-20 20:12:33,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:33,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:12:33,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {103558#true} [411] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {103558#true} is VALID [2022-02-20 20:12:33,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {103558#true} [398] 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] {103558#true} is VALID [2022-02-20 20:12:33,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {103558#true} [415] L-1-1-->L-1-2: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] {103558#true} is VALID [2022-02-20 20:12:33,724 INFO L290 TraceCheckUtils]: 3: Hoare triple {103558#true} [416] L-1-2-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {103558#true} is VALID [2022-02-20 20:12:33,724 INFO L290 TraceCheckUtils]: 4: Hoare triple {103558#true} [395] L16-->L16-1: Formula: (and (= (select |v_#valid_4| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {103558#true} is VALID [2022-02-20 20:12:33,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {103558#true} [372] L16-1-->L16-2: Formula: (= (select (select |v_#memory_int_3| 1) 0) 48) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] {103558#true} is VALID [2022-02-20 20:12:33,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {103558#true} [418] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_4| 1) 1) 0) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] {103558#true} is VALID [2022-02-20 20:12:33,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {103558#true} [408] L16-3-->L16-4: Formula: (and (= (select |v_#valid_5| 2) 1) (= 16 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {103558#true} is VALID [2022-02-20 20:12:33,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {103558#true} [409] L16-4-->L705: Formula: (= v_~count~0_6 0) InVars {} OutVars{~count~0=v_~count~0_6} AuxVars[] AssignedVars[~count~0] {103558#true} is VALID [2022-02-20 20:12:33,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {103558#true} [397] L705-->L706: Formula: (= v_~MTX~0_9 0) InVars {} OutVars{~MTX~0=v_~MTX~0_9} AuxVars[] AssignedVars[~MTX~0] {103558#true} is VALID [2022-02-20 20:12:33,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {103558#true} [402] L706-->L-1-3: Formula: (= v_~COND~0_4 0) InVars {} OutVars{~COND~0=v_~COND~0_4} AuxVars[] AssignedVars[~COND~0] {103560#(= ~COND~0 0)} is VALID [2022-02-20 20:12:33,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {103560#(= ~COND~0 0)} [417] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {103560#(= ~COND~0 0)} is VALID [2022-02-20 20:12:33,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {103560#(= ~COND~0 0)} [407] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {103560#(= ~COND~0 0)} is VALID [2022-02-20 20:12:33,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {103560#(= ~COND~0 0)} [382] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {103560#(= ~COND~0 0)} is VALID [2022-02-20 20:12:33,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {103560#(= ~COND~0 0)} [406] L-1-6-->L732: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_4|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_4|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#t~0#1.base] {103560#(= ~COND~0 0)} is VALID [2022-02-20 20:12:33,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {103560#(= ~COND~0 0)} [389] L732-->L733-7: Formula: (and (= |v_ULTIMATE.start_main_~#t~0#1.offset_5| 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t~0#1.base_5| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t~0#1.base_5| 0)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t~0#1.base_5|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_5| 4) |v_#length_3|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_5|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {103560#(= ~COND~0 0)} is VALID [2022-02-20 20:12:33,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {103560#(= ~COND~0 0)} [422] L733-7-->L733-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {103560#(= ~COND~0 0)} is VALID [2022-02-20 20:12:33,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {103560#(= ~COND~0 0)} [375] L733-1-->L733-2: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {103560#(= ~COND~0 0)} is VALID [2022-02-20 20:12:33,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {103560#(= ~COND~0 0)} [423] L733-2-->L733-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {103560#(= ~COND~0 0)} is VALID [2022-02-20 20:12:33,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {103560#(= ~COND~0 0)} [385] L733-3-->L733-4: Formula: (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t~0#1.base_1| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t~0#1.base_1|) |v_ULTIMATE.start_main_~#t~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre5#1_2|)) |v_#memory_int_1|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] {103560#(= ~COND~0 0)} is VALID [2022-02-20 20:12:33,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {103560#(= ~COND~0 0)} [495] L733-4-->thr1ENTRY: Formula: (and (= |v_thr1Thread1of3ForFork0_#in~arg#1.base_4| 0) (= |v_thr1Thread1of3ForFork0_#in~arg#1.offset_4| 0) (= v_thr1Thread1of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre5#1_12|) (= v_thr1Thread1of3ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_12|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_12|, thr1Thread1of3ForFork0_#in~arg#1.offset=|v_thr1Thread1of3ForFork0_#in~arg#1.offset_4|, thr1Thread1of3ForFork0_~arg#1.base=|v_thr1Thread1of3ForFork0_~arg#1.base_4|, thr1Thread1of3ForFork0_#res#1.base=|v_thr1Thread1of3ForFork0_#res#1.base_4|, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_12|, thr1Thread1of3ForFork0_#in~arg#1.base=|v_thr1Thread1of3ForFork0_#in~arg#1.base_4|, thr1Thread1of3ForFork0_#res#1.offset=|v_thr1Thread1of3ForFork0_#res#1.offset_4|, thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_10|, thr1Thread1of3ForFork0_~arg#1.offset=|v_thr1Thread1of3ForFork0_~arg#1.offset_4|, thr1Thread1of3ForFork0_thidvar1=v_thr1Thread1of3ForFork0_thidvar1_2, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_12|, thr1Thread1of3ForFork0_thidvar0=v_thr1Thread1of3ForFork0_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_#in~arg#1.offset, thr1Thread1of3ForFork0_~arg#1.base, thr1Thread1of3ForFork0_#res#1.base, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of3ForFork0_#in~arg#1.base, thr1Thread1of3ForFork0_#res#1.offset, thr1Thread1of3ForFork0_Barrier2_#t~post4#1, thr1Thread1of3ForFork0_~arg#1.offset, thr1Thread1of3ForFork0_thidvar1, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread1of3ForFork0_thidvar0] {103560#(= ~COND~0 0)} is VALID [2022-02-20 20:12:33,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {103560#(= ~COND~0 0)} [448] thr1ENTRY-->L727: Formula: (and (= |v_thr1Thread1of3ForFork0_~arg#1.base_1| |v_thr1Thread1of3ForFork0_#in~arg#1.base_1|) (= |v_thr1Thread1of3ForFork0_#in~arg#1.offset_1| |v_thr1Thread1of3ForFork0_~arg#1.offset_1|)) InVars {thr1Thread1of3ForFork0_#in~arg#1.offset=|v_thr1Thread1of3ForFork0_#in~arg#1.offset_1|, thr1Thread1of3ForFork0_#in~arg#1.base=|v_thr1Thread1of3ForFork0_#in~arg#1.base_1|} OutVars{thr1Thread1of3ForFork0_#in~arg#1.offset=|v_thr1Thread1of3ForFork0_#in~arg#1.offset_1|, thr1Thread1of3ForFork0_~arg#1.base=|v_thr1Thread1of3ForFork0_~arg#1.base_1|, thr1Thread1of3ForFork0_~arg#1.offset=|v_thr1Thread1of3ForFork0_~arg#1.offset_1|, thr1Thread1of3ForFork0_#in~arg#1.base=|v_thr1Thread1of3ForFork0_#in~arg#1.base_1|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_~arg#1.base, thr1Thread1of3ForFork0_~arg#1.offset] {103560#(= ~COND~0 0)} is VALID [2022-02-20 20:12:33,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {103560#(= ~COND~0 0)} [449] L727-->L727-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {103560#(= ~COND~0 0)} is VALID [2022-02-20 20:12:33,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {103560#(= ~COND~0 0)} [450] L727-1-->L718: Formula: true InVars {} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_1|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1] {103560#(= ~COND~0 0)} is VALID [2022-02-20 20:12:33,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {103560#(= ~COND~0 0)} [451] L718-->L718-1: Formula: (and (not (= |v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= |v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_1|) (= (ite (= (mod v_~MTX~0_61 256) 0) 1 0) |v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_1|) (= 1 v_~MTX~0_60)) InVars {~MTX~0=v_~MTX~0_61} OutVars{~MTX~0=v_~MTX~0_60, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_1|, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~MTX~0, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1] {103560#(= ~COND~0 0)} is VALID [2022-02-20 20:12:33,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {103560#(= ~COND~0 0)} [452] L718-1-->L719: Formula: (= |v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_3| v_~count~0_1) InVars {~count~0=v_~count~0_1} OutVars{~count~0=v_~count~0_1, thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_3|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1] {103560#(= ~COND~0 0)} is VALID [2022-02-20 20:12:33,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {103560#(= ~COND~0 0)} [453] L719-->L719-1: Formula: (= (+ |v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_5| 1) v_~count~0_2) InVars {thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_5|} OutVars{~count~0=v_~count~0_2, thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_5|} AuxVars[] AssignedVars[~count~0] {103560#(= ~COND~0 0)} is VALID [2022-02-20 20:12:33,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {103560#(= ~COND~0 0)} [454] L719-1-->L720: Formula: true InVars {} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_7|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1] {103560#(= ~COND~0 0)} is VALID [2022-02-20 20:12:33,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {103560#(= ~COND~0 0)} [456] L720-->L724: Formula: (not (= (mod v_~count~0_5 4294967296) 3)) InVars {~count~0=v_~count~0_5} OutVars{~count~0=v_~count~0_5} AuxVars[] AssignedVars[] {103560#(= ~COND~0 0)} is VALID [2022-02-20 20:12:33,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {103560#(= ~COND~0 0)} [458] L724-->L724-1: Formula: (and (= 0 v_~MTX~0_66) (not (= |v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= |v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_3|) (= (ite (= (mod v_~MTX~0_67 256) 1) 1 0) |v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_3|)) InVars {~MTX~0=v_~MTX~0_67} OutVars{~MTX~0=v_~MTX~0_66, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_3|, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[~MTX~0, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1] {103560#(= ~COND~0 0)} is VALID [2022-02-20 20:12:33,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {103560#(= ~COND~0 0)} [460] L724-1-->L724-4: Formula: (and (not (= |v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= |v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_5|) (= |v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_5| (mod v_~COND~0_13 256))) InVars {~COND~0=v_~COND~0_13} OutVars{thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_5|, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_5|, ~COND~0=v_~COND~0_13} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1] {103559#false} is VALID [2022-02-20 20:12:33,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {103559#false} [462] L724-4-->L724-5: Formula: (= v_~COND~0_3 0) InVars {} OutVars{~COND~0=v_~COND~0_3} AuxVars[] AssignedVars[~COND~0] {103559#false} is VALID [2022-02-20 20:12:33,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {103559#false} [464] L724-5-->L724-6: Formula: (and (not (= |v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_9| 0)) (= 1 v_~MTX~0_72) (= |v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_9| |v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_9|) (= |v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_9| (ite (= (mod v_~MTX~0_73 256) 0) 1 0))) InVars {~MTX~0=v_~MTX~0_73} OutVars{~MTX~0=v_~MTX~0_72, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_9|, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_9|} AuxVars[] AssignedVars[~MTX~0, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1] {103559#false} is VALID [2022-02-20 20:12:33,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {103559#false} [461] L724-6-->L725: Formula: (and (= (ite (= (mod v_~MTX~0_55 256) 1) 1 0) |v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_7|) (= |v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_7|) (= 0 v_~MTX~0_54) (not (= |v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_7| 0))) InVars {~MTX~0=v_~MTX~0_55} OutVars{~MTX~0=v_~MTX~0_54, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_7|, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~MTX~0, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1] {103559#false} is VALID [2022-02-20 20:12:33,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {103559#false} [463] L725-->L728: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {103559#false} is VALID [2022-02-20 20:12:33,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {103559#false} [466] L728-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {103559#false} is VALID [2022-02-20 20:12:33,735 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:12:33,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:12:33,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884079674] [2022-02-20 20:12:33,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884079674] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:12:33,736 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:12:33,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:12:33,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346349239] [2022-02-20 20:12:33,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:12:33,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2022-02-20 20:12:33,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:12:33,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:12:33,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:12:33,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:12:33,758 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:12:33,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:12:33,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:12:33,760 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 102 [2022-02-20 20:12:33,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 109 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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:12:33,760 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:12:33,760 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 102 [2022-02-20 20:12:33,760 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:12:34,312 INFO L129 PetriNetUnfolder]: 1981/4991 cut-off events. [2022-02-20 20:12:34,312 INFO L130 PetriNetUnfolder]: For 1074/1132 co-relation queries the response was YES. [2022-02-20 20:12:34,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9854 conditions, 4991 events. 1981/4991 cut-off events. For 1074/1132 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 47378 event pairs, 666 based on Foata normal form. 194/4904 useless extension candidates. Maximal degree in co-relation 9782. Up to 1572 conditions per place. [2022-02-20 20:12:34,358 INFO L132 encePairwiseOnDemand]: 92/102 looper letters, 37 selfloop transitions, 7 changer transitions 0/128 dead transitions. [2022-02-20 20:12:34,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 128 transitions, 502 flow [2022-02-20 20:12:34,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:12:34,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:12:34,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2022-02-20 20:12:34,361 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8006535947712419 [2022-02-20 20:12:34,361 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 245 transitions. [2022-02-20 20:12:34,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 245 transitions. [2022-02-20 20:12:34,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:12:34,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 245 transitions. [2022-02-20 20:12:34,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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:12:34,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:12:34,374 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:12:34,374 INFO L186 Difference]: Start difference. First operand has 95 places, 109 transitions, 371 flow. Second operand 3 states and 245 transitions. [2022-02-20 20:12:34,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 128 transitions, 502 flow [2022-02-20 20:12:34,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 128 transitions, 502 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-02-20 20:12:34,670 INFO L242 Difference]: Finished difference. Result has 99 places, 115 transitions, 429 flow [2022-02-20 20:12:34,671 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=99, PETRI_TRANSITIONS=115} [2022-02-20 20:12:34,671 INFO L334 CegarLoopForPetriNet]: 102 programPoint places, -3 predicate places. [2022-02-20 20:12:34,673 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 99 places, 115 transitions, 429 flow [2022-02-20 20:12:37,382 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 92409 states, 92394 states have (on average 3.5786955862934824) internal successors, (330650), 92408 states have internal predecessors, (330650), 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:12:37,607 INFO L78 Accepts]: Start accepts. Automaton has has 92409 states, 92394 states have (on average 3.5786955862934824) internal successors, (330650), 92408 states have internal predecessors, (330650), 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 36 [2022-02-20 20:12:37,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:12:37,608 INFO L470 AbstractCegarLoop]: Abstraction has has 99 places, 115 transitions, 429 flow [2022-02-20 20:12:37,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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:12:37,608 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:37,608 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:12:37,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:12:37,609 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 20:12:37,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:37,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2097732028, now seen corresponding path program 1 times [2022-02-20 20:12:37,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:37,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045104359] [2022-02-20 20:12:37,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:37,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:12:37,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {195974#true} [411] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195974#true} is VALID [2022-02-20 20:12:37,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {195974#true} [398] 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] {195974#true} is VALID [2022-02-20 20:12:37,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {195974#true} [415] L-1-1-->L-1-2: Formula: (= (select |v_#valid_3| 0) 0) InVars {#valid=|v_#valid_3|} OutVars{#valid=|v_#valid_3|} AuxVars[] AssignedVars[] {195974#true} is VALID [2022-02-20 20:12:37,694 INFO L290 TraceCheckUtils]: 3: Hoare triple {195974#true} [416] L-1-2-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {195974#true} is VALID [2022-02-20 20:12:37,694 INFO L290 TraceCheckUtils]: 4: Hoare triple {195974#true} [395] L16-->L16-1: Formula: (and (= (select |v_#valid_4| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {195974#true} is VALID [2022-02-20 20:12:37,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {195974#true} [372] L16-1-->L16-2: Formula: (= (select (select |v_#memory_int_3| 1) 0) 48) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] {195974#true} is VALID [2022-02-20 20:12:37,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {195974#true} [418] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_4| 1) 1) 0) InVars {#memory_int=|v_#memory_int_4|} OutVars{#memory_int=|v_#memory_int_4|} AuxVars[] AssignedVars[] {195974#true} is VALID [2022-02-20 20:12:37,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {195974#true} [408] L16-3-->L16-4: Formula: (and (= (select |v_#valid_5| 2) 1) (= 16 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {195974#true} is VALID [2022-02-20 20:12:37,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {195974#true} [409] L16-4-->L705: Formula: (= v_~count~0_6 0) InVars {} OutVars{~count~0=v_~count~0_6} AuxVars[] AssignedVars[~count~0] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {195976#(= ~count~0 0)} [397] L705-->L706: Formula: (= v_~MTX~0_9 0) InVars {} OutVars{~MTX~0=v_~MTX~0_9} AuxVars[] AssignedVars[~MTX~0] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {195976#(= ~count~0 0)} [402] L706-->L-1-3: Formula: (= v_~COND~0_4 0) InVars {} OutVars{~COND~0=v_~COND~0_4} AuxVars[] AssignedVars[~COND~0] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {195976#(= ~count~0 0)} [417] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {195976#(= ~count~0 0)} [407] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {195976#(= ~count~0 0)} [382] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {195976#(= ~count~0 0)} [406] L-1-6-->L732: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_4|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_4|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#t~0#1.base] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {195976#(= ~count~0 0)} [389] L732-->L733-7: Formula: (and (= |v_ULTIMATE.start_main_~#t~0#1.offset_5| 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t~0#1.base_5| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t~0#1.base_5| 0)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t~0#1.base_5|) 0) (= (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_5| 4) |v_#length_3|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_5|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_5|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {195976#(= ~count~0 0)} [422] L733-7-->L733-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,712 INFO L290 TraceCheckUtils]: 17: Hoare triple {195976#(= ~count~0 0)} [375] L733-1-->L733-2: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {195976#(= ~count~0 0)} [423] L733-2-->L733-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {195976#(= ~count~0 0)} [385] L733-3-->L733-4: Formula: (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t~0#1.base_1| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t~0#1.base_1|) |v_ULTIMATE.start_main_~#t~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre5#1_2|)) |v_#memory_int_1|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {195976#(= ~count~0 0)} [495] L733-4-->thr1ENTRY: Formula: (and (= |v_thr1Thread1of3ForFork0_#in~arg#1.base_4| 0) (= |v_thr1Thread1of3ForFork0_#in~arg#1.offset_4| 0) (= v_thr1Thread1of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre5#1_12|) (= v_thr1Thread1of3ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_12|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_12|, thr1Thread1of3ForFork0_#in~arg#1.offset=|v_thr1Thread1of3ForFork0_#in~arg#1.offset_4|, thr1Thread1of3ForFork0_~arg#1.base=|v_thr1Thread1of3ForFork0_~arg#1.base_4|, thr1Thread1of3ForFork0_#res#1.base=|v_thr1Thread1of3ForFork0_#res#1.base_4|, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1_12|, thr1Thread1of3ForFork0_#in~arg#1.base=|v_thr1Thread1of3ForFork0_#in~arg#1.base_4|, thr1Thread1of3ForFork0_#res#1.offset=|v_thr1Thread1of3ForFork0_#res#1.offset_4|, thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_10|, thr1Thread1of3ForFork0_~arg#1.offset=|v_thr1Thread1of3ForFork0_~arg#1.offset_4|, thr1Thread1of3ForFork0_thidvar1=v_thr1Thread1of3ForFork0_thidvar1_2, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1_12|, thr1Thread1of3ForFork0_thidvar0=v_thr1Thread1of3ForFork0_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_#in~arg#1.offset, thr1Thread1of3ForFork0_~arg#1.base, thr1Thread1of3ForFork0_#res#1.base, thr1Thread1of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread1of3ForFork0_#in~arg#1.base, thr1Thread1of3ForFork0_#res#1.offset, thr1Thread1of3ForFork0_Barrier2_#t~post4#1, thr1Thread1of3ForFork0_~arg#1.offset, thr1Thread1of3ForFork0_thidvar1, thr1Thread1of3ForFork0_assume_abort_if_not_#in~cond#1, thr1Thread1of3ForFork0_thidvar0] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {195976#(= ~count~0 0)} [377] L733-5-->L733-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {195976#(= ~count~0 0)} [386] L733-6-->L733-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {195976#(= ~count~0 0)} [422] L733-7-->L733-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {195976#(= ~count~0 0)} [375] L733-1-->L733-2: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {195976#(= ~count~0 0)} [423] L733-2-->L733-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {195976#(= ~count~0 0)} [385] L733-3-->L733-4: Formula: (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t~0#1.base_1| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t~0#1.base_1|) |v_ULTIMATE.start_main_~#t~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre5#1_2|)) |v_#memory_int_1|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {195976#(= ~count~0 0)} [496] L733-4-->thr1ENTRY: Formula: (and (= |v_thr1Thread2of3ForFork0_#in~arg#1.offset_4| 0) (= v_thr1Thread2of3ForFork0_thidvar1_2 0) (= v_thr1Thread2of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre5#1_14|) (= |v_thr1Thread2of3ForFork0_#in~arg#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_14|} OutVars{thr1Thread2of3ForFork0_~arg#1.offset=|v_thr1Thread2of3ForFork0_~arg#1.offset_4|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_14|, thr1Thread2of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~post4#1_10|, thr1Thread2of3ForFork0_#res#1.offset=|v_thr1Thread2of3ForFork0_#res#1.offset_4|, thr1Thread2of3ForFork0_#in~arg#1.offset=|v_thr1Thread2of3ForFork0_#in~arg#1.offset_4|, thr1Thread2of3ForFork0_#in~arg#1.base=|v_thr1Thread2of3ForFork0_#in~arg#1.base_4|, thr1Thread2of3ForFork0_thidvar1=v_thr1Thread2of3ForFork0_thidvar1_2, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_12|, thr1Thread2of3ForFork0_#res#1.base=|v_thr1Thread2of3ForFork0_#res#1.base_4|, thr1Thread2of3ForFork0_thidvar0=v_thr1Thread2of3ForFork0_thidvar0_2, thr1Thread2of3ForFork0_~arg#1.base=|v_thr1Thread2of3ForFork0_~arg#1.base_4|, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_12|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_~arg#1.offset, thr1Thread2of3ForFork0_Barrier2_#t~post4#1, thr1Thread2of3ForFork0_#res#1.offset, thr1Thread2of3ForFork0_#in~arg#1.offset, thr1Thread2of3ForFork0_#in~arg#1.base, thr1Thread2of3ForFork0_thidvar1, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_#res#1.base, thr1Thread2of3ForFork0_thidvar0, thr1Thread2of3ForFork0_~arg#1.base, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {195976#(= ~count~0 0)} [471] thr1ENTRY-->L727: Formula: (and (= |v_thr1Thread2of3ForFork0_#in~arg#1.base_1| |v_thr1Thread2of3ForFork0_~arg#1.base_1|) (= |v_thr1Thread2of3ForFork0_~arg#1.offset_1| |v_thr1Thread2of3ForFork0_#in~arg#1.offset_1|)) InVars {thr1Thread2of3ForFork0_#in~arg#1.offset=|v_thr1Thread2of3ForFork0_#in~arg#1.offset_1|, thr1Thread2of3ForFork0_#in~arg#1.base=|v_thr1Thread2of3ForFork0_#in~arg#1.base_1|} OutVars{thr1Thread2of3ForFork0_~arg#1.offset=|v_thr1Thread2of3ForFork0_~arg#1.offset_1|, thr1Thread2of3ForFork0_~arg#1.base=|v_thr1Thread2of3ForFork0_~arg#1.base_1|, thr1Thread2of3ForFork0_#in~arg#1.offset=|v_thr1Thread2of3ForFork0_#in~arg#1.offset_1|, thr1Thread2of3ForFork0_#in~arg#1.base=|v_thr1Thread2of3ForFork0_#in~arg#1.base_1|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_~arg#1.offset, thr1Thread2of3ForFork0_~arg#1.base] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,719 INFO L290 TraceCheckUtils]: 29: Hoare triple {195976#(= ~count~0 0)} [472] L727-->L727-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {195976#(= ~count~0 0)} [473] L727-1-->L718: Formula: true InVars {} OutVars{thr1Thread2of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~post4#1_1|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_Barrier2_#t~post4#1] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,719 INFO L290 TraceCheckUtils]: 31: Hoare triple {195976#(= ~count~0 0)} [474] L718-->L718-1: Formula: (and (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_1|) (= (ite (= (mod v_~MTX~0_61 256) 0) 1 0) |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_1|) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= 1 v_~MTX~0_60)) InVars {~MTX~0=v_~MTX~0_61} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_1|, ~MTX~0=v_~MTX~0_60, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~MTX~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1] {195976#(= ~count~0 0)} is VALID [2022-02-20 20:12:37,720 INFO L290 TraceCheckUtils]: 32: Hoare triple {195976#(= ~count~0 0)} [475] L718-1-->L719: Formula: (= |v_thr1Thread2of3ForFork0_Barrier2_#t~post4#1_3| v_~count~0_1) InVars {~count~0=v_~count~0_1} OutVars{~count~0=v_~count~0_1, thr1Thread2of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~post4#1_3|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_Barrier2_#t~post4#1] {195977#(= |thr1Thread2of3ForFork0_Barrier2_#t~post4#1| 0)} is VALID [2022-02-20 20:12:37,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {195977#(= |thr1Thread2of3ForFork0_Barrier2_#t~post4#1| 0)} [476] L719-->L719-1: Formula: (= (+ |v_thr1Thread2of3ForFork0_Barrier2_#t~post4#1_5| 1) v_~count~0_2) InVars {thr1Thread2of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~post4#1_5|} OutVars{~count~0=v_~count~0_2, thr1Thread2of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~post4#1_5|} AuxVars[] AssignedVars[~count~0] {195978#(and (<= ~count~0 1) (not (<= (+ (div ~count~0 4294967296) 1) 0)))} is VALID [2022-02-20 20:12:37,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {195978#(and (<= ~count~0 1) (not (<= (+ (div ~count~0 4294967296) 1) 0)))} [477] L719-1-->L720: Formula: true InVars {} OutVars{thr1Thread2of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread2of3ForFork0_Barrier2_#t~post4#1_7|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_Barrier2_#t~post4#1] {195978#(and (<= ~count~0 1) (not (<= (+ (div ~count~0 4294967296) 1) 0)))} is VALID [2022-02-20 20:12:37,721 INFO L290 TraceCheckUtils]: 35: Hoare triple {195978#(and (<= ~count~0 1) (not (<= (+ (div ~count~0 4294967296) 1) 0)))} [478] L720-->L721: Formula: (= (mod v_~count~0_3 4294967296) 3) InVars {~count~0=v_~count~0_3} OutVars{~count~0=v_~count~0_3} AuxVars[] AssignedVars[] {195975#false} is VALID [2022-02-20 20:12:37,721 INFO L290 TraceCheckUtils]: 36: Hoare triple {195975#false} [480] L721-->L721-1: Formula: (= v_~COND~0_1 1) InVars {} OutVars{~COND~0=v_~COND~0_1} AuxVars[] AssignedVars[~COND~0] {195975#false} is VALID [2022-02-20 20:12:37,721 INFO L290 TraceCheckUtils]: 37: Hoare triple {195975#false} [482] L721-1-->L724-6: Formula: (= v_~count~0_4 0) InVars {} OutVars{~count~0=v_~count~0_4} AuxVars[] AssignedVars[~count~0] {195975#false} is VALID [2022-02-20 20:12:37,722 INFO L290 TraceCheckUtils]: 38: Hoare triple {195975#false} [484] L724-6-->L725: Formula: (and (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| (ite (= (mod v_~MTX~0_55 256) 1) 1 0)) (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7| |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_7|) (= 0 v_~MTX~0_54) (not (= |v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_7| 0))) InVars {~MTX~0=v_~MTX~0_55} OutVars{thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1_7|, ~MTX~0=v_~MTX~0_54, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1_7|} AuxVars[] AssignedVars[~MTX~0, thr1Thread2of3ForFork0_assume_abort_if_not_~cond#1, thr1Thread2of3ForFork0_assume_abort_if_not_#in~cond#1] {195975#false} is VALID [2022-02-20 20:12:37,722 INFO L290 TraceCheckUtils]: 39: Hoare triple {195975#false} [486] L725-->L728: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195975#false} is VALID [2022-02-20 20:12:37,722 INFO L290 TraceCheckUtils]: 40: Hoare triple {195975#false} [489] L728-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {195975#false} is VALID [2022-02-20 20:12:37,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 20:12:37,722 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:12:37,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045104359] [2022-02-20 20:12:37,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045104359] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:12:37,723 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:12:37,723 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:12:37,723 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34401561] [2022-02-20 20:12:37,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:12:37,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-02-20 20:12:37,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:12:37,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:12:37,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:12:37,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:12:37,748 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:12:37,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:12:37,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:12:37,749 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 102 [2022-02-20 20:12:37,750 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 115 transitions, 429 flow. Second operand has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 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:12:37,750 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:12:37,750 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 102 [2022-02-20 20:12:37,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:12:39,508 INFO L129 PetriNetUnfolder]: 5379/11526 cut-off events. [2022-02-20 20:12:39,509 INFO L130 PetriNetUnfolder]: For 9209/9354 co-relation queries the response was YES. [2022-02-20 20:12:39,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27759 conditions, 11526 events. 5379/11526 cut-off events. For 9209/9354 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 107566 event pairs, 1303 based on Foata normal form. 312/11721 useless extension candidates. Maximal degree in co-relation 27665. Up to 3984 conditions per place. [2022-02-20 20:12:39,640 INFO L132 encePairwiseOnDemand]: 90/102 looper letters, 142 selfloop transitions, 49 changer transitions 0/245 dead transitions. [2022-02-20 20:12:39,641 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 245 transitions, 1257 flow [2022-02-20 20:12:39,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:12:39,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:12:39,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 545 transitions. [2022-02-20 20:12:39,646 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7633053221288515 [2022-02-20 20:12:39,646 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 545 transitions. [2022-02-20 20:12:39,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 545 transitions. [2022-02-20 20:12:39,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:12:39,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 545 transitions. [2022-02-20 20:12:39,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 77.85714285714286) internal successors, (545), 7 states have internal predecessors, (545), 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:12:39,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 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:12:39,649 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 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:12:39,649 INFO L186 Difference]: Start difference. First operand has 99 places, 115 transitions, 429 flow. Second operand 7 states and 545 transitions. [2022-02-20 20:12:39,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 245 transitions, 1257 flow [2022-02-20 20:13:42,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 245 transitions, 1243 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-02-20 20:13:42,167 INFO L242 Difference]: Finished difference. Result has 107 places, 149 transitions, 772 flow [2022-02-20 20:13:42,170 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=102, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=772, PETRI_PLACES=107, PETRI_TRANSITIONS=149} [2022-02-20 20:13:42,172 INFO L334 CegarLoopForPetriNet]: 102 programPoint places, 5 predicate places. [2022-02-20 20:13:42,173 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 149 transitions, 772 flow