./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/46_monabsex2_vs.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/46_monabsex2_vs.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 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:12:33,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:12:33,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:12:33,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:12:33,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:12:33,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:12:33,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:12:33,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:12:33,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:12:33,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:12:33,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:12:33,627 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:12:33,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:12:33,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:12:33,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:12:33,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:12:33,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:12:33,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:12:33,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:12:33,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:12:33,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:12:33,638 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:12:33,639 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:12:33,639 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:12:33,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:12:33,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:12:33,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:12:33,646 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:12:33,646 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:12:33,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:12:33,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:12:33,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:12:33,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:12:33,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:12:33,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:12:33,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:12:33,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:12:33,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:12:33,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:12:33,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:12:33,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:12:33,653 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:33,674 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:12:33,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:12:33,675 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:12:33,675 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:12:33,675 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:12:33,675 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:12:33,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:12:33,676 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:12:33,676 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:12:33,676 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:12:33,676 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:12:33,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:12:33,676 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:12:33,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:12:33,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:12:33,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:12:33,676 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:12:33,677 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:12:33,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:12:33,677 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:12:33,677 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:12:33,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:12:33,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:12:33,677 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:12:33,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:12:33,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:12:33,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:12:33,677 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:12:33,677 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:12:33,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:12:33,678 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:12:33,678 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:12:33,678 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:12:33,678 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 -> 134e9604c8f91a200c8250c9fbb45867ed525dc78e65c16e0a5fa44f5d71ac67 [2022-02-20 20:12:33,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:12:33,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:12:33,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:12:33,905 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:12:33,906 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:12:33,907 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i [2022-02-20 20:12:33,957 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/984952647/713e5b5c786d4bd9a30418d234ce51cf/FLAGf137f3f15 [2022-02-20 20:12:34,334 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:12:34,335 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/46_monabsex2_vs.i [2022-02-20 20:12:34,347 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/984952647/713e5b5c786d4bd9a30418d234ce51cf/FLAGf137f3f15 [2022-02-20 20:12:34,717 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/984952647/713e5b5c786d4bd9a30418d234ce51cf [2022-02-20 20:12:34,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:12:34,720 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:12:34,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:12:34,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:12:34,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:12:34,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:12:34" (1/1) ... [2022-02-20 20:12:34,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c6e2258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:34, skipping insertion in model container [2022-02-20 20:12:34,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:12:34" (1/1) ... [2022-02-20 20:12:34,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:12:34,753 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:12:34,903 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-02-20 20:12:34,978 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/46_monabsex2_vs.i[30494,30507] [2022-02-20 20:12:34,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:12:34,996 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:12:35,022 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-02-20 20:12:35,046 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/46_monabsex2_vs.i[30494,30507] [2022-02-20 20:12:35,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:12:35,077 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:12:35,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:35 WrapperNode [2022-02-20 20:12:35,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:12:35,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:12:35,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:12:35,080 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:12:35,084 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:35" (1/1) ... [2022-02-20 20:12:35,104 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:35" (1/1) ... [2022-02-20 20:12:35,125 INFO L137 Inliner]: procedures = 170, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2022-02-20 20:12:35,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:12:35,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:12:35,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:12:35,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:12:35,131 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:35" (1/1) ... [2022-02-20 20:12:35,131 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:35" (1/1) ... [2022-02-20 20:12:35,132 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:35" (1/1) ... [2022-02-20 20:12:35,132 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:35" (1/1) ... [2022-02-20 20:12:35,136 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:35" (1/1) ... [2022-02-20 20:12:35,139 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:35" (1/1) ... [2022-02-20 20:12:35,143 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:35" (1/1) ... [2022-02-20 20:12:35,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:12:35,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:12:35,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:12:35,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:12:35,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:35" (1/1) ... [2022-02-20 20:12:35,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:12:35,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:12:35,176 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:35,184 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:35,205 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-02-20 20:12:35,206 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-02-20 20:12:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:12:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-20 20:12:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:12:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:12:35,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:12:35,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:12:35,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-20 20:12:35,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:12:35,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:12:35,211 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:35,286 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:12:35,287 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:12:35,421 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:12:35,433 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:12:35,433 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 20:12:35,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:12:35 BoogieIcfgContainer [2022-02-20 20:12:35,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:12:35,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:12:35,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:12:35,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:12:35,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:12:34" (1/3) ... [2022-02-20 20:12:35,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379a106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:12:35, skipping insertion in model container [2022-02-20 20:12:35,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:35" (2/3) ... [2022-02-20 20:12:35,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@379a106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:12:35, skipping insertion in model container [2022-02-20 20:12:35,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:12:35" (3/3) ... [2022-02-20 20:12:35,454 INFO L111 eAbstractionObserver]: Analyzing ICFG 46_monabsex2_vs.i [2022-02-20 20:12:35,462 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:12:35,462 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:12:35,463 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:12:35,463 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:12:35,514 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:35,515 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:35,515 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:35,515 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:35,516 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:35,516 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:35,516 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:35,516 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:35,518 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:35,518 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:35,518 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:35,519 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:35,522 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:35,524 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:35,524 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:35,524 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:35,525 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:12:35,566 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:12:35,571 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:35,572 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 20:12:35,583 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 37 transitions, 79 flow [2022-02-20 20:12:35,607 INFO L129 PetriNetUnfolder]: 2/48 cut-off events. [2022-02-20 20:12:35,609 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:12:35,611 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 48 events. 2/48 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 26. Up to 4 conditions per place. [2022-02-20 20:12:35,612 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 37 transitions, 79 flow [2022-02-20 20:12:35,615 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 37 transitions, 79 flow [2022-02-20 20:12:35,622 INFO L129 PetriNetUnfolder]: 2/31 cut-off events. [2022-02-20 20:12:35,622 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:12:35,622 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:35,623 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] [2022-02-20 20:12:35,623 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:12:35,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:35,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1096869042, now seen corresponding path program 1 times [2022-02-20 20:12:35,633 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:35,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100346741] [2022-02-20 20:12:35,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:35,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:12:35,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} [75] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-02-20 20:12:35,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [63] 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] {42#true} is VALID [2022-02-20 20:12:35,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [85] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {42#true} is VALID [2022-02-20 20:12:35,804 INFO L290 TraceCheckUtils]: 3: Hoare triple {42#true} [86] L-1-2-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {42#true} is VALID [2022-02-20 20:12:35,804 INFO L290 TraceCheckUtils]: 4: Hoare triple {42#true} [74] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {42#true} is VALID [2022-02-20 20:12:35,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} [60] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {42#true} is VALID [2022-02-20 20:12:35,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {42#true} [59] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {42#true} is VALID [2022-02-20 20:12:35,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} [77] L12-3-->L12-4: Formula: (and (= 18 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {42#true} is VALID [2022-02-20 20:12:35,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} [71] L12-4-->L701: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] {42#true} is VALID [2022-02-20 20:12:35,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#true} [82] L701-->L-1-3: Formula: (= v_~l~0_4 0) InVars {} OutVars{~l~0=v_~l~0_4} AuxVars[] AssignedVars[~l~0] {44#(= ~l~0 0)} is VALID [2022-02-20 20:12:35,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {44#(= ~l~0 0)} [88] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#(= ~l~0 0)} is VALID [2022-02-20 20:12:35,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {44#(= ~l~0 0)} [68] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#(= ~l~0 0)} is VALID [2022-02-20 20:12:35,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {44#(= ~l~0 0)} [73] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {44#(= ~l~0 0)} is VALID [2022-02-20 20:12:35,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {44#(= ~l~0 0)} [67] L-1-6-->L717: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t~0#1.base] {44#(= ~l~0 0)} is VALID [2022-02-20 20:12:35,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#(= ~l~0 0)} [78] L717-->L718-7: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {44#(= ~l~0 0)} is VALID [2022-02-20 20:12:35,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#(= ~l~0 0)} [81] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#(= ~l~0 0)} is VALID [2022-02-20 20:12:35,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {44#(= ~l~0 0)} [91] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {44#(= ~l~0 0)} is VALID [2022-02-20 20:12:35,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {44#(= ~l~0 0)} [87] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {44#(= ~l~0 0)} is VALID [2022-02-20 20:12:35,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {44#(= ~l~0 0)} [64] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {44#(= ~l~0 0)} is VALID [2022-02-20 20:12:35,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {44#(= ~l~0 0)} [103] L718-4-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~arg.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~arg.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{thr1Thread1of1ForFork0_#in~arg.offset=|v_thr1Thread1of1ForFork0_#in~arg.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, thr1Thread1of1ForFork0_~arg.offset=v_thr1Thread1of1ForFork0_~arg.offset_4, thr1Thread1of1ForFork0_~arg.base=v_thr1Thread1of1ForFork0_~arg.base_4, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~arg.base=|v_thr1Thread1of1ForFork0_#in~arg.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_#in~arg.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_~arg.offset, thr1Thread1of1ForFork0_~arg.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~arg.base, thr1Thread1of1ForFork0_#res.offset] {44#(= ~l~0 0)} is VALID [2022-02-20 20:12:35,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#(= ~l~0 0)} [95] thr1ENTRY-->L704: Formula: (and (= v_thr1Thread1of1ForFork0_~arg.base_1 |v_thr1Thread1of1ForFork0_#in~arg.base_1|) (= |v_thr1Thread1of1ForFork0_#in~arg.offset_1| v_thr1Thread1of1ForFork0_~arg.offset_1)) InVars {thr1Thread1of1ForFork0_#in~arg.offset=|v_thr1Thread1of1ForFork0_#in~arg.offset_1|, thr1Thread1of1ForFork0_#in~arg.base=|v_thr1Thread1of1ForFork0_#in~arg.base_1|} OutVars{thr1Thread1of1ForFork0_#in~arg.offset=|v_thr1Thread1of1ForFork0_#in~arg.offset_1|, thr1Thread1of1ForFork0_#in~arg.base=|v_thr1Thread1of1ForFork0_#in~arg.base_1|, thr1Thread1of1ForFork0_~arg.offset=v_thr1Thread1of1ForFork0_~arg.offset_1, thr1Thread1of1ForFork0_~arg.base=v_thr1Thread1of1ForFork0_~arg.base_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~arg.offset, thr1Thread1of1ForFork0_~arg.base] {44#(= ~l~0 0)} is VALID [2022-02-20 20:12:35,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {44#(= ~l~0 0)} [96] L704-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= (mod v_~l~0_5 256) 0)) (= (mod v_~s~0_5 256) 0)) InVars {~l~0=v_~l~0_5, ~s~0=v_~s~0_5} OutVars{~l~0=v_~l~0_5, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[] {43#false} is VALID [2022-02-20 20:12:35,821 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:35,823 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:12:35,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100346741] [2022-02-20 20:12:35,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100346741] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:12:35,824 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:12:35,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:12:35,825 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969644275] [2022-02-20 20:12:35,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:12:35,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2022-02-20 20:12:35,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:12:35,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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:35,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:12:35,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:12:35,868 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:12:35,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:12:35,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:12:35,889 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 37 [2022-02-20 20:12:35,891 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:35,891 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:12:35,891 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 37 [2022-02-20 20:12:35,892 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:12:35,914 INFO L129 PetriNetUnfolder]: 0/33 cut-off events. [2022-02-20 20:12:35,915 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:12:35,915 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 33 events. 0/33 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 12 event pairs, 0 based on Foata normal form. 4/37 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-02-20 20:12:35,916 INFO L132 encePairwiseOnDemand]: 32/37 looper letters, 2 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-02-20 20:12:35,916 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 71 flow [2022-02-20 20:12:35,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:12:35,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:12:35,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2022-02-20 20:12:35,928 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8918918918918919 [2022-02-20 20:12:35,941 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 99 transitions. [2022-02-20 20:12:35,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 99 transitions. [2022-02-20 20:12:35,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:12:35,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 99 transitions. [2022-02-20 20:12:35,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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:35,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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:35,947 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 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:35,948 INFO L186 Difference]: Start difference. First operand has 39 places, 37 transitions, 79 flow. Second operand 3 states and 99 transitions. [2022-02-20 20:12:35,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 71 flow [2022-02-20 20:12:35,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 71 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-02-20 20:12:35,952 INFO L242 Difference]: Finished difference. Result has 34 places, 29 transitions, 67 flow [2022-02-20 20:12:35,953 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2022-02-20 20:12:35,955 INFO L334 CegarLoopForPetriNet]: 39 programPoint places, -5 predicate places. [2022-02-20 20:12:35,956 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 29 transitions, 67 flow [2022-02-20 20:12:35,965 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 76 states, 75 states have (on average 1.56) internal successors, (117), 75 states have internal predecessors, (117), 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:35,966 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 1.56) internal successors, (117), 75 states have internal predecessors, (117), 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 22 [2022-02-20 20:12:35,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:12:35,967 INFO L470 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 67 flow [2022-02-20 20:12:35,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:35,967 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:35,968 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] [2022-02-20 20:12:35,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:12:35,968 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:12:35,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:35,969 INFO L85 PathProgramCache]: Analyzing trace with hash 750747050, now seen corresponding path program 1 times [2022-02-20 20:12:35,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:35,969 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626197178] [2022-02-20 20:12:35,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:35,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:12:36,005 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:12:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:12:36,035 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:12:36,036 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:12:36,037 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 3 remaining) [2022-02-20 20:12:36,038 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-02-20 20:12:36,038 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-02-20 20:12:36,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:12:36,041 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 20:12:36,044 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-02-20 20:12:36,044 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-02-20 20:12:36,058 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,058 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,058 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,058 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,059 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,059 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,059 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,059 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,060 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,060 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,060 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,060 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,060 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,060 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,060 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,060 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,060 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,061 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,061 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,061 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,061 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,061 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,061 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,062 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,062 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,062 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,062 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,062 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,063 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,063 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,063 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,063 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,063 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:12:36,065 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:12:36,065 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:36,065 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 20:12:36,066 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 102 flow [2022-02-20 20:12:36,077 INFO L129 PetriNetUnfolder]: 3/69 cut-off events. [2022-02-20 20:12:36,077 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-02-20 20:12:36,077 INFO L84 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 69 events. 3/69 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 49. Up to 6 conditions per place. [2022-02-20 20:12:36,078 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 45 transitions, 102 flow [2022-02-20 20:12:36,078 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 45 transitions, 102 flow [2022-02-20 20:12:36,082 INFO L129 PetriNetUnfolder]: 2/32 cut-off events. [2022-02-20 20:12:36,082 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:12:36,082 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:36,082 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] [2022-02-20 20:12:36,082 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:36,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:36,083 INFO L85 PathProgramCache]: Analyzing trace with hash 816539065, now seen corresponding path program 1 times [2022-02-20 20:12:36,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:36,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413854265] [2022-02-20 20:12:36,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:36,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:12:36,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {52#true} [120] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52#true} is VALID [2022-02-20 20:12:36,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {52#true} [108] 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] {52#true} is VALID [2022-02-20 20:12:36,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {52#true} [130] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {52#true} is VALID [2022-02-20 20:12:36,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {52#true} [131] L-1-2-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {52#true} is VALID [2022-02-20 20:12:36,128 INFO L290 TraceCheckUtils]: 4: Hoare triple {52#true} [119] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {52#true} is VALID [2022-02-20 20:12:36,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {52#true} [105] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {52#true} is VALID [2022-02-20 20:12:36,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {52#true} [104] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {52#true} is VALID [2022-02-20 20:12:36,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {52#true} [122] L12-3-->L12-4: Formula: (and (= 18 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {52#true} is VALID [2022-02-20 20:12:36,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {52#true} [116] L12-4-->L701: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] {52#true} is VALID [2022-02-20 20:12:36,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {52#true} [127] L701-->L-1-3: Formula: (= v_~l~0_4 0) InVars {} OutVars{~l~0=v_~l~0_4} AuxVars[] AssignedVars[~l~0] {54#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {54#(= ~l~0 0)} [133] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {54#(= ~l~0 0)} [113] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {54#(= ~l~0 0)} [118] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {54#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {54#(= ~l~0 0)} [112] L-1-6-->L717: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t~0#1.base] {54#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {54#(= ~l~0 0)} [123] L717-->L718-7: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {54#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {54#(= ~l~0 0)} [126] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {54#(= ~l~0 0)} [136] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {54#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {54#(= ~l~0 0)} [132] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {54#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {54#(= ~l~0 0)} [109] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {54#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {54#(= ~l~0 0)} [155] L718-4-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of2ForFork0_#in~arg.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_8| v_thr1Thread1of2ForFork0_thidvar0_2) (= |v_thr1Thread1of2ForFork0_#in~arg.offset_4| 0) (= v_thr1Thread1of2ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_8|} OutVars{thr1Thread1of2ForFork0_#res.offset=|v_thr1Thread1of2ForFork0_#res.offset_4|, thr1Thread1of2ForFork0_~arg.offset=v_thr1Thread1of2ForFork0_~arg.offset_4, thr1Thread1of2ForFork0_~arg.base=v_thr1Thread1of2ForFork0_~arg.base_4, thr1Thread1of2ForFork0_#in~arg.base=|v_thr1Thread1of2ForFork0_#in~arg.base_4|, thr1Thread1of2ForFork0_thidvar1=v_thr1Thread1of2ForFork0_thidvar1_2, thr1Thread1of2ForFork0_thidvar0=v_thr1Thread1of2ForFork0_thidvar0_2, thr1Thread1of2ForFork0_#in~arg.offset=|v_thr1Thread1of2ForFork0_#in~arg.offset_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_8|, thr1Thread1of2ForFork0_#res.base=|v_thr1Thread1of2ForFork0_#res.base_4|} AuxVars[] AssignedVars[thr1Thread1of2ForFork0_#res.offset, thr1Thread1of2ForFork0_~arg.offset, thr1Thread1of2ForFork0_~arg.base, thr1Thread1of2ForFork0_#in~arg.base, thr1Thread1of2ForFork0_thidvar1, thr1Thread1of2ForFork0_thidvar0, thr1Thread1of2ForFork0_#in~arg.offset, thr1Thread1of2ForFork0_#res.base] {54#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {54#(= ~l~0 0)} [147] thr1ENTRY-->L704: Formula: (and (= |v_thr1Thread1of2ForFork0_#in~arg.offset_1| v_thr1Thread1of2ForFork0_~arg.offset_1) (= v_thr1Thread1of2ForFork0_~arg.base_1 |v_thr1Thread1of2ForFork0_#in~arg.base_1|)) InVars {thr1Thread1of2ForFork0_#in~arg.offset=|v_thr1Thread1of2ForFork0_#in~arg.offset_1|, thr1Thread1of2ForFork0_#in~arg.base=|v_thr1Thread1of2ForFork0_#in~arg.base_1|} OutVars{thr1Thread1of2ForFork0_~arg.offset=v_thr1Thread1of2ForFork0_~arg.offset_1, thr1Thread1of2ForFork0_~arg.base=v_thr1Thread1of2ForFork0_~arg.base_1, thr1Thread1of2ForFork0_#in~arg.offset=|v_thr1Thread1of2ForFork0_#in~arg.offset_1|, thr1Thread1of2ForFork0_#in~arg.base=|v_thr1Thread1of2ForFork0_#in~arg.base_1|} AuxVars[] AssignedVars[thr1Thread1of2ForFork0_~arg.offset, thr1Thread1of2ForFork0_~arg.base] {54#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {54#(= ~l~0 0)} [148] L704-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= (mod v_~l~0_5 256) 0)) (= (mod v_~s~0_5 256) 0)) InVars {~l~0=v_~l~0_5, ~s~0=v_~s~0_5} OutVars{~l~0=v_~l~0_5, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[] {53#false} is VALID [2022-02-20 20:12:36,145 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:36,145 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:12:36,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413854265] [2022-02-20 20:12:36,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413854265] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:12:36,145 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:12:36,145 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:12:36,145 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051971682] [2022-02-20 20:12:36,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:12:36,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2022-02-20 20:12:36,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:12:36,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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:36,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:12:36,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:12:36,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:12:36,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:12:36,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:12:36,182 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 45 [2022-02-20 20:12:36,183 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:36,183 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:12:36,183 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 45 [2022-02-20 20:12:36,183 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:12:36,221 INFO L129 PetriNetUnfolder]: 6/75 cut-off events. [2022-02-20 20:12:36,221 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-02-20 20:12:36,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 75 events. 6/75 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 148 event pairs, 2 based on Foata normal form. 15/87 useless extension candidates. Maximal degree in co-relation 37. Up to 13 conditions per place. [2022-02-20 20:12:36,222 INFO L132 encePairwiseOnDemand]: 38/45 looper letters, 11 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2022-02-20 20:12:36,222 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 131 flow [2022-02-20 20:12:36,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:12:36,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:12:36,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-02-20 20:12:36,225 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9037037037037037 [2022-02-20 20:12:36,225 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 122 transitions. [2022-02-20 20:12:36,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions. [2022-02-20 20:12:36,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:12:36,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions. [2022-02-20 20:12:36,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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:36,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 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:36,226 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 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:36,226 INFO L186 Difference]: Start difference. First operand has 49 places, 45 transitions, 102 flow. Second operand 3 states and 122 transitions. [2022-02-20 20:12:36,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 131 flow [2022-02-20 20:12:36,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 129 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-02-20 20:12:36,235 INFO L242 Difference]: Finished difference. Result has 46 places, 40 transitions, 107 flow [2022-02-20 20:12:36,235 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2022-02-20 20:12:36,236 INFO L334 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2022-02-20 20:12:36,236 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 40 transitions, 107 flow [2022-02-20 20:12:36,261 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 509 states, 506 states have (on average 2.466403162055336) internal successors, (1248), 508 states have internal predecessors, (1248), 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:36,264 INFO L78 Accepts]: Start accepts. Automaton has has 509 states, 506 states have (on average 2.466403162055336) internal successors, (1248), 508 states have internal predecessors, (1248), 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 22 [2022-02-20 20:12:36,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:12:36,265 INFO L470 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 107 flow [2022-02-20 20:12:36,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:36,265 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:36,265 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] [2022-02-20 20:12:36,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:12:36,266 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:12:36,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:36,266 INFO L85 PathProgramCache]: Analyzing trace with hash -217358121, now seen corresponding path program 1 times [2022-02-20 20:12:36,266 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:36,266 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857931202] [2022-02-20 20:12:36,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:36,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:12:36,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {567#true} [120] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-02-20 20:12:36,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {567#true} [108] 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] {567#true} is VALID [2022-02-20 20:12:36,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {567#true} [130] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {567#true} is VALID [2022-02-20 20:12:36,323 INFO L290 TraceCheckUtils]: 3: Hoare triple {567#true} [131] L-1-2-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {567#true} is VALID [2022-02-20 20:12:36,324 INFO L290 TraceCheckUtils]: 4: Hoare triple {567#true} [119] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {567#true} is VALID [2022-02-20 20:12:36,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {567#true} [105] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {567#true} is VALID [2022-02-20 20:12:36,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {567#true} [104] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {567#true} is VALID [2022-02-20 20:12:36,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {567#true} [122] L12-3-->L12-4: Formula: (and (= 18 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {567#true} is VALID [2022-02-20 20:12:36,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {567#true} [116] L12-4-->L701: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] {567#true} is VALID [2022-02-20 20:12:36,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {567#true} [127] L701-->L-1-3: Formula: (= v_~l~0_4 0) InVars {} OutVars{~l~0=v_~l~0_4} AuxVars[] AssignedVars[~l~0] {567#true} is VALID [2022-02-20 20:12:36,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {567#true} [133] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-02-20 20:12:36,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {567#true} [113] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-02-20 20:12:36,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {567#true} [118] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {567#true} is VALID [2022-02-20 20:12:36,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#true} [112] L-1-6-->L717: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t~0#1.base] {567#true} is VALID [2022-02-20 20:12:36,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {567#true} [123] L717-->L718-7: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {567#true} is VALID [2022-02-20 20:12:36,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {567#true} [126] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {567#true} is VALID [2022-02-20 20:12:36,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {567#true} [136] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {567#true} is VALID [2022-02-20 20:12:36,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {567#true} [132] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {567#true} is VALID [2022-02-20 20:12:36,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {567#true} [109] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {567#true} is VALID [2022-02-20 20:12:36,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {567#true} [155] L718-4-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of2ForFork0_#in~arg.base_4|) (= |v_ULTIMATE.start_main_#t~pre4#1_8| v_thr1Thread1of2ForFork0_thidvar0_2) (= |v_thr1Thread1of2ForFork0_#in~arg.offset_4| 0) (= v_thr1Thread1of2ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_8|} OutVars{thr1Thread1of2ForFork0_#res.offset=|v_thr1Thread1of2ForFork0_#res.offset_4|, thr1Thread1of2ForFork0_~arg.offset=v_thr1Thread1of2ForFork0_~arg.offset_4, thr1Thread1of2ForFork0_~arg.base=v_thr1Thread1of2ForFork0_~arg.base_4, thr1Thread1of2ForFork0_#in~arg.base=|v_thr1Thread1of2ForFork0_#in~arg.base_4|, thr1Thread1of2ForFork0_thidvar1=v_thr1Thread1of2ForFork0_thidvar1_2, thr1Thread1of2ForFork0_thidvar0=v_thr1Thread1of2ForFork0_thidvar0_2, thr1Thread1of2ForFork0_#in~arg.offset=|v_thr1Thread1of2ForFork0_#in~arg.offset_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_8|, thr1Thread1of2ForFork0_#res.base=|v_thr1Thread1of2ForFork0_#res.base_4|} AuxVars[] AssignedVars[thr1Thread1of2ForFork0_#res.offset, thr1Thread1of2ForFork0_~arg.offset, thr1Thread1of2ForFork0_~arg.base, thr1Thread1of2ForFork0_#in~arg.base, thr1Thread1of2ForFork0_thidvar1, thr1Thread1of2ForFork0_thidvar0, thr1Thread1of2ForFork0_#in~arg.offset, thr1Thread1of2ForFork0_#res.base] {567#true} is VALID [2022-02-20 20:12:36,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {567#true} [147] thr1ENTRY-->L704: Formula: (and (= |v_thr1Thread1of2ForFork0_#in~arg.offset_1| v_thr1Thread1of2ForFork0_~arg.offset_1) (= v_thr1Thread1of2ForFork0_~arg.base_1 |v_thr1Thread1of2ForFork0_#in~arg.base_1|)) InVars {thr1Thread1of2ForFork0_#in~arg.offset=|v_thr1Thread1of2ForFork0_#in~arg.offset_1|, thr1Thread1of2ForFork0_#in~arg.base=|v_thr1Thread1of2ForFork0_#in~arg.base_1|} OutVars{thr1Thread1of2ForFork0_~arg.offset=v_thr1Thread1of2ForFork0_~arg.offset_1, thr1Thread1of2ForFork0_~arg.base=v_thr1Thread1of2ForFork0_~arg.base_1, thr1Thread1of2ForFork0_#in~arg.offset=|v_thr1Thread1of2ForFork0_#in~arg.offset_1|, thr1Thread1of2ForFork0_#in~arg.base=|v_thr1Thread1of2ForFork0_#in~arg.base_1|} AuxVars[] AssignedVars[thr1Thread1of2ForFork0_~arg.offset, thr1Thread1of2ForFork0_~arg.base] {567#true} is VALID [2022-02-20 20:12:36,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {567#true} [149] L704-->L705-3: Formula: (or (not (= (mod v_~s~0_In_1 256) 0)) (= (mod v_~l~0_In_1 256) 0)) InVars {~l~0=v_~l~0_In_1, ~s~0=v_~s~0_In_1} OutVars{~l~0=v_~l~0_In_1, ~s~0=v_~s~0_In_1} AuxVars[] AssignedVars[] {567#true} is VALID [2022-02-20 20:12:36,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {567#true} [150] L705-3-->L709: Formula: (= v_~s~0_3 1) InVars {} OutVars{~s~0=v_~s~0_3} AuxVars[] AssignedVars[~s~0] {569#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:36,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {569#(= (+ (- 1) ~s~0) 0)} [151] L709-->L712: Formula: (= v_~l~0_3 1) InVars {} OutVars{~l~0=v_~l~0_3} AuxVars[] AssignedVars[~l~0] {569#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:36,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {569#(= (+ (- 1) ~s~0) 0)} [137] L718-5-->L718-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {569#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:36,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {569#(= (+ (- 1) ~s~0) 0)} [129] L718-6-->L718-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {569#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:36,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {569#(= (+ (- 1) ~s~0) 0)} [126] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {569#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:36,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {569#(= (+ (- 1) ~s~0) 0)} [136] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {569#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:36,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {569#(= (+ (- 1) ~s~0) 0)} [132] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {569#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:36,333 INFO L290 TraceCheckUtils]: 29: Hoare triple {569#(= (+ (- 1) ~s~0) 0)} [109] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {569#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:36,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {569#(= (+ (- 1) ~s~0) 0)} [156] L718-4-->thr1ENTRY: Formula: (and (= |v_thr1Thread2of2ForFork0_#in~arg.offset_4| 0) (= v_thr1Thread2of2ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre4#1_10|) (= v_thr1Thread2of2ForFork0_thidvar1_2 0) (= |v_thr1Thread2of2ForFork0_#in~arg.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_10|} OutVars{thr1Thread2of2ForFork0_#in~arg.base=|v_thr1Thread2of2ForFork0_#in~arg.base_4|, thr1Thread2of2ForFork0_~arg.base=v_thr1Thread2of2ForFork0_~arg.base_4, thr1Thread2of2ForFork0_#res.offset=|v_thr1Thread2of2ForFork0_#res.offset_4|, thr1Thread2of2ForFork0_thidvar0=v_thr1Thread2of2ForFork0_thidvar0_2, thr1Thread2of2ForFork0_thidvar1=v_thr1Thread2of2ForFork0_thidvar1_2, thr1Thread2of2ForFork0_#in~arg.offset=|v_thr1Thread2of2ForFork0_#in~arg.offset_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_10|, thr1Thread2of2ForFork0_#res.base=|v_thr1Thread2of2ForFork0_#res.base_4|, thr1Thread2of2ForFork0_~arg.offset=v_thr1Thread2of2ForFork0_~arg.offset_4} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_#in~arg.base, thr1Thread2of2ForFork0_~arg.base, thr1Thread2of2ForFork0_#res.offset, thr1Thread2of2ForFork0_thidvar0, thr1Thread2of2ForFork0_thidvar1, thr1Thread2of2ForFork0_#in~arg.offset, thr1Thread2of2ForFork0_#res.base, thr1Thread2of2ForFork0_~arg.offset] {569#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:36,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {569#(= (+ (- 1) ~s~0) 0)} [140] thr1ENTRY-->L704: Formula: (and (= |v_thr1Thread2of2ForFork0_#in~arg.offset_1| v_thr1Thread2of2ForFork0_~arg.offset_1) (= v_thr1Thread2of2ForFork0_~arg.base_1 |v_thr1Thread2of2ForFork0_#in~arg.base_1|)) InVars {thr1Thread2of2ForFork0_#in~arg.base=|v_thr1Thread2of2ForFork0_#in~arg.base_1|, thr1Thread2of2ForFork0_#in~arg.offset=|v_thr1Thread2of2ForFork0_#in~arg.offset_1|} OutVars{thr1Thread2of2ForFork0_#in~arg.base=|v_thr1Thread2of2ForFork0_#in~arg.base_1|, thr1Thread2of2ForFork0_~arg.base=v_thr1Thread2of2ForFork0_~arg.base_1, thr1Thread2of2ForFork0_#in~arg.offset=|v_thr1Thread2of2ForFork0_#in~arg.offset_1|, thr1Thread2of2ForFork0_~arg.offset=v_thr1Thread2of2ForFork0_~arg.offset_1} AuxVars[] AssignedVars[thr1Thread2of2ForFork0_~arg.base, thr1Thread2of2ForFork0_~arg.offset] {569#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:36,335 INFO L290 TraceCheckUtils]: 32: Hoare triple {569#(= (+ (- 1) ~s~0) 0)} [141] L704-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= (mod v_~l~0_5 256) 0)) (= (mod v_~s~0_5 256) 0)) InVars {~l~0=v_~l~0_5, ~s~0=v_~s~0_5} OutVars{~l~0=v_~l~0_5, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[] {568#false} is VALID [2022-02-20 20:12:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:12:36,336 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:12:36,336 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857931202] [2022-02-20 20:12:36,336 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857931202] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:12:36,336 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:12:36,336 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:12:36,337 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591375398] [2022-02-20 20:12:36,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:12:36,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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 33 [2022-02-20 20:12:36,338 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:12:36,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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:36,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:12:36,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:12:36,365 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:12:36,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:12:36,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:12:36,368 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 45 [2022-02-20 20:12:36,369 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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:36,369 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:12:36,369 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 45 [2022-02-20 20:12:36,369 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:12:36,426 INFO L129 PetriNetUnfolder]: 7/76 cut-off events. [2022-02-20 20:12:36,427 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-02-20 20:12:36,427 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 76 events. 7/76 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 149 event pairs, 2 based on Foata normal form. 2/77 useless extension candidates. Maximal degree in co-relation 81. Up to 10 conditions per place. [2022-02-20 20:12:36,428 INFO L132 encePairwiseOnDemand]: 41/45 looper letters, 10 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2022-02-20 20:12:36,428 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 138 flow [2022-02-20 20:12:36,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:12:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:12:36,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2022-02-20 20:12:36,438 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8592592592592593 [2022-02-20 20:12:36,438 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2022-02-20 20:12:36,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2022-02-20 20:12:36,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:12:36,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2022-02-20 20:12:36,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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:36,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 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:36,440 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 45.0) internal successors, (180), 4 states have internal predecessors, (180), 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:36,440 INFO L186 Difference]: Start difference. First operand has 46 places, 40 transitions, 107 flow. Second operand 3 states and 116 transitions. [2022-02-20 20:12:36,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 138 flow [2022-02-20 20:12:36,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:12:36,446 INFO L242 Difference]: Finished difference. Result has 46 places, 40 transitions, 110 flow [2022-02-20 20:12:36,446 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2022-02-20 20:12:36,447 INFO L334 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2022-02-20 20:12:36,448 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 40 transitions, 110 flow [2022-02-20 20:12:36,458 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 461 states, 460 states have (on average 2.4478260869565216) internal successors, (1126), 460 states have internal predecessors, (1126), 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:36,459 INFO L78 Accepts]: Start accepts. Automaton has has 461 states, 460 states have (on average 2.4478260869565216) internal successors, (1126), 460 states have internal predecessors, (1126), 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 33 [2022-02-20 20:12:36,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:12:36,459 INFO L470 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 110 flow [2022-02-20 20:12:36,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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:36,462 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:36,462 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] [2022-02-20 20:12:36,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:12:36,463 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:12:36,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:36,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1984575946, now seen corresponding path program 1 times [2022-02-20 20:12:36,463 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:36,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843110152] [2022-02-20 20:12:36,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:36,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:12:36,496 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:12:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:12:36,510 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:12:36,511 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:12:36,511 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 4 remaining) [2022-02-20 20:12:36,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-02-20 20:12:36,511 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-02-20 20:12:36,512 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-02-20 20:12:36,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:12:36,512 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 20:12:36,512 WARN L235 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-02-20 20:12:36,513 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-02-20 20:12:36,522 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,522 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,522 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,522 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,523 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,523 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,523 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,523 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,524 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,524 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,524 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,524 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,525 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,525 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,525 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,525 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,525 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,525 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,525 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,526 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,526 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,526 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,526 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,527 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,527 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,527 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,527 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,527 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,527 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,528 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,528 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,528 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,528 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,529 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,529 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,529 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,529 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,530 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,530 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,530 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,530 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,530 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,531 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,531 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,531 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,531 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,531 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,532 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:36,532 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:12:36,533 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:12:36,534 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:36,534 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-02-20 20:12:36,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 53 transitions, 127 flow [2022-02-20 20:12:36,551 INFO L129 PetriNetUnfolder]: 4/90 cut-off events. [2022-02-20 20:12:36,552 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-02-20 20:12:36,552 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 90 events. 4/90 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 125 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 73. Up to 8 conditions per place. [2022-02-20 20:12:36,552 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 53 transitions, 127 flow [2022-02-20 20:12:36,553 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 53 transitions, 127 flow [2022-02-20 20:12:36,555 INFO L129 PetriNetUnfolder]: 1/29 cut-off events. [2022-02-20 20:12:36,556 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:12:36,556 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:36,556 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] [2022-02-20 20:12:36,556 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:36,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:36,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1995165472, now seen corresponding path program 1 times [2022-02-20 20:12:36,557 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:36,557 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740341644] [2022-02-20 20:12:36,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:36,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:12:36,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {62#true} [173] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {62#true} is VALID [2022-02-20 20:12:36,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {62#true} [161] 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] {62#true} is VALID [2022-02-20 20:12:36,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {62#true} [183] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {62#true} is VALID [2022-02-20 20:12:36,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {62#true} [184] L-1-2-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {62#true} is VALID [2022-02-20 20:12:36,586 INFO L290 TraceCheckUtils]: 4: Hoare triple {62#true} [172] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {62#true} is VALID [2022-02-20 20:12:36,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {62#true} [158] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {62#true} is VALID [2022-02-20 20:12:36,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {62#true} [157] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {62#true} is VALID [2022-02-20 20:12:36,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {62#true} [175] L12-3-->L12-4: Formula: (and (= 18 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {62#true} is VALID [2022-02-20 20:12:36,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {62#true} [169] L12-4-->L701: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] {62#true} is VALID [2022-02-20 20:12:36,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {62#true} [180] L701-->L-1-3: Formula: (= v_~l~0_4 0) InVars {} OutVars{~l~0=v_~l~0_4} AuxVars[] AssignedVars[~l~0] {64#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {64#(= ~l~0 0)} [186] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {64#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {64#(= ~l~0 0)} [166] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {64#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {64#(= ~l~0 0)} [171] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {64#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {64#(= ~l~0 0)} [165] L-1-6-->L717: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t~0#1.base] {64#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {64#(= ~l~0 0)} [176] L717-->L718-7: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {64#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {64#(= ~l~0 0)} [179] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {64#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {64#(= ~l~0 0)} [189] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {64#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {64#(= ~l~0 0)} [185] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {64#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {64#(= ~l~0 0)} [162] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {64#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {64#(= ~l~0 0)} [215] L718-4-->thr1ENTRY: Formula: (and (= |v_thr1Thread1of3ForFork0_#in~arg.offset_4| 0) (= v_thr1Thread1of3ForFork0_thidvar1_2 0) (= |v_thr1Thread1of3ForFork0_#in~arg.base_4| 0) (= v_thr1Thread1of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre4#1_12|)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_12|} OutVars{thr1Thread1of3ForFork0_#in~arg.base=|v_thr1Thread1of3ForFork0_#in~arg.base_4|, thr1Thread1of3ForFork0_#res.base=|v_thr1Thread1of3ForFork0_#res.base_4|, thr1Thread1of3ForFork0_~arg.offset=v_thr1Thread1of3ForFork0_~arg.offset_4, thr1Thread1of3ForFork0_#in~arg.offset=|v_thr1Thread1of3ForFork0_#in~arg.offset_4|, thr1Thread1of3ForFork0_#res.offset=|v_thr1Thread1of3ForFork0_#res.offset_4|, thr1Thread1of3ForFork0_~arg.base=v_thr1Thread1of3ForFork0_~arg.base_4, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_12|, thr1Thread1of3ForFork0_thidvar1=v_thr1Thread1of3ForFork0_thidvar1_2, thr1Thread1of3ForFork0_thidvar0=v_thr1Thread1of3ForFork0_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_#in~arg.base, thr1Thread1of3ForFork0_#res.base, thr1Thread1of3ForFork0_~arg.offset, thr1Thread1of3ForFork0_#in~arg.offset, thr1Thread1of3ForFork0_#res.offset, thr1Thread1of3ForFork0_~arg.base, thr1Thread1of3ForFork0_thidvar1, thr1Thread1of3ForFork0_thidvar0] {64#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {64#(= ~l~0 0)} [200] thr1ENTRY-->L704: Formula: (and (= v_thr1Thread1of3ForFork0_~arg.base_1 |v_thr1Thread1of3ForFork0_#in~arg.base_1|) (= |v_thr1Thread1of3ForFork0_#in~arg.offset_1| v_thr1Thread1of3ForFork0_~arg.offset_1)) InVars {thr1Thread1of3ForFork0_#in~arg.base=|v_thr1Thread1of3ForFork0_#in~arg.base_1|, thr1Thread1of3ForFork0_#in~arg.offset=|v_thr1Thread1of3ForFork0_#in~arg.offset_1|} OutVars{thr1Thread1of3ForFork0_#in~arg.base=|v_thr1Thread1of3ForFork0_#in~arg.base_1|, thr1Thread1of3ForFork0_~arg.offset=v_thr1Thread1of3ForFork0_~arg.offset_1, thr1Thread1of3ForFork0_~arg.base=v_thr1Thread1of3ForFork0_~arg.base_1, thr1Thread1of3ForFork0_#in~arg.offset=|v_thr1Thread1of3ForFork0_#in~arg.offset_1|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_~arg.offset, thr1Thread1of3ForFork0_~arg.base] {64#(= ~l~0 0)} is VALID [2022-02-20 20:12:36,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {64#(= ~l~0 0)} [201] L704-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= (mod v_~l~0_5 256) 0)) (= (mod v_~s~0_5 256) 0)) InVars {~l~0=v_~l~0_5, ~s~0=v_~s~0_5} OutVars{~l~0=v_~l~0_5, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[] {63#false} is VALID [2022-02-20 20:12:36,593 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:36,593 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:12:36,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740341644] [2022-02-20 20:12:36,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740341644] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:12:36,593 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:12:36,593 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:12:36,593 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872345115] [2022-02-20 20:12:36,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:12:36,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2022-02-20 20:12:36,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:12:36,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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:36,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:12:36,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:12:36,609 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:12:36,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:12:36,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:12:36,610 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 53 [2022-02-20 20:12:36,610 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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:36,610 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:12:36,611 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 53 [2022-02-20 20:12:36,611 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:12:36,680 INFO L129 PetriNetUnfolder]: 59/242 cut-off events. [2022-02-20 20:12:36,680 INFO L130 PetriNetUnfolder]: For 91/91 co-relation queries the response was YES. [2022-02-20 20:12:36,681 INFO L84 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 242 events. 59/242 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1125 event pairs, 23 based on Foata normal form. 60/274 useless extension candidates. Maximal degree in co-relation 108. Up to 95 conditions per place. [2022-02-20 20:12:36,682 INFO L132 encePairwiseOnDemand]: 44/53 looper letters, 17 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2022-02-20 20:12:36,682 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 54 transitions, 183 flow [2022-02-20 20:12:36,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:12:36,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:12:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2022-02-20 20:12:36,687 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8930817610062893 [2022-02-20 20:12:36,687 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 142 transitions. [2022-02-20 20:12:36,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 142 transitions. [2022-02-20 20:12:36,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:12:36,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 142 transitions. [2022-02-20 20:12:36,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 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:36,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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:36,690 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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:36,690 INFO L186 Difference]: Start difference. First operand has 59 places, 53 transitions, 127 flow. Second operand 3 states and 142 transitions. [2022-02-20 20:12:36,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 54 transitions, 183 flow [2022-02-20 20:12:36,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 175 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-02-20 20:12:36,694 INFO L242 Difference]: Finished difference. Result has 56 places, 49 transitions, 137 flow [2022-02-20 20:12:36,694 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2022-02-20 20:12:36,696 INFO L334 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2022-02-20 20:12:36,697 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 49 transitions, 137 flow [2022-02-20 20:12:36,789 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4062 states, 4055 states have (on average 3.3536374845869297) internal successors, (13599), 4061 states have internal predecessors, (13599), 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:36,803 INFO L78 Accepts]: Start accepts. Automaton has has 4062 states, 4055 states have (on average 3.3536374845869297) internal successors, (13599), 4061 states have internal predecessors, (13599), 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 22 [2022-02-20 20:12:36,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:12:36,803 INFO L470 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 137 flow [2022-02-20 20:12:36,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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:36,804 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:36,804 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] [2022-02-20 20:12:36,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:12:36,804 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:36,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:36,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1152270226, now seen corresponding path program 1 times [2022-02-20 20:12:36,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:36,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702130867] [2022-02-20 20:12:36,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:36,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:12:36,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {4130#true} [173] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4130#true} is VALID [2022-02-20 20:12:36,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {4130#true} [161] 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] {4130#true} is VALID [2022-02-20 20:12:36,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {4130#true} [183] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {4130#true} is VALID [2022-02-20 20:12:36,846 INFO L290 TraceCheckUtils]: 3: Hoare triple {4130#true} [184] L-1-2-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {4130#true} is VALID [2022-02-20 20:12:36,846 INFO L290 TraceCheckUtils]: 4: Hoare triple {4130#true} [172] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {4130#true} is VALID [2022-02-20 20:12:36,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {4130#true} [158] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {4130#true} is VALID [2022-02-20 20:12:36,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {4130#true} [157] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {4130#true} is VALID [2022-02-20 20:12:36,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {4130#true} [175] L12-3-->L12-4: Formula: (and (= 18 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {4130#true} is VALID [2022-02-20 20:12:36,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {4130#true} [169] L12-4-->L701: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] {4130#true} is VALID [2022-02-20 20:12:36,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {4130#true} [180] L701-->L-1-3: Formula: (= v_~l~0_4 0) InVars {} OutVars{~l~0=v_~l~0_4} AuxVars[] AssignedVars[~l~0] {4130#true} is VALID [2022-02-20 20:12:36,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {4130#true} [186] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4130#true} is VALID [2022-02-20 20:12:36,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {4130#true} [166] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4130#true} is VALID [2022-02-20 20:12:36,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {4130#true} [171] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {4130#true} is VALID [2022-02-20 20:12:36,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {4130#true} [165] L-1-6-->L717: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t~0#1.base] {4130#true} is VALID [2022-02-20 20:12:36,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {4130#true} [176] L717-->L718-7: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {4130#true} is VALID [2022-02-20 20:12:36,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {4130#true} [179] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4130#true} is VALID [2022-02-20 20:12:36,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {4130#true} [189] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {4130#true} is VALID [2022-02-20 20:12:36,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {4130#true} [185] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {4130#true} is VALID [2022-02-20 20:12:36,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {4130#true} [162] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {4130#true} is VALID [2022-02-20 20:12:36,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {4130#true} [215] L718-4-->thr1ENTRY: Formula: (and (= |v_thr1Thread1of3ForFork0_#in~arg.offset_4| 0) (= v_thr1Thread1of3ForFork0_thidvar1_2 0) (= |v_thr1Thread1of3ForFork0_#in~arg.base_4| 0) (= v_thr1Thread1of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre4#1_12|)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_12|} OutVars{thr1Thread1of3ForFork0_#in~arg.base=|v_thr1Thread1of3ForFork0_#in~arg.base_4|, thr1Thread1of3ForFork0_#res.base=|v_thr1Thread1of3ForFork0_#res.base_4|, thr1Thread1of3ForFork0_~arg.offset=v_thr1Thread1of3ForFork0_~arg.offset_4, thr1Thread1of3ForFork0_#in~arg.offset=|v_thr1Thread1of3ForFork0_#in~arg.offset_4|, thr1Thread1of3ForFork0_#res.offset=|v_thr1Thread1of3ForFork0_#res.offset_4|, thr1Thread1of3ForFork0_~arg.base=v_thr1Thread1of3ForFork0_~arg.base_4, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_12|, thr1Thread1of3ForFork0_thidvar1=v_thr1Thread1of3ForFork0_thidvar1_2, thr1Thread1of3ForFork0_thidvar0=v_thr1Thread1of3ForFork0_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_#in~arg.base, thr1Thread1of3ForFork0_#res.base, thr1Thread1of3ForFork0_~arg.offset, thr1Thread1of3ForFork0_#in~arg.offset, thr1Thread1of3ForFork0_#res.offset, thr1Thread1of3ForFork0_~arg.base, thr1Thread1of3ForFork0_thidvar1, thr1Thread1of3ForFork0_thidvar0] {4130#true} is VALID [2022-02-20 20:12:36,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {4130#true} [190] L718-5-->L718-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {4130#true} is VALID [2022-02-20 20:12:36,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {4130#true} [182] L718-6-->L718-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {4130#true} is VALID [2022-02-20 20:12:36,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {4130#true} [179] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4130#true} is VALID [2022-02-20 20:12:36,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {4130#true} [189] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {4130#true} is VALID [2022-02-20 20:12:36,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {4130#true} [185] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {4130#true} is VALID [2022-02-20 20:12:36,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {4130#true} [162] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {4130#true} is VALID [2022-02-20 20:12:36,850 INFO L290 TraceCheckUtils]: 26: Hoare triple {4130#true} [216] L718-4-->thr1ENTRY: Formula: (and (= |v_thr1Thread2of3ForFork0_#in~arg.offset_4| 0) (= v_thr1Thread2of3ForFork0_thidvar1_2 0) (= |v_thr1Thread2of3ForFork0_#in~arg.base_4| 0) (= v_thr1Thread2of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre4#1_14|)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_14|} OutVars{thr1Thread2of3ForFork0_#res.base=|v_thr1Thread2of3ForFork0_#res.base_4|, thr1Thread2of3ForFork0_#in~arg.offset=|v_thr1Thread2of3ForFork0_#in~arg.offset_4|, thr1Thread2of3ForFork0_thidvar1=v_thr1Thread2of3ForFork0_thidvar1_2, thr1Thread2of3ForFork0_~arg.base=v_thr1Thread2of3ForFork0_~arg.base_4, thr1Thread2of3ForFork0_~arg.offset=v_thr1Thread2of3ForFork0_~arg.offset_4, thr1Thread2of3ForFork0_#res.offset=|v_thr1Thread2of3ForFork0_#res.offset_4|, thr1Thread2of3ForFork0_thidvar0=v_thr1Thread2of3ForFork0_thidvar0_2, thr1Thread2of3ForFork0_#in~arg.base=|v_thr1Thread2of3ForFork0_#in~arg.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_14|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_#res.base, thr1Thread2of3ForFork0_#in~arg.offset, thr1Thread2of3ForFork0_thidvar1, thr1Thread2of3ForFork0_~arg.base, thr1Thread2of3ForFork0_~arg.offset, thr1Thread2of3ForFork0_#res.offset, thr1Thread2of3ForFork0_thidvar0, thr1Thread2of3ForFork0_#in~arg.base] {4130#true} is VALID [2022-02-20 20:12:36,850 INFO L290 TraceCheckUtils]: 27: Hoare triple {4130#true} [200] thr1ENTRY-->L704: Formula: (and (= v_thr1Thread1of3ForFork0_~arg.base_1 |v_thr1Thread1of3ForFork0_#in~arg.base_1|) (= |v_thr1Thread1of3ForFork0_#in~arg.offset_1| v_thr1Thread1of3ForFork0_~arg.offset_1)) InVars {thr1Thread1of3ForFork0_#in~arg.base=|v_thr1Thread1of3ForFork0_#in~arg.base_1|, thr1Thread1of3ForFork0_#in~arg.offset=|v_thr1Thread1of3ForFork0_#in~arg.offset_1|} OutVars{thr1Thread1of3ForFork0_#in~arg.base=|v_thr1Thread1of3ForFork0_#in~arg.base_1|, thr1Thread1of3ForFork0_~arg.offset=v_thr1Thread1of3ForFork0_~arg.offset_1, thr1Thread1of3ForFork0_~arg.base=v_thr1Thread1of3ForFork0_~arg.base_1, thr1Thread1of3ForFork0_#in~arg.offset=|v_thr1Thread1of3ForFork0_#in~arg.offset_1|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_~arg.offset, thr1Thread1of3ForFork0_~arg.base] {4130#true} is VALID [2022-02-20 20:12:36,850 INFO L290 TraceCheckUtils]: 28: Hoare triple {4130#true} [202] L704-->L705-3: Formula: (or (not (= (mod v_~s~0_In_1 256) 0)) (= (mod v_~l~0_In_1 256) 0)) InVars {~l~0=v_~l~0_In_1, ~s~0=v_~s~0_In_1} OutVars{~l~0=v_~l~0_In_1, ~s~0=v_~s~0_In_1} AuxVars[] AssignedVars[] {4130#true} is VALID [2022-02-20 20:12:36,851 INFO L290 TraceCheckUtils]: 29: Hoare triple {4130#true} [203] L705-3-->L709: Formula: (= v_~s~0_3 1) InVars {} OutVars{~s~0=v_~s~0_3} AuxVars[] AssignedVars[~s~0] {4132#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:36,851 INFO L290 TraceCheckUtils]: 30: Hoare triple {4132#(= (+ (- 1) ~s~0) 0)} [204] L709-->L712: Formula: (= v_~l~0_3 1) InVars {} OutVars{~l~0=v_~l~0_3} AuxVars[] AssignedVars[~l~0] {4132#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:36,852 INFO L290 TraceCheckUtils]: 31: Hoare triple {4132#(= (+ (- 1) ~s~0) 0)} [207] thr1ENTRY-->L704: Formula: (and (= |v_thr1Thread2of3ForFork0_#in~arg.offset_1| v_thr1Thread2of3ForFork0_~arg.offset_1) (= v_thr1Thread2of3ForFork0_~arg.base_1 |v_thr1Thread2of3ForFork0_#in~arg.base_1|)) InVars {thr1Thread2of3ForFork0_#in~arg.base=|v_thr1Thread2of3ForFork0_#in~arg.base_1|, thr1Thread2of3ForFork0_#in~arg.offset=|v_thr1Thread2of3ForFork0_#in~arg.offset_1|} OutVars{thr1Thread2of3ForFork0_~arg.base=v_thr1Thread2of3ForFork0_~arg.base_1, thr1Thread2of3ForFork0_~arg.offset=v_thr1Thread2of3ForFork0_~arg.offset_1, thr1Thread2of3ForFork0_#in~arg.base=|v_thr1Thread2of3ForFork0_#in~arg.base_1|, thr1Thread2of3ForFork0_#in~arg.offset=|v_thr1Thread2of3ForFork0_#in~arg.offset_1|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_~arg.base, thr1Thread2of3ForFork0_~arg.offset] {4132#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:36,852 INFO L290 TraceCheckUtils]: 32: Hoare triple {4132#(= (+ (- 1) ~s~0) 0)} [208] L704-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= (mod v_~l~0_5 256) 0)) (= (mod v_~s~0_5 256) 0)) InVars {~l~0=v_~l~0_5, ~s~0=v_~s~0_5} OutVars{~l~0=v_~l~0_5, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[] {4131#false} is VALID [2022-02-20 20:12:36,852 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:36,853 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:12:36,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702130867] [2022-02-20 20:12:36,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702130867] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:12:36,853 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:12:36,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:12:36,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020951639] [2022-02-20 20:12:36,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:12:36,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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 33 [2022-02-20 20:12:36,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:12:36,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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:36,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:12:36,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:12:36,879 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:12:36,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:12:36,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:12:36,879 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 53 [2022-02-20 20:12:36,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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:36,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:12:36,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 53 [2022-02-20 20:12:36,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:12:36,928 INFO L129 PetriNetUnfolder]: 53/238 cut-off events. [2022-02-20 20:12:36,928 INFO L130 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-02-20 20:12:36,929 INFO L84 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 238 events. 53/238 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1069 event pairs, 12 based on Foata normal form. 23/253 useless extension candidates. Maximal degree in co-relation 376. Up to 57 conditions per place. [2022-02-20 20:12:36,930 INFO L132 encePairwiseOnDemand]: 47/53 looper letters, 15 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2022-02-20 20:12:36,930 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 54 transitions, 187 flow [2022-02-20 20:12:36,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:12:36,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:12:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2022-02-20 20:12:36,931 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8490566037735849 [2022-02-20 20:12:36,931 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 135 transitions. [2022-02-20 20:12:36,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 135 transitions. [2022-02-20 20:12:36,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:12:36,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 135 transitions. [2022-02-20 20:12:36,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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:36,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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:36,933 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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:36,933 INFO L186 Difference]: Start difference. First operand has 56 places, 49 transitions, 137 flow. Second operand 3 states and 135 transitions. [2022-02-20 20:12:36,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 54 transitions, 187 flow [2022-02-20 20:12:36,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 183 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:12:36,937 INFO L242 Difference]: Finished difference. Result has 55 places, 49 transitions, 142 flow [2022-02-20 20:12:36,937 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2022-02-20 20:12:36,937 INFO L334 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2022-02-20 20:12:36,937 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 49 transitions, 142 flow [2022-02-20 20:12:37,001 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3156 states, 3155 states have (on average 3.3277337559429476) internal successors, (10499), 3155 states have internal predecessors, (10499), 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,009 INFO L78 Accepts]: Start accepts. Automaton has has 3156 states, 3155 states have (on average 3.3277337559429476) internal successors, (10499), 3155 states have internal predecessors, (10499), 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 33 [2022-02-20 20:12:37,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:12:37,010 INFO L470 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 142 flow [2022-02-20 20:12:37,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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,010 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:37,010 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 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,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:12:37,010 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 20:12:37,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:37,011 INFO L85 PathProgramCache]: Analyzing trace with hash 620408523, now seen corresponding path program 1 times [2022-02-20 20:12:37,011 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:37,011 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869538684] [2022-02-20 20:12:37,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:37,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:12:37,023 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:12:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:12:37,034 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:12:37,034 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:12:37,034 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 5 remaining) [2022-02-20 20:12:37,034 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-02-20 20:12:37,035 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-02-20 20:12:37,035 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-02-20 20:12:37,035 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-02-20 20:12:37,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:12:37,035 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 20:12:37,035 WARN L235 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-02-20 20:12:37,035 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-02-20 20:12:37,045 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,045 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,045 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,045 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,045 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,045 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,045 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,045 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,046 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,046 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,046 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,046 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,046 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,046 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,046 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,046 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,046 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,046 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,046 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,046 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,047 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,047 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,047 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,047 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,047 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,047 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,047 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,047 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,047 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,047 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,048 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,048 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,055 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,056 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,056 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,056 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,056 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,056 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,056 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,056 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,056 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,056 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,056 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,056 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,057 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,057 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,057 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,057 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,057 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,057 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,057 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,058 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,058 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,058 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,058 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,058 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,058 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,059 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,059 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,059 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,059 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,059 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,059 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,059 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:37,059 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:12:37,060 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:12:37,061 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:37,061 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-20 20:12:37,062 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 61 transitions, 154 flow [2022-02-20 20:12:37,068 INFO L129 PetriNetUnfolder]: 5/111 cut-off events. [2022-02-20 20:12:37,068 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-02-20 20:12:37,068 INFO L84 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 111 events. 5/111 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 154 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 98. Up to 10 conditions per place. [2022-02-20 20:12:37,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 61 transitions, 154 flow [2022-02-20 20:12:37,069 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 61 transitions, 154 flow [2022-02-20 20:12:37,070 INFO L129 PetriNetUnfolder]: 1/30 cut-off events. [2022-02-20 20:12:37,070 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:12:37,070 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:37,070 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] [2022-02-20 20:12:37,071 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-20 20:12:37,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:37,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1251690471, now seen corresponding path program 1 times [2022-02-20 20:12:37,073 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:37,073 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891682762] [2022-02-20 20:12:37,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:37,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:12:37,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {72#true} [234] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {72#true} is VALID [2022-02-20 20:12:37,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {72#true} [222] 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] {72#true} is VALID [2022-02-20 20:12:37,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {72#true} [244] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {72#true} is VALID [2022-02-20 20:12:37,124 INFO L290 TraceCheckUtils]: 3: Hoare triple {72#true} [245] L-1-2-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {72#true} is VALID [2022-02-20 20:12:37,124 INFO L290 TraceCheckUtils]: 4: Hoare triple {72#true} [233] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {72#true} is VALID [2022-02-20 20:12:37,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {72#true} [219] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {72#true} is VALID [2022-02-20 20:12:37,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {72#true} [218] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {72#true} is VALID [2022-02-20 20:12:37,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {72#true} [236] L12-3-->L12-4: Formula: (and (= 18 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {72#true} is VALID [2022-02-20 20:12:37,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {72#true} [230] L12-4-->L701: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] {72#true} is VALID [2022-02-20 20:12:37,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {72#true} [241] L701-->L-1-3: Formula: (= v_~l~0_4 0) InVars {} OutVars{~l~0=v_~l~0_4} AuxVars[] AssignedVars[~l~0] {74#(= ~l~0 0)} is VALID [2022-02-20 20:12:37,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {74#(= ~l~0 0)} [247] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {74#(= ~l~0 0)} is VALID [2022-02-20 20:12:37,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {74#(= ~l~0 0)} [227] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {74#(= ~l~0 0)} is VALID [2022-02-20 20:12:37,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {74#(= ~l~0 0)} [232] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {74#(= ~l~0 0)} is VALID [2022-02-20 20:12:37,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {74#(= ~l~0 0)} [226] L-1-6-->L717: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t~0#1.base] {74#(= ~l~0 0)} is VALID [2022-02-20 20:12:37,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {74#(= ~l~0 0)} [237] L717-->L718-7: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {74#(= ~l~0 0)} is VALID [2022-02-20 20:12:37,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {74#(= ~l~0 0)} [240] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {74#(= ~l~0 0)} is VALID [2022-02-20 20:12:37,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {74#(= ~l~0 0)} [250] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {74#(= ~l~0 0)} is VALID [2022-02-20 20:12:37,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {74#(= ~l~0 0)} [246] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {74#(= ~l~0 0)} is VALID [2022-02-20 20:12:37,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {74#(= ~l~0 0)} [223] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {74#(= ~l~0 0)} is VALID [2022-02-20 20:12:37,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {74#(= ~l~0 0)} [283] L718-4-->thr1ENTRY: Formula: (and (= v_thr1Thread1of4ForFork0_thidvar1_2 0) (= |v_thr1Thread1of4ForFork0_#in~arg.base_4| 0) (= |v_thr1Thread1of4ForFork0_#in~arg.offset_4| 0) (= v_thr1Thread1of4ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre4#1_18|)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_18|} OutVars{thr1Thread1of4ForFork0_thidvar1=v_thr1Thread1of4ForFork0_thidvar1_2, thr1Thread1of4ForFork0_~arg.offset=v_thr1Thread1of4ForFork0_~arg.offset_4, thr1Thread1of4ForFork0_#res.offset=|v_thr1Thread1of4ForFork0_#res.offset_4|, thr1Thread1of4ForFork0_~arg.base=v_thr1Thread1of4ForFork0_~arg.base_4, thr1Thread1of4ForFork0_#res.base=|v_thr1Thread1of4ForFork0_#res.base_4|, thr1Thread1of4ForFork0_thidvar0=v_thr1Thread1of4ForFork0_thidvar0_2, thr1Thread1of4ForFork0_#in~arg.base=|v_thr1Thread1of4ForFork0_#in~arg.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_18|, thr1Thread1of4ForFork0_#in~arg.offset=|v_thr1Thread1of4ForFork0_#in~arg.offset_4|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_thidvar1, thr1Thread1of4ForFork0_~arg.offset, thr1Thread1of4ForFork0_#res.offset, thr1Thread1of4ForFork0_~arg.base, thr1Thread1of4ForFork0_#res.base, thr1Thread1of4ForFork0_thidvar0, thr1Thread1of4ForFork0_#in~arg.base, thr1Thread1of4ForFork0_#in~arg.offset] {74#(= ~l~0 0)} is VALID [2022-02-20 20:12:37,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {74#(= ~l~0 0)} [268] thr1ENTRY-->L704: Formula: (and (= v_thr1Thread1of4ForFork0_~arg.base_1 |v_thr1Thread1of4ForFork0_#in~arg.base_1|) (= |v_thr1Thread1of4ForFork0_#in~arg.offset_1| v_thr1Thread1of4ForFork0_~arg.offset_1)) InVars {thr1Thread1of4ForFork0_#in~arg.offset=|v_thr1Thread1of4ForFork0_#in~arg.offset_1|, thr1Thread1of4ForFork0_#in~arg.base=|v_thr1Thread1of4ForFork0_#in~arg.base_1|} OutVars{thr1Thread1of4ForFork0_~arg.base=v_thr1Thread1of4ForFork0_~arg.base_1, thr1Thread1of4ForFork0_#in~arg.base=|v_thr1Thread1of4ForFork0_#in~arg.base_1|, thr1Thread1of4ForFork0_#in~arg.offset=|v_thr1Thread1of4ForFork0_#in~arg.offset_1|, thr1Thread1of4ForFork0_~arg.offset=v_thr1Thread1of4ForFork0_~arg.offset_1} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_~arg.offset, thr1Thread1of4ForFork0_~arg.base] {74#(= ~l~0 0)} is VALID [2022-02-20 20:12:37,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {74#(= ~l~0 0)} [269] L704-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= (mod v_~l~0_5 256) 0)) (= (mod v_~s~0_5 256) 0)) InVars {~l~0=v_~l~0_5, ~s~0=v_~s~0_5} OutVars{~l~0=v_~l~0_5, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[] {73#false} is VALID [2022-02-20 20:12:37,132 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:37,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:12:37,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891682762] [2022-02-20 20:12:37,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891682762] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:12:37,132 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:12:37,132 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:12:37,132 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182431624] [2022-02-20 20:12:37,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:12:37,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2022-02-20 20:12:37,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:12:37,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:12:37,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:12:37,150 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:12:37,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:12:37,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:12:37,152 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 61 [2022-02-20 20:12:37,152 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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,152 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:12:37,152 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 61 [2022-02-20 20:12:37,152 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:12:37,346 INFO L129 PetriNetUnfolder]: 421/1000 cut-off events. [2022-02-20 20:12:37,347 INFO L130 PetriNetUnfolder]: For 574/574 co-relation queries the response was YES. [2022-02-20 20:12:37,349 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1990 conditions, 1000 events. 421/1000 cut-off events. For 574/574 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6350 event pairs, 231 based on Foata normal form. 243/1040 useless extension candidates. Maximal degree in co-relation 596. Up to 608 conditions per place. [2022-02-20 20:12:37,355 INFO L132 encePairwiseOnDemand]: 50/61 looper letters, 23 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2022-02-20 20:12:37,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 239 flow [2022-02-20 20:12:37,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:12:37,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:12:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2022-02-20 20:12:37,357 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8852459016393442 [2022-02-20 20:12:37,357 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 162 transitions. [2022-02-20 20:12:37,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 162 transitions. [2022-02-20 20:12:37,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:12:37,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 162 transitions. [2022-02-20 20:12:37,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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,359 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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,359 INFO L186 Difference]: Start difference. First operand has 69 places, 61 transitions, 154 flow. Second operand 3 states and 162 transitions. [2022-02-20 20:12:37,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 239 flow [2022-02-20 20:12:37,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 65 transitions, 221 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-02-20 20:12:37,367 INFO L242 Difference]: Finished difference. Result has 66 places, 58 transitions, 167 flow [2022-02-20 20:12:37,367 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2022-02-20 20:12:37,368 INFO L334 CegarLoopForPetriNet]: 69 programPoint places, -3 predicate places. [2022-02-20 20:12:37,368 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 58 transitions, 167 flow [2022-02-20 20:12:38,248 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 33427 states, 33412 states have (on average 4.232221956183407) internal successors, (141407), 33426 states have internal predecessors, (141407), 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:38,325 INFO L78 Accepts]: Start accepts. Automaton has has 33427 states, 33412 states have (on average 4.232221956183407) internal successors, (141407), 33426 states have internal predecessors, (141407), 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 22 [2022-02-20 20:12:38,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:12:38,325 INFO L470 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 167 flow [2022-02-20 20:12:38,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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:38,326 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:38,326 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] [2022-02-20 20:12:38,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:12:38,326 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-20 20:12:38,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:38,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1254058345, now seen corresponding path program 1 times [2022-02-20 20:12:38,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:38,328 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371825494] [2022-02-20 20:12:38,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:38,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:12:38,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {33505#true} [234] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33505#true} is VALID [2022-02-20 20:12:38,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {33505#true} [222] 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] {33505#true} is VALID [2022-02-20 20:12:38,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {33505#true} [244] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {33505#true} is VALID [2022-02-20 20:12:38,382 INFO L290 TraceCheckUtils]: 3: Hoare triple {33505#true} [245] L-1-2-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {33505#true} is VALID [2022-02-20 20:12:38,382 INFO L290 TraceCheckUtils]: 4: Hoare triple {33505#true} [233] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {33505#true} is VALID [2022-02-20 20:12:38,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {33505#true} [219] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {33505#true} is VALID [2022-02-20 20:12:38,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {33505#true} [218] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {33505#true} is VALID [2022-02-20 20:12:38,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {33505#true} [236] L12-3-->L12-4: Formula: (and (= 18 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {33505#true} is VALID [2022-02-20 20:12:38,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {33505#true} [230] L12-4-->L701: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] {33505#true} is VALID [2022-02-20 20:12:38,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {33505#true} [241] L701-->L-1-3: Formula: (= v_~l~0_4 0) InVars {} OutVars{~l~0=v_~l~0_4} AuxVars[] AssignedVars[~l~0] {33505#true} is VALID [2022-02-20 20:12:38,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {33505#true} [247] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33505#true} is VALID [2022-02-20 20:12:38,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {33505#true} [227] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33505#true} is VALID [2022-02-20 20:12:38,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {33505#true} [232] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {33505#true} is VALID [2022-02-20 20:12:38,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {33505#true} [226] L-1-6-->L717: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t~0#1.base] {33505#true} is VALID [2022-02-20 20:12:38,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {33505#true} [237] L717-->L718-7: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {33505#true} is VALID [2022-02-20 20:12:38,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {33505#true} [240] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33505#true} is VALID [2022-02-20 20:12:38,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {33505#true} [250] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {33505#true} is VALID [2022-02-20 20:12:38,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {33505#true} [246] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {33505#true} is VALID [2022-02-20 20:12:38,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {33505#true} [223] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {33505#true} is VALID [2022-02-20 20:12:38,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {33505#true} [283] L718-4-->thr1ENTRY: Formula: (and (= v_thr1Thread1of4ForFork0_thidvar1_2 0) (= |v_thr1Thread1of4ForFork0_#in~arg.base_4| 0) (= |v_thr1Thread1of4ForFork0_#in~arg.offset_4| 0) (= v_thr1Thread1of4ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre4#1_18|)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_18|} OutVars{thr1Thread1of4ForFork0_thidvar1=v_thr1Thread1of4ForFork0_thidvar1_2, thr1Thread1of4ForFork0_~arg.offset=v_thr1Thread1of4ForFork0_~arg.offset_4, thr1Thread1of4ForFork0_#res.offset=|v_thr1Thread1of4ForFork0_#res.offset_4|, thr1Thread1of4ForFork0_~arg.base=v_thr1Thread1of4ForFork0_~arg.base_4, thr1Thread1of4ForFork0_#res.base=|v_thr1Thread1of4ForFork0_#res.base_4|, thr1Thread1of4ForFork0_thidvar0=v_thr1Thread1of4ForFork0_thidvar0_2, thr1Thread1of4ForFork0_#in~arg.base=|v_thr1Thread1of4ForFork0_#in~arg.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_18|, thr1Thread1of4ForFork0_#in~arg.offset=|v_thr1Thread1of4ForFork0_#in~arg.offset_4|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_thidvar1, thr1Thread1of4ForFork0_~arg.offset, thr1Thread1of4ForFork0_#res.offset, thr1Thread1of4ForFork0_~arg.base, thr1Thread1of4ForFork0_#res.base, thr1Thread1of4ForFork0_thidvar0, thr1Thread1of4ForFork0_#in~arg.base, thr1Thread1of4ForFork0_#in~arg.offset] {33505#true} is VALID [2022-02-20 20:12:38,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {33505#true} [268] thr1ENTRY-->L704: Formula: (and (= v_thr1Thread1of4ForFork0_~arg.base_1 |v_thr1Thread1of4ForFork0_#in~arg.base_1|) (= |v_thr1Thread1of4ForFork0_#in~arg.offset_1| v_thr1Thread1of4ForFork0_~arg.offset_1)) InVars {thr1Thread1of4ForFork0_#in~arg.offset=|v_thr1Thread1of4ForFork0_#in~arg.offset_1|, thr1Thread1of4ForFork0_#in~arg.base=|v_thr1Thread1of4ForFork0_#in~arg.base_1|} OutVars{thr1Thread1of4ForFork0_~arg.base=v_thr1Thread1of4ForFork0_~arg.base_1, thr1Thread1of4ForFork0_#in~arg.base=|v_thr1Thread1of4ForFork0_#in~arg.base_1|, thr1Thread1of4ForFork0_#in~arg.offset=|v_thr1Thread1of4ForFork0_#in~arg.offset_1|, thr1Thread1of4ForFork0_~arg.offset=v_thr1Thread1of4ForFork0_~arg.offset_1} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_~arg.offset, thr1Thread1of4ForFork0_~arg.base] {33505#true} is VALID [2022-02-20 20:12:38,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {33505#true} [270] L704-->L705-3: Formula: (or (not (= (mod v_~s~0_In_1 256) 0)) (= (mod v_~l~0_In_1 256) 0)) InVars {~l~0=v_~l~0_In_1, ~s~0=v_~s~0_In_1} OutVars{~l~0=v_~l~0_In_1, ~s~0=v_~s~0_In_1} AuxVars[] AssignedVars[] {33505#true} is VALID [2022-02-20 20:12:38,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {33505#true} [271] L705-3-->L709: Formula: (= v_~s~0_3 1) InVars {} OutVars{~s~0=v_~s~0_3} AuxVars[] AssignedVars[~s~0] {33507#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:38,394 INFO L290 TraceCheckUtils]: 23: Hoare triple {33507#(= (+ (- 1) ~s~0) 0)} [272] L709-->L712: Formula: (= v_~l~0_3 1) InVars {} OutVars{~l~0=v_~l~0_3} AuxVars[] AssignedVars[~l~0] {33507#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:38,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {33507#(= (+ (- 1) ~s~0) 0)} [251] L718-5-->L718-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {33507#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:38,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {33507#(= (+ (- 1) ~s~0) 0)} [243] L718-6-->L718-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {33507#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:38,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {33507#(= (+ (- 1) ~s~0) 0)} [240] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33507#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:38,397 INFO L290 TraceCheckUtils]: 27: Hoare triple {33507#(= (+ (- 1) ~s~0) 0)} [250] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {33507#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:38,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {33507#(= (+ (- 1) ~s~0) 0)} [246] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {33507#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:38,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {33507#(= (+ (- 1) ~s~0) 0)} [223] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {33507#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:38,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {33507#(= (+ (- 1) ~s~0) 0)} [284] L718-4-->thr1ENTRY: Formula: (and (= v_thr1Thread2of4ForFork0_thidvar1_2 0) (= |v_thr1Thread2of4ForFork0_#in~arg.offset_4| 0) (= v_thr1Thread2of4ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre4#1_20|) (= |v_thr1Thread2of4ForFork0_#in~arg.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_20|} OutVars{thr1Thread2of4ForFork0_~arg.base=v_thr1Thread2of4ForFork0_~arg.base_4, thr1Thread2of4ForFork0_~arg.offset=v_thr1Thread2of4ForFork0_~arg.offset_4, thr1Thread2of4ForFork0_#res.base=|v_thr1Thread2of4ForFork0_#res.base_4|, thr1Thread2of4ForFork0_#in~arg.base=|v_thr1Thread2of4ForFork0_#in~arg.base_4|, thr1Thread2of4ForFork0_#res.offset=|v_thr1Thread2of4ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_20|, thr1Thread2of4ForFork0_thidvar1=v_thr1Thread2of4ForFork0_thidvar1_2, thr1Thread2of4ForFork0_#in~arg.offset=|v_thr1Thread2of4ForFork0_#in~arg.offset_4|, thr1Thread2of4ForFork0_thidvar0=v_thr1Thread2of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_~arg.base, thr1Thread2of4ForFork0_~arg.offset, thr1Thread2of4ForFork0_#res.base, thr1Thread2of4ForFork0_#in~arg.base, thr1Thread2of4ForFork0_#res.offset, thr1Thread2of4ForFork0_thidvar1, thr1Thread2of4ForFork0_#in~arg.offset, thr1Thread2of4ForFork0_thidvar0] {33507#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:38,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {33507#(= (+ (- 1) ~s~0) 0)} [275] thr1ENTRY-->L704: Formula: (and (= |v_thr1Thread2of4ForFork0_#in~arg.base_1| v_thr1Thread2of4ForFork0_~arg.base_1) (= v_thr1Thread2of4ForFork0_~arg.offset_1 |v_thr1Thread2of4ForFork0_#in~arg.offset_1|)) InVars {thr1Thread2of4ForFork0_#in~arg.offset=|v_thr1Thread2of4ForFork0_#in~arg.offset_1|, thr1Thread2of4ForFork0_#in~arg.base=|v_thr1Thread2of4ForFork0_#in~arg.base_1|} OutVars{thr1Thread2of4ForFork0_~arg.offset=v_thr1Thread2of4ForFork0_~arg.offset_1, thr1Thread2of4ForFork0_#in~arg.base=|v_thr1Thread2of4ForFork0_#in~arg.base_1|, thr1Thread2of4ForFork0_~arg.base=v_thr1Thread2of4ForFork0_~arg.base_1, thr1Thread2of4ForFork0_#in~arg.offset=|v_thr1Thread2of4ForFork0_#in~arg.offset_1|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_~arg.base, thr1Thread2of4ForFork0_~arg.offset] {33507#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:38,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {33507#(= (+ (- 1) ~s~0) 0)} [276] L704-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= (mod v_~l~0_5 256) 0)) (= (mod v_~s~0_5 256) 0)) InVars {~l~0=v_~l~0_5, ~s~0=v_~s~0_5} OutVars{~l~0=v_~l~0_5, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[] {33506#false} is VALID [2022-02-20 20:12:38,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:12:38,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:12:38,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371825494] [2022-02-20 20:12:38,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371825494] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:12:38,403 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:12:38,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:12:38,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858948198] [2022-02-20 20:12:38,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:12:38,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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 33 [2022-02-20 20:12:38,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:12:38,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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:38,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:12:38,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:12:38,425 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:12:38,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:12:38,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:12:38,426 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 61 [2022-02-20 20:12:38,426 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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:38,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:12:38,426 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 61 [2022-02-20 20:12:38,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:12:38,616 INFO L129 PetriNetUnfolder]: 281/884 cut-off events. [2022-02-20 20:12:38,616 INFO L130 PetriNetUnfolder]: For 290/290 co-relation queries the response was YES. [2022-02-20 20:12:38,619 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1593 conditions, 884 events. 281/884 cut-off events. For 290/290 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5885 event pairs, 102 based on Foata normal form. 161/1004 useless extension candidates. Maximal degree in co-relation 914. Up to 260 conditions per place. [2022-02-20 20:12:38,622 INFO L132 encePairwiseOnDemand]: 53/61 looper letters, 20 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2022-02-20 20:12:38,623 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 65 transitions, 236 flow [2022-02-20 20:12:38,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:12:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:12:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2022-02-20 20:12:38,624 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8415300546448088 [2022-02-20 20:12:38,625 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 154 transitions. [2022-02-20 20:12:38,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 154 transitions. [2022-02-20 20:12:38,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:12:38,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 154 transitions. [2022-02-20 20:12:38,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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:38,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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:38,626 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 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:38,626 INFO L186 Difference]: Start difference. First operand has 66 places, 58 transitions, 167 flow. Second operand 3 states and 154 transitions. [2022-02-20 20:12:38,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 65 transitions, 236 flow [2022-02-20 20:12:38,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 65 transitions, 231 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:12:38,633 INFO L242 Difference]: Finished difference. Result has 64 places, 58 transitions, 174 flow [2022-02-20 20:12:38,633 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2022-02-20 20:12:38,634 INFO L334 CegarLoopForPetriNet]: 69 programPoint places, -5 predicate places. [2022-02-20 20:12:38,634 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 64 places, 58 transitions, 174 flow [2022-02-20 20:12:39,164 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 22021 states, 22020 states have (on average 4.190735694822888) internal successors, (92280), 22020 states have internal predecessors, (92280), 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,230 INFO L78 Accepts]: Start accepts. Automaton has has 22021 states, 22020 states have (on average 4.190735694822888) internal successors, (92280), 22020 states have internal predecessors, (92280), 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 33 [2022-02-20 20:12:39,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:12:39,231 INFO L470 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 174 flow [2022-02-20 20:12:39,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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,232 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:39,232 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 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:39,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 20:12:39,232 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-20 20:12:39,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:39,233 INFO L85 PathProgramCache]: Analyzing trace with hash 744623267, now seen corresponding path program 1 times [2022-02-20 20:12:39,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:39,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863677944] [2022-02-20 20:12:39,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:39,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:12:39,248 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:12:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:12:39,259 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:12:39,259 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:12:39,260 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (5 of 6 remaining) [2022-02-20 20:12:39,260 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-02-20 20:12:39,260 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-02-20 20:12:39,260 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-02-20 20:12:39,260 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-02-20 20:12:39,261 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-02-20 20:12:39,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 20:12:39,261 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 20:12:39,261 WARN L235 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2022-02-20 20:12:39,261 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2022-02-20 20:12:39,272 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,272 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,272 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,272 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,272 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,272 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,273 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,273 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,273 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,273 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,274 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,274 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,274 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,274 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,274 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,274 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,274 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,275 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,275 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,275 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,275 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,275 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,276 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,276 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,276 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,276 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,276 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,276 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,276 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,277 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,277 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,277 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,277 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,277 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,278 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,278 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,278 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,278 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,278 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,278 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,279 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,279 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,279 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,279 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,279 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,280 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,280 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,280 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,280 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,280 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,280 WARN L322 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,280 WARN L322 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,281 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,281 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,281 WARN L322 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,281 WARN L322 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,281 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,282 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,282 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,282 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,282 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,282 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,282 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,283 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,283 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,283 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,283 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,283 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,284 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,284 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,284 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,284 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,285 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,285 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,285 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,285 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,285 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,286 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread5of5ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,286 WARN L322 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,286 WARN L322 ript$VariableManager]: TermVariabe thr1Thread5of5ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:39,286 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:12:39,287 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:12:39,287 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:39,288 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-20 20:12:39,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 69 transitions, 183 flow [2022-02-20 20:12:39,297 INFO L129 PetriNetUnfolder]: 6/132 cut-off events. [2022-02-20 20:12:39,297 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-02-20 20:12:39,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 132 events. 6/132 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 198 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 124. Up to 12 conditions per place. [2022-02-20 20:12:39,298 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 69 transitions, 183 flow [2022-02-20 20:12:39,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 69 transitions, 183 flow [2022-02-20 20:12:39,301 INFO L129 PetriNetUnfolder]: 2/31 cut-off events. [2022-02-20 20:12:39,301 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:12:39,301 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:39,301 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] [2022-02-20 20:12:39,301 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-02-20 20:12:39,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:39,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1967171630, now seen corresponding path program 1 times [2022-02-20 20:12:39,302 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:39,302 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890742353] [2022-02-20 20:12:39,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:39,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:12:39,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {82#true} [303] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {82#true} is VALID [2022-02-20 20:12:39,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {82#true} [291] 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] {82#true} is VALID [2022-02-20 20:12:39,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {82#true} [313] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {82#true} is VALID [2022-02-20 20:12:39,338 INFO L290 TraceCheckUtils]: 3: Hoare triple {82#true} [314] L-1-2-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {82#true} is VALID [2022-02-20 20:12:39,338 INFO L290 TraceCheckUtils]: 4: Hoare triple {82#true} [302] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {82#true} is VALID [2022-02-20 20:12:39,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {82#true} [288] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {82#true} is VALID [2022-02-20 20:12:39,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {82#true} [287] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {82#true} is VALID [2022-02-20 20:12:39,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {82#true} [305] L12-3-->L12-4: Formula: (and (= 18 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {82#true} is VALID [2022-02-20 20:12:39,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {82#true} [299] L12-4-->L701: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] {82#true} is VALID [2022-02-20 20:12:39,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {82#true} [310] L701-->L-1-3: Formula: (= v_~l~0_4 0) InVars {} OutVars{~l~0=v_~l~0_4} AuxVars[] AssignedVars[~l~0] {84#(= ~l~0 0)} is VALID [2022-02-20 20:12:39,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {84#(= ~l~0 0)} [316] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {84#(= ~l~0 0)} is VALID [2022-02-20 20:12:39,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {84#(= ~l~0 0)} [296] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {84#(= ~l~0 0)} is VALID [2022-02-20 20:12:39,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {84#(= ~l~0 0)} [301] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {84#(= ~l~0 0)} is VALID [2022-02-20 20:12:39,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {84#(= ~l~0 0)} [295] L-1-6-->L717: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t~0#1.base] {84#(= ~l~0 0)} is VALID [2022-02-20 20:12:39,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {84#(= ~l~0 0)} [306] L717-->L718-7: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {84#(= ~l~0 0)} is VALID [2022-02-20 20:12:39,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {84#(= ~l~0 0)} [309] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {84#(= ~l~0 0)} is VALID [2022-02-20 20:12:39,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {84#(= ~l~0 0)} [319] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {84#(= ~l~0 0)} is VALID [2022-02-20 20:12:39,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {84#(= ~l~0 0)} [315] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {84#(= ~l~0 0)} is VALID [2022-02-20 20:12:39,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {84#(= ~l~0 0)} [292] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {84#(= ~l~0 0)} is VALID [2022-02-20 20:12:39,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {84#(= ~l~0 0)} [359] L718-4-->thr1ENTRY: Formula: (and (= |v_thr1Thread1of5ForFork0_#in~arg.offset_4| 0) (= v_thr1Thread1of5ForFork0_thidvar1_2 0) (= |v_thr1Thread1of5ForFork0_#in~arg.base_4| 0) (= v_thr1Thread1of5ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre4#1_26|)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_26|} OutVars{thr1Thread1of5ForFork0_#in~arg.offset=|v_thr1Thread1of5ForFork0_#in~arg.offset_4|, thr1Thread1of5ForFork0_#res.offset=|v_thr1Thread1of5ForFork0_#res.offset_4|, thr1Thread1of5ForFork0_thidvar1=v_thr1Thread1of5ForFork0_thidvar1_2, thr1Thread1of5ForFork0_thidvar0=v_thr1Thread1of5ForFork0_thidvar0_2, thr1Thread1of5ForFork0_#in~arg.base=|v_thr1Thread1of5ForFork0_#in~arg.base_4|, thr1Thread1of5ForFork0_~arg.base=v_thr1Thread1of5ForFork0_~arg.base_4, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_26|, thr1Thread1of5ForFork0_~arg.offset=v_thr1Thread1of5ForFork0_~arg.offset_4, thr1Thread1of5ForFork0_#res.base=|v_thr1Thread1of5ForFork0_#res.base_4|} AuxVars[] AssignedVars[thr1Thread1of5ForFork0_#in~arg.offset, thr1Thread1of5ForFork0_#res.offset, thr1Thread1of5ForFork0_thidvar1, thr1Thread1of5ForFork0_thidvar0, thr1Thread1of5ForFork0_#in~arg.base, thr1Thread1of5ForFork0_~arg.base, thr1Thread1of5ForFork0_~arg.offset, thr1Thread1of5ForFork0_#res.base] {84#(= ~l~0 0)} is VALID [2022-02-20 20:12:39,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {84#(= ~l~0 0)} [330] thr1ENTRY-->L704: Formula: (and (= |v_thr1Thread1of5ForFork0_#in~arg.offset_1| v_thr1Thread1of5ForFork0_~arg.offset_1) (= v_thr1Thread1of5ForFork0_~arg.base_1 |v_thr1Thread1of5ForFork0_#in~arg.base_1|)) InVars {thr1Thread1of5ForFork0_#in~arg.base=|v_thr1Thread1of5ForFork0_#in~arg.base_1|, thr1Thread1of5ForFork0_#in~arg.offset=|v_thr1Thread1of5ForFork0_#in~arg.offset_1|} OutVars{thr1Thread1of5ForFork0_#in~arg.base=|v_thr1Thread1of5ForFork0_#in~arg.base_1|, thr1Thread1of5ForFork0_#in~arg.offset=|v_thr1Thread1of5ForFork0_#in~arg.offset_1|, thr1Thread1of5ForFork0_~arg.base=v_thr1Thread1of5ForFork0_~arg.base_1, thr1Thread1of5ForFork0_~arg.offset=v_thr1Thread1of5ForFork0_~arg.offset_1} AuxVars[] AssignedVars[thr1Thread1of5ForFork0_~arg.base, thr1Thread1of5ForFork0_~arg.offset] {84#(= ~l~0 0)} is VALID [2022-02-20 20:12:39,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {84#(= ~l~0 0)} [331] L704-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= (mod v_~l~0_5 256) 0)) (= (mod v_~s~0_5 256) 0)) InVars {~l~0=v_~l~0_5, ~s~0=v_~s~0_5} OutVars{~l~0=v_~l~0_5, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[] {83#false} is VALID [2022-02-20 20:12:39,349 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:39,349 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:12:39,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890742353] [2022-02-20 20:12:39,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890742353] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:12:39,350 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:12:39,350 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:12:39,350 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894402296] [2022-02-20 20:12:39,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:12:39,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2022-02-20 20:12:39,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:12:39,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:12:39,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:12:39,365 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:12:39,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:12:39,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:12:39,366 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 69 [2022-02-20 20:12:39,366 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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,366 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:12:39,367 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 69 [2022-02-20 20:12:39,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:12:39,910 INFO L129 PetriNetUnfolder]: 2584/4717 cut-off events. [2022-02-20 20:12:39,910 INFO L130 PetriNetUnfolder]: For 3401/3401 co-relation queries the response was YES. [2022-02-20 20:12:39,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9803 conditions, 4717 events. 2584/4717 cut-off events. For 3401/3401 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 33183 event pairs, 864 based on Foata normal form. 1064/4709 useless extension candidates. Maximal degree in co-relation 6342. Up to 3488 conditions per place. [2022-02-20 20:12:39,958 INFO L132 encePairwiseOnDemand]: 56/69 looper letters, 29 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2022-02-20 20:12:39,959 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 76 transitions, 299 flow [2022-02-20 20:12:39,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:12:39,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:12:39,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2022-02-20 20:12:39,961 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8792270531400966 [2022-02-20 20:12:39,962 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 182 transitions. [2022-02-20 20:12:39,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 182 transitions. [2022-02-20 20:12:39,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:12:39,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 182 transitions. [2022-02-20 20:12:39,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 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,963 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 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,963 INFO L186 Difference]: Start difference. First operand has 79 places, 69 transitions, 183 flow. Second operand 3 states and 182 transitions. [2022-02-20 20:12:39,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 76 transitions, 299 flow [2022-02-20 20:12:39,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 76 transitions, 267 flow, removed 16 selfloop flow, removed 0 redundant places. [2022-02-20 20:12:39,975 INFO L242 Difference]: Finished difference. Result has 76 places, 67 transitions, 197 flow [2022-02-20 20:12:39,976 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2022-02-20 20:12:39,977 INFO L334 CegarLoopForPetriNet]: 79 programPoint places, -3 predicate places. [2022-02-20 20:12:39,977 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 67 transitions, 197 flow [2022-02-20 20:12:47,813 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 275036 states, 275005 states have (on average 5.112837948400938) internal successors, (1406056), 275035 states have internal predecessors, (1406056), 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:48,942 INFO L78 Accepts]: Start accepts. Automaton has has 275036 states, 275005 states have (on average 5.112837948400938) internal successors, (1406056), 275035 states have internal predecessors, (1406056), 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 22 [2022-02-20 20:12:48,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:12:48,943 INFO L470 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 197 flow [2022-02-20 20:12:48,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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:48,943 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:48,943 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] [2022-02-20 20:12:48,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 20:12:48,943 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-02-20 20:12:48,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:48,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1941602668, now seen corresponding path program 1 times [2022-02-20 20:12:48,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:48,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337619447] [2022-02-20 20:12:48,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:48,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:12:48,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {275124#true} [303] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275124#true} is VALID [2022-02-20 20:12:48,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {275124#true} [291] 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] {275124#true} is VALID [2022-02-20 20:12:48,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {275124#true} [313] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {275124#true} is VALID [2022-02-20 20:12:48,984 INFO L290 TraceCheckUtils]: 3: Hoare triple {275124#true} [314] L-1-2-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {275124#true} is VALID [2022-02-20 20:12:48,985 INFO L290 TraceCheckUtils]: 4: Hoare triple {275124#true} [302] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {275124#true} is VALID [2022-02-20 20:12:48,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {275124#true} [288] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {275124#true} is VALID [2022-02-20 20:12:48,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {275124#true} [287] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {275124#true} is VALID [2022-02-20 20:12:48,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {275124#true} [305] L12-3-->L12-4: Formula: (and (= 18 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {275124#true} is VALID [2022-02-20 20:12:48,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {275124#true} [299] L12-4-->L701: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] {275124#true} is VALID [2022-02-20 20:12:48,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {275124#true} [310] L701-->L-1-3: Formula: (= v_~l~0_4 0) InVars {} OutVars{~l~0=v_~l~0_4} AuxVars[] AssignedVars[~l~0] {275124#true} is VALID [2022-02-20 20:12:48,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {275124#true} [316] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275124#true} is VALID [2022-02-20 20:12:48,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {275124#true} [296] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275124#true} is VALID [2022-02-20 20:12:48,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {275124#true} [301] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {275124#true} is VALID [2022-02-20 20:12:48,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {275124#true} [295] L-1-6-->L717: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t~0#1.base] {275124#true} is VALID [2022-02-20 20:12:48,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {275124#true} [306] L717-->L718-7: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {275124#true} is VALID [2022-02-20 20:12:48,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {275124#true} [309] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275124#true} is VALID [2022-02-20 20:12:48,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {275124#true} [319] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {275124#true} is VALID [2022-02-20 20:12:48,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {275124#true} [315] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {275124#true} is VALID [2022-02-20 20:12:48,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {275124#true} [292] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {275124#true} is VALID [2022-02-20 20:12:48,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {275124#true} [359] L718-4-->thr1ENTRY: Formula: (and (= |v_thr1Thread1of5ForFork0_#in~arg.offset_4| 0) (= v_thr1Thread1of5ForFork0_thidvar1_2 0) (= |v_thr1Thread1of5ForFork0_#in~arg.base_4| 0) (= v_thr1Thread1of5ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre4#1_26|)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_26|} OutVars{thr1Thread1of5ForFork0_#in~arg.offset=|v_thr1Thread1of5ForFork0_#in~arg.offset_4|, thr1Thread1of5ForFork0_#res.offset=|v_thr1Thread1of5ForFork0_#res.offset_4|, thr1Thread1of5ForFork0_thidvar1=v_thr1Thread1of5ForFork0_thidvar1_2, thr1Thread1of5ForFork0_thidvar0=v_thr1Thread1of5ForFork0_thidvar0_2, thr1Thread1of5ForFork0_#in~arg.base=|v_thr1Thread1of5ForFork0_#in~arg.base_4|, thr1Thread1of5ForFork0_~arg.base=v_thr1Thread1of5ForFork0_~arg.base_4, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_26|, thr1Thread1of5ForFork0_~arg.offset=v_thr1Thread1of5ForFork0_~arg.offset_4, thr1Thread1of5ForFork0_#res.base=|v_thr1Thread1of5ForFork0_#res.base_4|} AuxVars[] AssignedVars[thr1Thread1of5ForFork0_#in~arg.offset, thr1Thread1of5ForFork0_#res.offset, thr1Thread1of5ForFork0_thidvar1, thr1Thread1of5ForFork0_thidvar0, thr1Thread1of5ForFork0_#in~arg.base, thr1Thread1of5ForFork0_~arg.base, thr1Thread1of5ForFork0_~arg.offset, thr1Thread1of5ForFork0_#res.base] {275124#true} is VALID [2022-02-20 20:12:48,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {275124#true} [320] L718-5-->L718-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {275124#true} is VALID [2022-02-20 20:12:48,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {275124#true} [312] L718-6-->L718-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {275124#true} is VALID [2022-02-20 20:12:48,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {275124#true} [309] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275124#true} is VALID [2022-02-20 20:12:48,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {275124#true} [319] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {275124#true} is VALID [2022-02-20 20:12:48,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {275124#true} [315] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {275124#true} is VALID [2022-02-20 20:12:48,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {275124#true} [292] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {275124#true} is VALID [2022-02-20 20:12:48,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {275124#true} [360] L718-4-->thr1ENTRY: Formula: (and (= |v_thr1Thread2of5ForFork0_#in~arg.base_4| 0) (= v_thr1Thread2of5ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre4#1_28|) (= |v_thr1Thread2of5ForFork0_#in~arg.offset_4| 0) (= v_thr1Thread2of5ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_28|} OutVars{thr1Thread2of5ForFork0_~arg.base=v_thr1Thread2of5ForFork0_~arg.base_4, thr1Thread2of5ForFork0_#in~arg.offset=|v_thr1Thread2of5ForFork0_#in~arg.offset_4|, thr1Thread2of5ForFork0_thidvar1=v_thr1Thread2of5ForFork0_thidvar1_2, thr1Thread2of5ForFork0_#in~arg.base=|v_thr1Thread2of5ForFork0_#in~arg.base_4|, thr1Thread2of5ForFork0_#res.offset=|v_thr1Thread2of5ForFork0_#res.offset_4|, thr1Thread2of5ForFork0_thidvar0=v_thr1Thread2of5ForFork0_thidvar0_2, thr1Thread2of5ForFork0_#res.base=|v_thr1Thread2of5ForFork0_#res.base_4|, thr1Thread2of5ForFork0_~arg.offset=v_thr1Thread2of5ForFork0_~arg.offset_4, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_28|} AuxVars[] AssignedVars[thr1Thread2of5ForFork0_~arg.base, thr1Thread2of5ForFork0_#in~arg.offset, thr1Thread2of5ForFork0_thidvar1, thr1Thread2of5ForFork0_#in~arg.base, thr1Thread2of5ForFork0_#res.offset, thr1Thread2of5ForFork0_thidvar0, thr1Thread2of5ForFork0_#res.base, thr1Thread2of5ForFork0_~arg.offset] {275124#true} is VALID [2022-02-20 20:12:48,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {275124#true} [330] thr1ENTRY-->L704: Formula: (and (= |v_thr1Thread1of5ForFork0_#in~arg.offset_1| v_thr1Thread1of5ForFork0_~arg.offset_1) (= v_thr1Thread1of5ForFork0_~arg.base_1 |v_thr1Thread1of5ForFork0_#in~arg.base_1|)) InVars {thr1Thread1of5ForFork0_#in~arg.base=|v_thr1Thread1of5ForFork0_#in~arg.base_1|, thr1Thread1of5ForFork0_#in~arg.offset=|v_thr1Thread1of5ForFork0_#in~arg.offset_1|} OutVars{thr1Thread1of5ForFork0_#in~arg.base=|v_thr1Thread1of5ForFork0_#in~arg.base_1|, thr1Thread1of5ForFork0_#in~arg.offset=|v_thr1Thread1of5ForFork0_#in~arg.offset_1|, thr1Thread1of5ForFork0_~arg.base=v_thr1Thread1of5ForFork0_~arg.base_1, thr1Thread1of5ForFork0_~arg.offset=v_thr1Thread1of5ForFork0_~arg.offset_1} AuxVars[] AssignedVars[thr1Thread1of5ForFork0_~arg.base, thr1Thread1of5ForFork0_~arg.offset] {275124#true} is VALID [2022-02-20 20:12:48,989 INFO L290 TraceCheckUtils]: 28: Hoare triple {275124#true} [332] L704-->L705-3: Formula: (or (not (= (mod v_~s~0_In_1 256) 0)) (= (mod v_~l~0_In_1 256) 0)) InVars {~l~0=v_~l~0_In_1, ~s~0=v_~s~0_In_1} OutVars{~l~0=v_~l~0_In_1, ~s~0=v_~s~0_In_1} AuxVars[] AssignedVars[] {275124#true} is VALID [2022-02-20 20:12:48,990 INFO L290 TraceCheckUtils]: 29: Hoare triple {275124#true} [333] L705-3-->L709: Formula: (= v_~s~0_3 1) InVars {} OutVars{~s~0=v_~s~0_3} AuxVars[] AssignedVars[~s~0] {275126#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:48,990 INFO L290 TraceCheckUtils]: 30: Hoare triple {275126#(= (+ (- 1) ~s~0) 0)} [334] L709-->L712: Formula: (= v_~l~0_3 1) InVars {} OutVars{~l~0=v_~l~0_3} AuxVars[] AssignedVars[~l~0] {275126#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:48,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {275126#(= (+ (- 1) ~s~0) 0)} [323] thr1ENTRY-->L704: Formula: (and (= |v_thr1Thread2of5ForFork0_#in~arg.offset_1| v_thr1Thread2of5ForFork0_~arg.offset_1) (= |v_thr1Thread2of5ForFork0_#in~arg.base_1| v_thr1Thread2of5ForFork0_~arg.base_1)) InVars {thr1Thread2of5ForFork0_#in~arg.base=|v_thr1Thread2of5ForFork0_#in~arg.base_1|, thr1Thread2of5ForFork0_#in~arg.offset=|v_thr1Thread2of5ForFork0_#in~arg.offset_1|} OutVars{thr1Thread2of5ForFork0_~arg.base=v_thr1Thread2of5ForFork0_~arg.base_1, thr1Thread2of5ForFork0_#in~arg.offset=|v_thr1Thread2of5ForFork0_#in~arg.offset_1|, thr1Thread2of5ForFork0_~arg.offset=v_thr1Thread2of5ForFork0_~arg.offset_1, thr1Thread2of5ForFork0_#in~arg.base=|v_thr1Thread2of5ForFork0_#in~arg.base_1|} AuxVars[] AssignedVars[thr1Thread2of5ForFork0_~arg.base, thr1Thread2of5ForFork0_~arg.offset] {275126#(= (+ (- 1) ~s~0) 0)} is VALID [2022-02-20 20:12:48,991 INFO L290 TraceCheckUtils]: 32: Hoare triple {275126#(= (+ (- 1) ~s~0) 0)} [324] L704-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= (mod v_~l~0_5 256) 0)) (= (mod v_~s~0_5 256) 0)) InVars {~l~0=v_~l~0_5, ~s~0=v_~s~0_5} OutVars{~l~0=v_~l~0_5, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[] {275125#false} is VALID [2022-02-20 20:12:48,992 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:48,992 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:12:48,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337619447] [2022-02-20 20:12:48,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337619447] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:12:48,993 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:12:48,993 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:12:48,993 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845994140] [2022-02-20 20:12:48,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:12:48,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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 33 [2022-02-20 20:12:48,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:12:48,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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:49,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:12:49,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:12:49,014 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:12:49,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:12:49,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:12:49,015 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 69 [2022-02-20 20:12:49,015 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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:49,015 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:12:49,016 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 69 [2022-02-20 20:12:49,016 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:12:49,404 INFO L129 PetriNetUnfolder]: 1323/3694 cut-off events. [2022-02-20 20:12:49,405 INFO L130 PetriNetUnfolder]: For 1408/1408 co-relation queries the response was YES. [2022-02-20 20:12:49,424 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6706 conditions, 3694 events. 1323/3694 cut-off events. For 1408/1408 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 33703 event pairs, 293 based on Foata normal form. 928/4487 useless extension candidates. Maximal degree in co-relation 6642. Up to 1123 conditions per place. [2022-02-20 20:12:49,448 INFO L132 encePairwiseOnDemand]: 59/69 looper letters, 25 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2022-02-20 20:12:49,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 76 transitions, 285 flow [2022-02-20 20:12:49,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:12:49,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:12:49,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2022-02-20 20:12:49,451 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8357487922705314 [2022-02-20 20:12:49,451 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 173 transitions. [2022-02-20 20:12:49,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 173 transitions. [2022-02-20 20:12:49,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:12:49,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 173 transitions. [2022-02-20 20:12:49,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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:49,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 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:49,452 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 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:49,453 INFO L186 Difference]: Start difference. First operand has 76 places, 67 transitions, 197 flow. Second operand 3 states and 173 transitions. [2022-02-20 20:12:49,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 76 transitions, 285 flow [2022-02-20 20:12:50,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 76 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:12:50,051 INFO L242 Difference]: Finished difference. Result has 73 places, 67 transitions, 206 flow [2022-02-20 20:12:50,051 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2022-02-20 20:12:50,052 INFO L334 CegarLoopForPetriNet]: 79 programPoint places, -6 predicate places. [2022-02-20 20:12:50,052 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 67 transitions, 206 flow [2022-02-20 20:12:54,482 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 154076 states, 154075 states have (on average 5.049079993509654) internal successors, (777937), 154075 states have internal predecessors, (777937), 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:55,035 INFO L78 Accepts]: Start accepts. Automaton has has 154076 states, 154075 states have (on average 5.049079993509654) internal successors, (777937), 154075 states have internal predecessors, (777937), 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 33 [2022-02-20 20:12:55,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:12:55,035 INFO L470 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 206 flow [2022-02-20 20:12:55,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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:55,035 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:55,035 INFO L254 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 5, 5, 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:55,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 20:12:55,036 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-02-20 20:12:55,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:55,036 INFO L85 PathProgramCache]: Analyzing trace with hash -576744180, now seen corresponding path program 1 times [2022-02-20 20:12:55,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:55,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894151903] [2022-02-20 20:12:55,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:55,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:12:55,071 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:12:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:12:55,148 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:12:55,148 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:12:55,148 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (6 of 7 remaining) [2022-02-20 20:12:55,148 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-02-20 20:12:55,149 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2022-02-20 20:12:55,149 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2022-02-20 20:12:55,149 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2022-02-20 20:12:55,149 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-02-20 20:12:55,149 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-02-20 20:12:55,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 20:12:55,150 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 20:12:55,150 WARN L235 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2022-02-20 20:12:55,150 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2022-02-20 20:12:55,188 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,188 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,188 WARN L322 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,188 WARN L322 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,189 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,189 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,189 WARN L322 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,189 WARN L322 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,190 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,190 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,190 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,190 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,190 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,190 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,191 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,191 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,191 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,191 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,191 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,191 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,193 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,195 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,195 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,195 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,195 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,195 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,195 WARN L322 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,195 WARN L322 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,196 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,196 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,196 WARN L322 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,196 WARN L322 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,196 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,197 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,197 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,197 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,197 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,197 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,197 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,197 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,197 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,198 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,198 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,198 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,198 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,207 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,207 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,207 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,208 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,208 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,208 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,208 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,208 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,208 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,208 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,208 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,208 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,208 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,209 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,209 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,209 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,209 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,209 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,209 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,209 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,209 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,209 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,209 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,209 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,209 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,209 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,210 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,210 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,210 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,210 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,210 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,210 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,210 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,210 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,212 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,212 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,212 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,212 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,212 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,213 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,213 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,213 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,213 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,214 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,214 WARN L322 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,214 WARN L322 ript$VariableManager]: TermVariabe thr1Thread5of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,214 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread5of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,215 WARN L322 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,215 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,215 WARN L322 ript$VariableManager]: TermVariabe thr1Thread6of6ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,215 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread6of6ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:55,215 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:12:55,216 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:12:55,216 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:55,217 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-02-20 20:12:55,217 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 77 transitions, 214 flow [2022-02-20 20:12:55,240 INFO L129 PetriNetUnfolder]: 7/153 cut-off events. [2022-02-20 20:12:55,240 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-02-20 20:12:55,241 INFO L84 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 153 events. 7/153 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 229 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 151. Up to 14 conditions per place. [2022-02-20 20:12:55,241 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 77 transitions, 214 flow [2022-02-20 20:12:55,242 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 77 transitions, 214 flow [2022-02-20 20:12:55,244 INFO L129 PetriNetUnfolder]: 2/31 cut-off events. [2022-02-20 20:12:55,244 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:12:55,244 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:55,244 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] [2022-02-20 20:12:55,244 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-02-20 20:12:55,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:55,245 INFO L85 PathProgramCache]: Analyzing trace with hash 151278677, now seen corresponding path program 1 times [2022-02-20 20:12:55,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:55,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824605509] [2022-02-20 20:12:55,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:55,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:12:55,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {92#true} [380] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {92#true} is VALID [2022-02-20 20:12:55,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {92#true} [368] 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] {92#true} is VALID [2022-02-20 20:12:55,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {92#true} [390] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {92#true} is VALID [2022-02-20 20:12:55,264 INFO L290 TraceCheckUtils]: 3: Hoare triple {92#true} [391] L-1-2-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {92#true} is VALID [2022-02-20 20:12:55,266 INFO L290 TraceCheckUtils]: 4: Hoare triple {92#true} [379] L12-->L12-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {92#true} is VALID [2022-02-20 20:12:55,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {92#true} [365] L12-1-->L12-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {92#true} is VALID [2022-02-20 20:12:55,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {92#true} [364] L12-2-->L12-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {92#true} is VALID [2022-02-20 20:12:55,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {92#true} [382] L12-3-->L12-4: Formula: (and (= 18 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {92#true} is VALID [2022-02-20 20:12:55,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {92#true} [376] L12-4-->L701: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] {92#true} is VALID [2022-02-20 20:12:55,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {92#true} [387] L701-->L-1-3: Formula: (= v_~l~0_4 0) InVars {} OutVars{~l~0=v_~l~0_4} AuxVars[] AssignedVars[~l~0] {94#(= ~l~0 0)} is VALID [2022-02-20 20:12:55,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {94#(= ~l~0 0)} [393] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94#(= ~l~0 0)} is VALID [2022-02-20 20:12:55,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {94#(= ~l~0 0)} [373] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94#(= ~l~0 0)} is VALID [2022-02-20 20:12:55,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {94#(= ~l~0 0)} [378] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {94#(= ~l~0 0)} is VALID [2022-02-20 20:12:55,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {94#(= ~l~0 0)} [372] L-1-6-->L717: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_~#t~0#1.base] {94#(= ~l~0 0)} is VALID [2022-02-20 20:12:55,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {94#(= ~l~0 0)} [383] L717-->L718-7: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {94#(= ~l~0 0)} is VALID [2022-02-20 20:12:55,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {94#(= ~l~0 0)} [386] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94#(= ~l~0 0)} is VALID [2022-02-20 20:12:55,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {94#(= ~l~0 0)} [396] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {94#(= ~l~0 0)} is VALID [2022-02-20 20:12:55,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {94#(= ~l~0 0)} [392] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {94#(= ~l~0 0)} is VALID [2022-02-20 20:12:55,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {94#(= ~l~0 0)} [369] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {94#(= ~l~0 0)} is VALID [2022-02-20 20:12:55,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {94#(= ~l~0 0)} [443] L718-4-->thr1ENTRY: Formula: (and (= |v_thr1Thread1of6ForFork0_#in~arg.offset_4| 0) (= |v_thr1Thread1of6ForFork0_#in~arg.base_4| 0) (= 0 v_thr1Thread1of6ForFork0_thidvar1_2) (= v_thr1Thread1of6ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre4#1_36|)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_36|} OutVars{thr1Thread1of6ForFork0_#res.offset=|v_thr1Thread1of6ForFork0_#res.offset_4|, thr1Thread1of6ForFork0_~arg.offset=v_thr1Thread1of6ForFork0_~arg.offset_4, thr1Thread1of6ForFork0_#res.base=|v_thr1Thread1of6ForFork0_#res.base_4|, thr1Thread1of6ForFork0_#in~arg.offset=|v_thr1Thread1of6ForFork0_#in~arg.offset_4|, thr1Thread1of6ForFork0_#in~arg.base=|v_thr1Thread1of6ForFork0_#in~arg.base_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_36|, thr1Thread1of6ForFork0_thidvar0=v_thr1Thread1of6ForFork0_thidvar0_2, thr1Thread1of6ForFork0_~arg.base=v_thr1Thread1of6ForFork0_~arg.base_4, thr1Thread1of6ForFork0_thidvar1=v_thr1Thread1of6ForFork0_thidvar1_2} AuxVars[] AssignedVars[thr1Thread1of6ForFork0_#res.offset, thr1Thread1of6ForFork0_~arg.offset, thr1Thread1of6ForFork0_#res.base, thr1Thread1of6ForFork0_#in~arg.offset, thr1Thread1of6ForFork0_#in~arg.base, thr1Thread1of6ForFork0_thidvar0, thr1Thread1of6ForFork0_~arg.base, thr1Thread1of6ForFork0_thidvar1] {94#(= ~l~0 0)} is VALID [2022-02-20 20:12:55,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {94#(= ~l~0 0)} [407] thr1ENTRY-->L704: Formula: (and (= |v_thr1Thread1of6ForFork0_#in~arg.offset_1| v_thr1Thread1of6ForFork0_~arg.offset_1) (= v_thr1Thread1of6ForFork0_~arg.base_1 |v_thr1Thread1of6ForFork0_#in~arg.base_1|)) InVars {thr1Thread1of6ForFork0_#in~arg.base=|v_thr1Thread1of6ForFork0_#in~arg.base_1|, thr1Thread1of6ForFork0_#in~arg.offset=|v_thr1Thread1of6ForFork0_#in~arg.offset_1|} OutVars{thr1Thread1of6ForFork0_~arg.offset=v_thr1Thread1of6ForFork0_~arg.offset_1, thr1Thread1of6ForFork0_#in~arg.base=|v_thr1Thread1of6ForFork0_#in~arg.base_1|, thr1Thread1of6ForFork0_#in~arg.offset=|v_thr1Thread1of6ForFork0_#in~arg.offset_1|, thr1Thread1of6ForFork0_~arg.base=v_thr1Thread1of6ForFork0_~arg.base_1} AuxVars[] AssignedVars[thr1Thread1of6ForFork0_~arg.offset, thr1Thread1of6ForFork0_~arg.base] {94#(= ~l~0 0)} is VALID [2022-02-20 20:12:55,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {94#(= ~l~0 0)} [408] L704-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= (mod v_~l~0_5 256) 0)) (= (mod v_~s~0_5 256) 0)) InVars {~l~0=v_~l~0_5, ~s~0=v_~s~0_5} OutVars{~l~0=v_~l~0_5, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[] {93#false} is VALID [2022-02-20 20:12:55,280 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:55,281 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:12:55,281 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824605509] [2022-02-20 20:12:55,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824605509] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:12:55,281 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:12:55,281 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:12:55,281 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373323501] [2022-02-20 20:12:55,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:12:55,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2022-02-20 20:12:55,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:12:55,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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:55,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:12:55,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:12:55,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:12:55,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:12:55,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:12:55,301 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 77 [2022-02-20 20:12:55,301 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 77 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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:55,301 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:12:55,301 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 77 [2022-02-20 20:12:55,301 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:13:02,357 INFO L129 PetriNetUnfolder]: 14408/23143 cut-off events. [2022-02-20 20:13:02,357 INFO L130 PetriNetUnfolder]: For 21004/21004 co-relation queries the response was YES. [2022-02-20 20:13:02,479 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49387 conditions, 23143 events. 14408/23143 cut-off events. For 21004/21004 co-relation queries the response was YES. Maximal size of possible extension queue 1384. Compared 183564 event pairs, 9424 based on Foata normal form. 4495/21566 useless extension candidates. Maximal degree in co-relation 13922. Up to 18519 conditions per place. [2022-02-20 20:13:02,636 INFO L132 encePairwiseOnDemand]: 62/77 looper letters, 35 selfloop transitions, 7 changer transitions 0/87 dead transitions. [2022-02-20 20:13:02,636 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 87 transitions, 363 flow [2022-02-20 20:13:02,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:13:02,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:13:02,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2022-02-20 20:13:02,638 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8744588744588745 [2022-02-20 20:13:02,638 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 202 transitions. [2022-02-20 20:13:02,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 202 transitions. [2022-02-20 20:13:02,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:13:02,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 202 transitions. [2022-02-20 20:13:02,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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:13:02,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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:13:02,640 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 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:13:02,640 INFO L186 Difference]: Start difference. First operand has 89 places, 77 transitions, 214 flow. Second operand 3 states and 202 transitions. [2022-02-20 20:13:02,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 87 transitions, 363 flow [2022-02-20 20:13:02,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 87 transitions, 313 flow, removed 25 selfloop flow, removed 0 redundant places. [2022-02-20 20:13:02,715 INFO L242 Difference]: Finished difference. Result has 86 places, 76 transitions, 227 flow [2022-02-20 20:13:02,716 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=227, PETRI_PLACES=86, PETRI_TRANSITIONS=76} [2022-02-20 20:13:02,716 INFO L334 CegarLoopForPetriNet]: 89 programPoint places, -3 predicate places. [2022-02-20 20:13:02,717 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 86 places, 76 transitions, 227 flow