./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix007_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 997cd7c3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-wmm/mix007_power.oepc.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 8dc0e53f414aa481cc0d92e1b6c26bc1f4ed0399 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-997cd7c-m [2021-09-22 14:38:08,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-22 14:38:08,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-22 14:38:08,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-22 14:38:08,879 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-22 14:38:08,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-22 14:38:08,882 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-22 14:38:08,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-22 14:38:08,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-22 14:38:08,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-22 14:38:08,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-22 14:38:08,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-22 14:38:08,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-22 14:38:08,893 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-22 14:38:08,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-22 14:38:08,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-22 14:38:08,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-22 14:38:08,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-22 14:38:08,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-22 14:38:08,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-22 14:38:08,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-22 14:38:08,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-22 14:38:08,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-22 14:38:08,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-22 14:38:08,918 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-22 14:38:08,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-22 14:38:08,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-22 14:38:08,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-22 14:38:08,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-22 14:38:08,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-22 14:38:08,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-22 14:38:08,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-22 14:38:08,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-22 14:38:08,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-22 14:38:08,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-22 14:38:08,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-22 14:38:08,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-22 14:38:08,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-22 14:38:08,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-22 14:38:08,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-22 14:38:08,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-22 14:38:08,927 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-22 14:38:08,949 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-22 14:38:08,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-22 14:38:08,950 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-22 14:38:08,950 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-22 14:38:08,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-22 14:38:08,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-22 14:38:08,952 INFO L138 SettingsManager]: * Use SBE=true [2021-09-22 14:38:08,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-22 14:38:08,952 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-22 14:38:08,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-22 14:38:08,953 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-22 14:38:08,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-22 14:38:08,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-22 14:38:08,954 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-22 14:38:08,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-22 14:38:08,954 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-22 14:38:08,954 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-22 14:38:08,954 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-22 14:38:08,955 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-22 14:38:08,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-22 14:38:08,955 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-22 14:38:08,955 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-22 14:38:08,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-22 14:38:08,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-22 14:38:08,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-22 14:38:08,965 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-22 14:38:08,965 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-22 14:38:08,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-22 14:38:08,965 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-22 14:38:08,965 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-22 14:38:08,966 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 -> 8dc0e53f414aa481cc0d92e1b6c26bc1f4ed0399 [2021-09-22 14:38:09,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-22 14:38:09,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-22 14:38:09,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-22 14:38:09,191 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-22 14:38:09,192 INFO L275 PluginConnector]: CDTParser initialized [2021-09-22 14:38:09,192 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix007_power.oepc.i [2021-09-22 14:38:09,253 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18904ebc6/4bb6b102579a44329b918303f341eb4c/FLAG544813bb1 [2021-09-22 14:38:09,668 INFO L306 CDTParser]: Found 1 translation units. [2021-09-22 14:38:09,669 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix007_power.oepc.i [2021-09-22 14:38:09,680 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18904ebc6/4bb6b102579a44329b918303f341eb4c/FLAG544813bb1 [2021-09-22 14:38:10,035 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18904ebc6/4bb6b102579a44329b918303f341eb4c [2021-09-22 14:38:10,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-22 14:38:10,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-22 14:38:10,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-22 14:38:10,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-22 14:38:10,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-22 14:38:10,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 02:38:10" (1/1) ... [2021-09-22 14:38:10,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65423bd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:38:10, skipping insertion in model container [2021-09-22 14:38:10,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 02:38:10" (1/1) ... [2021-09-22 14:38:10,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-22 14:38:10,071 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-22 14:38:10,185 WARN L228 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-wmm/mix007_power.oepc.i[951,964] [2021-09-22 14:38:10,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-22 14:38:10,388 INFO L203 MainTranslator]: Completed pre-run [2021-09-22 14:38:10,396 WARN L228 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-wmm/mix007_power.oepc.i[951,964] [2021-09-22 14:38:10,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-22 14:38:10,492 INFO L208 MainTranslator]: Completed translation [2021-09-22 14:38:10,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:38:10 WrapperNode [2021-09-22 14:38:10,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-22 14:38:10,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-22 14:38:10,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-22 14:38:10,498 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-22 14:38:10,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:38:10" (1/1) ... [2021-09-22 14:38:10,514 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:38:10" (1/1) ... [2021-09-22 14:38:10,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-22 14:38:10,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-22 14:38:10,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-22 14:38:10,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-22 14:38:10,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:38:10" (1/1) ... [2021-09-22 14:38:10,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:38:10" (1/1) ... [2021-09-22 14:38:10,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:38:10" (1/1) ... [2021-09-22 14:38:10,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:38:10" (1/1) ... [2021-09-22 14:38:10,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:38:10" (1/1) ... [2021-09-22 14:38:10,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:38:10" (1/1) ... [2021-09-22 14:38:10,581 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:38:10" (1/1) ... [2021-09-22 14:38:10,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-22 14:38:10,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-22 14:38:10,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-22 14:38:10,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-22 14:38:10,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:38:10" (1/1) ... [2021-09-22 14:38:10,594 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-22 14:38:10,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-22 14:38:10,618 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) [2021-09-22 14:38:10,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-09-22 14:38:10,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-09-22 14:38:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-09-22 14:38:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-22 14:38:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-09-22 14:38:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-09-22 14:38:10,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-09-22 14:38:10,651 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-09-22 14:38:10,651 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-09-22 14:38:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-09-22 14:38:10,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-09-22 14:38:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-09-22 14:38:10,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-09-22 14:38:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-22 14:38:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-09-22 14:38:10,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-22 14:38:10,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-22 14:38:10,654 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-09-22 14:38:11,994 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-22 14:38:11,995 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-09-22 14:38:11,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:38:11 BoogieIcfgContainer [2021-09-22 14:38:11,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-22 14:38:11,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-22 14:38:11,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-22 14:38:12,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-22 14:38:12,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.09 02:38:10" (1/3) ... [2021-09-22 14:38:12,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1f6847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 02:38:12, skipping insertion in model container [2021-09-22 14:38:12,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:38:10" (2/3) ... [2021-09-22 14:38:12,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1f6847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 02:38:12, skipping insertion in model container [2021-09-22 14:38:12,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:38:11" (3/3) ... [2021-09-22 14:38:12,003 INFO L111 eAbstractionObserver]: Analyzing ICFG mix007_power.oepc.i [2021-09-22 14:38:12,006 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-09-22 14:38:12,006 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-22 14:38:12,007 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-09-22 14:38:12,007 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-09-22 14:38:12,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,056 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,056 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,056 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,057 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,057 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,057 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,058 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,058 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,063 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,063 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,063 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,064 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,064 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,066 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,067 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,067 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,068 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,068 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,073 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,075 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,075 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,076 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,076 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,077 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,077 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,077 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,077 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,077 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,081 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,086 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,092 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,093 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,093 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,093 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,094 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,094 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,094 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,094 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,094 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,094 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,094 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,094 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,094 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,094 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,095 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,095 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,095 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,095 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,095 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,095 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,095 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,095 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,095 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,096 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,096 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,096 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,096 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,097 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,097 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,098 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,098 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,098 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,098 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,098 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,098 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,099 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,099 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,099 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,099 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,106 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,107 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,110 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,110 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,112 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,115 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,128 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,128 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,129 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:38:12,130 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-09-22 14:38:12,156 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-22 14:38:12,160 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, mConcurrency=FINITE_AUTOMATA, 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 [2021-09-22 14:38:12,161 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-09-22 14:38:12,170 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-09-22 14:38:12,176 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 132 transitions, 284 flow [2021-09-22 14:38:12,178 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 132 transitions, 284 flow [2021-09-22 14:38:12,179 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2021-09-22 14:38:12,205 INFO L129 PetriNetUnfolder]: 2/128 cut-off events. [2021-09-22 14:38:12,206 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-09-22 14:38:12,208 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2021-09-22 14:38:12,210 INFO L116 LiptonReduction]: Number of co-enabled transitions 3224 [2021-09-22 14:38:16,698 INFO L131 LiptonReduction]: Checked pairs total: 9632 [2021-09-22 14:38:16,698 INFO L133 LiptonReduction]: Total number of compositions: 107 [2021-09-22 14:38:16,703 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 37 transitions, 94 flow [2021-09-22 14:38:16,867 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6194 states, 6191 states have (on average 4.212243579389436) internal successors, (26078), 6193 states have internal predecessors, (26078), 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) [2021-09-22 14:38:16,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 6194 states, 6191 states have (on average 4.212243579389436) internal successors, (26078), 6193 states have internal predecessors, (26078), 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) [2021-09-22 14:38:16,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-09-22 14:38:16,904 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:38:16,905 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-09-22 14:38:16,905 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:38:16,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:38:16,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1255614, now seen corresponding path program 1 times [2021-09-22 14:38:16,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:38:16,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083689275] [2021-09-22 14:38:16,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:38:16,917 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:38:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:38:17,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:38:17,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:38:17,108 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083689275] [2021-09-22 14:38:17,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083689275] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:38:17,109 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:38:17,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-09-22 14:38:17,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986211978] [2021-09-22 14:38:17,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-22 14:38:17,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:38:17,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-22 14:38:17,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:38:17,136 INFO L87 Difference]: Start difference. First operand has 6194 states, 6191 states have (on average 4.212243579389436) internal successors, (26078), 6193 states have internal predecessors, (26078), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2021-09-22 14:38:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:38:17,278 INFO L93 Difference]: Finished difference Result 5042 states and 20104 transitions. [2021-09-22 14:38:17,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-22 14:38:17,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2021-09-22 14:38:17,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:38:17,330 INFO L225 Difference]: With dead ends: 5042 [2021-09-22 14:38:17,331 INFO L226 Difference]: Without dead ends: 4862 [2021-09-22 14:38:17,331 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:38:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4862 states. [2021-09-22 14:38:17,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4862 to 4862. [2021-09-22 14:38:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4862 states, 4861 states have (on average 4.007405883563053) internal successors, (19480), 4861 states have internal predecessors, (19480), 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) [2021-09-22 14:38:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4862 states to 4862 states and 19480 transitions. [2021-09-22 14:38:17,656 INFO L78 Accepts]: Start accepts. Automaton has 4862 states and 19480 transitions. Word has length 3 [2021-09-22 14:38:17,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:38:17,656 INFO L470 AbstractCegarLoop]: Abstraction has 4862 states and 19480 transitions. [2021-09-22 14:38:17,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) [2021-09-22 14:38:17,662 INFO L276 IsEmpty]: Start isEmpty. Operand 4862 states and 19480 transitions. [2021-09-22 14:38:17,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-22 14:38:17,674 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:38:17,674 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:38:17,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-22 14:38:17,675 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:38:17,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:38:17,675 INFO L82 PathProgramCache]: Analyzing trace with hash -2024164328, now seen corresponding path program 1 times [2021-09-22 14:38:17,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:38:17,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126911258] [2021-09-22 14:38:17,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:38:17,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:38:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:38:17,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:38:17,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:38:17,779 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126911258] [2021-09-22 14:38:17,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126911258] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:38:17,780 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:38:17,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-22 14:38:17,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11388330] [2021-09-22 14:38:17,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:38:17,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:38:17,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:38:17,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:38:17,783 INFO L87 Difference]: Start difference. First operand 4862 states and 19480 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2021-09-22 14:38:17,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:38:17,966 INFO L93 Difference]: Finished difference Result 9076 states and 34840 transitions. [2021-09-22 14:38:17,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:38:17,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2021-09-22 14:38:17,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:38:18,056 INFO L225 Difference]: With dead ends: 9076 [2021-09-22 14:38:18,056 INFO L226 Difference]: Without dead ends: 7405 [2021-09-22 14:38:18,057 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:38:18,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7405 states. [2021-09-22 14:38:18,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7405 to 6349. [2021-09-22 14:38:18,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6349 states, 6348 states have (on average 3.9365154379332075) internal successors, (24989), 6348 states have internal predecessors, (24989), 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) [2021-09-22 14:38:18,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6349 states to 6349 states and 24989 transitions. [2021-09-22 14:38:18,411 INFO L78 Accepts]: Start accepts. Automaton has 6349 states and 24989 transitions. Word has length 12 [2021-09-22 14:38:18,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:38:18,411 INFO L470 AbstractCegarLoop]: Abstraction has 6349 states and 24989 transitions. [2021-09-22 14:38:18,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2021-09-22 14:38:18,412 INFO L276 IsEmpty]: Start isEmpty. Operand 6349 states and 24989 transitions. [2021-09-22 14:38:18,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-22 14:38:18,415 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:38:18,415 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:38:18,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-09-22 14:38:18,415 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:38:18,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:38:18,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1044774180, now seen corresponding path program 1 times [2021-09-22 14:38:18,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:38:18,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492006261] [2021-09-22 14:38:18,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:38:18,416 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:38:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:38:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:38:18,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:38:18,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492006261] [2021-09-22 14:38:18,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492006261] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:38:18,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:38:18,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:38:18,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63464423] [2021-09-22 14:38:18,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:38:18,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:38:18,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:38:18,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:38:18,505 INFO L87 Difference]: Start difference. First operand 6349 states and 24989 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2021-09-22 14:38:18,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:38:18,700 INFO L93 Difference]: Finished difference Result 7685 states and 29095 transitions. [2021-09-22 14:38:18,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-22 14:38:18,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2021-09-22 14:38:18,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:38:18,766 INFO L225 Difference]: With dead ends: 7685 [2021-09-22 14:38:18,766 INFO L226 Difference]: Without dead ends: 6509 [2021-09-22 14:38:18,766 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 33.7ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:38:18,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6509 states. [2021-09-22 14:38:18,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6509 to 5099. [2021-09-22 14:38:18,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5099 states, 5098 states have (on average 3.9119262455865047) internal successors, (19943), 5098 states have internal predecessors, (19943), 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) [2021-09-22 14:38:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5099 states to 5099 states and 19943 transitions. [2021-09-22 14:38:19,017 INFO L78 Accepts]: Start accepts. Automaton has 5099 states and 19943 transitions. Word has length 13 [2021-09-22 14:38:19,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:38:19,018 INFO L470 AbstractCegarLoop]: Abstraction has 5099 states and 19943 transitions. [2021-09-22 14:38:19,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2021-09-22 14:38:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 5099 states and 19943 transitions. [2021-09-22 14:38:19,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-22 14:38:19,020 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:38:19,021 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:38:19,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-09-22 14:38:19,021 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:38:19,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:38:19,021 INFO L82 PathProgramCache]: Analyzing trace with hash 398545033, now seen corresponding path program 1 times [2021-09-22 14:38:19,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:38:19,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476468235] [2021-09-22 14:38:19,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:38:19,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:38:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:38:19,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:38:19,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:38:19,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476468235] [2021-09-22 14:38:19,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476468235] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:38:19,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:38:19,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:38:19,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410127991] [2021-09-22 14:38:19,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:38:19,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:38:19,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:38:19,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:38:19,079 INFO L87 Difference]: Start difference. First operand 5099 states and 19943 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2021-09-22 14:38:19,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:38:19,171 INFO L93 Difference]: Finished difference Result 7263 states and 27293 transitions. [2021-09-22 14:38:19,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-22 14:38:19,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2021-09-22 14:38:19,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:38:19,196 INFO L225 Difference]: With dead ends: 7263 [2021-09-22 14:38:19,196 INFO L226 Difference]: Without dead ends: 6309 [2021-09-22 14:38:19,196 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 22.6ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:38:19,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6309 states. [2021-09-22 14:38:19,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6309 to 5019. [2021-09-22 14:38:19,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5019 states, 5018 states have (on average 3.90175368672778) internal successors, (19579), 5018 states have internal predecessors, (19579), 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) [2021-09-22 14:38:19,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5019 states to 5019 states and 19579 transitions. [2021-09-22 14:38:19,391 INFO L78 Accepts]: Start accepts. Automaton has 5019 states and 19579 transitions. Word has length 14 [2021-09-22 14:38:19,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:38:19,392 INFO L470 AbstractCegarLoop]: Abstraction has 5019 states and 19579 transitions. [2021-09-22 14:38:19,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2021-09-22 14:38:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 5019 states and 19579 transitions. [2021-09-22 14:38:19,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-09-22 14:38:19,395 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:38:19,395 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:38:19,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-09-22 14:38:19,396 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:38:19,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:38:19,397 INFO L82 PathProgramCache]: Analyzing trace with hash -994081131, now seen corresponding path program 1 times [2021-09-22 14:38:19,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:38:19,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327493379] [2021-09-22 14:38:19,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:38:19,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:38:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:38:19,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:38:19,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:38:19,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327493379] [2021-09-22 14:38:19,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327493379] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:38:19,458 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:38:19,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-22 14:38:19,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198755303] [2021-09-22 14:38:19,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:38:19,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:38:19,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:38:19,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:38:19,460 INFO L87 Difference]: Start difference. First operand 5019 states and 19579 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2021-09-22 14:38:19,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:38:19,494 INFO L93 Difference]: Finished difference Result 5259 states and 20131 transitions. [2021-09-22 14:38:19,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:38:19,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2021-09-22 14:38:19,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:38:19,509 INFO L225 Difference]: With dead ends: 5259 [2021-09-22 14:38:19,510 INFO L226 Difference]: Without dead ends: 4699 [2021-09-22 14:38:19,510 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:38:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4699 states. [2021-09-22 14:38:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4699 to 4339. [2021-09-22 14:38:19,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4339 states, 4338 states have (on average 3.8739050253573075) internal successors, (16805), 4338 states have internal predecessors, (16805), 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) [2021-09-22 14:38:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4339 states to 4339 states and 16805 transitions. [2021-09-22 14:38:19,669 INFO L78 Accepts]: Start accepts. Automaton has 4339 states and 16805 transitions. Word has length 15 [2021-09-22 14:38:19,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:38:19,669 INFO L470 AbstractCegarLoop]: Abstraction has 4339 states and 16805 transitions. [2021-09-22 14:38:19,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2021-09-22 14:38:19,669 INFO L276 IsEmpty]: Start isEmpty. Operand 4339 states and 16805 transitions. [2021-09-22 14:38:19,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-22 14:38:19,673 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:38:19,673 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:38:19,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-09-22 14:38:19,673 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:38:19,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:38:19,674 INFO L82 PathProgramCache]: Analyzing trace with hash -142733875, now seen corresponding path program 1 times [2021-09-22 14:38:19,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:38:19,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938197278] [2021-09-22 14:38:19,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:38:19,674 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:38:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:38:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:38:19,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:38:19,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938197278] [2021-09-22 14:38:19,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938197278] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:38:19,742 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:38:19,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:38:19,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925856359] [2021-09-22 14:38:19,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:38:19,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:38:19,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:38:19,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:38:19,743 INFO L87 Difference]: Start difference. First operand 4339 states and 16805 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2021-09-22 14:38:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:38:19,784 INFO L93 Difference]: Finished difference Result 4198 states and 14686 transitions. [2021-09-22 14:38:19,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:38:19,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2021-09-22 14:38:19,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:38:19,793 INFO L225 Difference]: With dead ends: 4198 [2021-09-22 14:38:19,793 INFO L226 Difference]: Without dead ends: 3139 [2021-09-22 14:38:19,793 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:38:19,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2021-09-22 14:38:19,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 3139. [2021-09-22 14:38:19,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3139 states, 3138 states have (on average 3.448374760994264) internal successors, (10821), 3138 states have internal predecessors, (10821), 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) [2021-09-22 14:38:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 10821 transitions. [2021-09-22 14:38:19,912 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 10821 transitions. Word has length 16 [2021-09-22 14:38:19,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:38:19,912 INFO L470 AbstractCegarLoop]: Abstraction has 3139 states and 10821 transitions. [2021-09-22 14:38:19,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2021-09-22 14:38:19,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 10821 transitions. [2021-09-22 14:38:19,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-09-22 14:38:19,918 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:38:19,918 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:38:19,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-09-22 14:38:19,919 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:38:19,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:38:19,919 INFO L82 PathProgramCache]: Analyzing trace with hash -175202577, now seen corresponding path program 1 times [2021-09-22 14:38:19,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:38:19,920 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364470051] [2021-09-22 14:38:19,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:38:19,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:38:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:38:20,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:38:20,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:38:20,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364470051] [2021-09-22 14:38:20,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364470051] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:38:20,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:38:20,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-22 14:38:20,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459378191] [2021-09-22 14:38:20,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:38:20,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:38:20,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:38:20,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:38:20,002 INFO L87 Difference]: Start difference. First operand 3139 states and 10821 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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) [2021-09-22 14:38:20,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:38:20,042 INFO L93 Difference]: Finished difference Result 2546 states and 8084 transitions. [2021-09-22 14:38:20,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-22 14:38:20,043 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2021-09-22 14:38:20,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:38:20,048 INFO L225 Difference]: With dead ends: 2546 [2021-09-22 14:38:20,048 INFO L226 Difference]: Without dead ends: 1943 [2021-09-22 14:38:20,049 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-22 14:38:20,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2021-09-22 14:38:20,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1937. [2021-09-22 14:38:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1937 states, 1936 states have (on average 3.1193181818181817) internal successors, (6039), 1936 states have internal predecessors, (6039), 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) [2021-09-22 14:38:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1937 states and 6039 transitions. [2021-09-22 14:38:20,091 INFO L78 Accepts]: Start accepts. Automaton has 1937 states and 6039 transitions. Word has length 19 [2021-09-22 14:38:20,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:38:20,091 INFO L470 AbstractCegarLoop]: Abstraction has 1937 states and 6039 transitions. [2021-09-22 14:38:20,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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) [2021-09-22 14:38:20,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 6039 transitions. [2021-09-22 14:38:20,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-22 14:38:20,095 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:38:20,095 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:38:20,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-09-22 14:38:20,096 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:38:20,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:38:20,097 INFO L82 PathProgramCache]: Analyzing trace with hash -306634218, now seen corresponding path program 1 times [2021-09-22 14:38:20,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:38:20,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734838050] [2021-09-22 14:38:20,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:38:20,098 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:38:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:38:20,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:38:20,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:38:20,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734838050] [2021-09-22 14:38:20,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734838050] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:38:20,214 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:38:20,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-22 14:38:20,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153976479] [2021-09-22 14:38:20,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-22 14:38:20,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:38:20,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-22 14:38:20,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-22 14:38:20,215 INFO L87 Difference]: Start difference. First operand 1937 states and 6039 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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) [2021-09-22 14:38:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:38:20,257 INFO L93 Difference]: Finished difference Result 1664 states and 5178 transitions. [2021-09-22 14:38:20,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-22 14:38:20,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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 [2021-09-22 14:38:20,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:38:20,261 INFO L225 Difference]: With dead ends: 1664 [2021-09-22 14:38:20,262 INFO L226 Difference]: Without dead ends: 1491 [2021-09-22 14:38:20,262 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 14.4ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:38:20,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2021-09-22 14:38:20,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1446. [2021-09-22 14:38:20,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1445 states have (on average 3.157785467128028) internal successors, (4563), 1445 states have internal predecessors, (4563), 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) [2021-09-22 14:38:20,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 4563 transitions. [2021-09-22 14:38:20,300 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 4563 transitions. Word has length 22 [2021-09-22 14:38:20,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:38:20,301 INFO L470 AbstractCegarLoop]: Abstraction has 1446 states and 4563 transitions. [2021-09-22 14:38:20,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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) [2021-09-22 14:38:20,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 4563 transitions. [2021-09-22 14:38:20,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-09-22 14:38:20,304 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:38:20,304 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:38:20,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-09-22 14:38:20,305 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:38:20,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:38:20,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1796400206, now seen corresponding path program 1 times [2021-09-22 14:38:20,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:38:20,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728368974] [2021-09-22 14:38:20,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:38:20,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:38:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:38:20,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:38:20,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:38:20,466 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728368974] [2021-09-22 14:38:20,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728368974] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:38:20,466 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:38:20,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-22 14:38:20,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925899546] [2021-09-22 14:38:20,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-22 14:38:20,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:38:20,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-22 14:38:20,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-09-22 14:38:20,467 INFO L87 Difference]: Start difference. First operand 1446 states and 4563 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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) [2021-09-22 14:38:20,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:38:20,677 INFO L93 Difference]: Finished difference Result 2212 states and 6670 transitions. [2021-09-22 14:38:20,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-22 14:38:20,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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 26 [2021-09-22 14:38:20,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:38:20,684 INFO L225 Difference]: With dead ends: 2212 [2021-09-22 14:38:20,684 INFO L226 Difference]: Without dead ends: 1893 [2021-09-22 14:38:20,684 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 88.6ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-09-22 14:38:20,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2021-09-22 14:38:20,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1705. [2021-09-22 14:38:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1704 states have (on average 3.0991784037558685) internal successors, (5281), 1704 states have internal predecessors, (5281), 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) [2021-09-22 14:38:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 5281 transitions. [2021-09-22 14:38:20,733 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 5281 transitions. Word has length 26 [2021-09-22 14:38:20,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:38:20,734 INFO L470 AbstractCegarLoop]: Abstraction has 1705 states and 5281 transitions. [2021-09-22 14:38:20,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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) [2021-09-22 14:38:20,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 5281 transitions. [2021-09-22 14:38:20,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-09-22 14:38:20,738 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:38:20,738 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:38:20,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-09-22 14:38:20,739 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:38:20,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:38:20,739 INFO L82 PathProgramCache]: Analyzing trace with hash -142026468, now seen corresponding path program 2 times [2021-09-22 14:38:20,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:38:20,739 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435189722] [2021-09-22 14:38:20,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:38:20,740 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:38:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:38:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:38:20,885 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:38:20,885 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435189722] [2021-09-22 14:38:20,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435189722] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:38:20,885 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:38:20,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-22 14:38:20,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019593739] [2021-09-22 14:38:20,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-22 14:38:20,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:38:20,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-22 14:38:20,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:38:20,886 INFO L87 Difference]: Start difference. First operand 1705 states and 5281 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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) [2021-09-22 14:38:20,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:38:20,945 INFO L93 Difference]: Finished difference Result 1656 states and 5179 transitions. [2021-09-22 14:38:20,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-22 14:38:20,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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 26 [2021-09-22 14:38:20,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:38:20,949 INFO L225 Difference]: With dead ends: 1656 [2021-09-22 14:38:20,949 INFO L226 Difference]: Without dead ends: 1448 [2021-09-22 14:38:20,950 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 19.7ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-09-22 14:38:20,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2021-09-22 14:38:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1340. [2021-09-22 14:38:20,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1339 states have (on average 3.166542195668409) internal successors, (4240), 1339 states have internal predecessors, (4240), 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) [2021-09-22 14:38:20,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 4240 transitions. [2021-09-22 14:38:20,974 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 4240 transitions. Word has length 26 [2021-09-22 14:38:20,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:38:20,974 INFO L470 AbstractCegarLoop]: Abstraction has 1340 states and 4240 transitions. [2021-09-22 14:38:20,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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) [2021-09-22 14:38:20,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 4240 transitions. [2021-09-22 14:38:20,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-09-22 14:38:20,978 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:38:20,978 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:38:20,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-09-22 14:38:20,978 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:38:20,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:38:20,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1136238283, now seen corresponding path program 1 times [2021-09-22 14:38:20,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:38:20,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357082615] [2021-09-22 14:38:20,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:38:20,979 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:38:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:38:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:38:21,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:38:21,103 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357082615] [2021-09-22 14:38:21,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357082615] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:38:21,103 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:38:21,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-22 14:38:21,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392543299] [2021-09-22 14:38:21,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:38:21,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:38:21,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:38:21,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:38:21,104 INFO L87 Difference]: Start difference. First operand 1340 states and 4240 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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) [2021-09-22 14:38:21,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:38:21,136 INFO L93 Difference]: Finished difference Result 2043 states and 6398 transitions. [2021-09-22 14:38:21,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:38:21,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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 30 [2021-09-22 14:38:21,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:38:21,138 INFO L225 Difference]: With dead ends: 2043 [2021-09-22 14:38:21,138 INFO L226 Difference]: Without dead ends: 994 [2021-09-22 14:38:21,138 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.5ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-09-22 14:38:21,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2021-09-22 14:38:21,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 994. [2021-09-22 14:38:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 993 states have (on average 3.015105740181269) internal successors, (2994), 993 states have internal predecessors, (2994), 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) [2021-09-22 14:38:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 2994 transitions. [2021-09-22 14:38:21,151 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 2994 transitions. Word has length 30 [2021-09-22 14:38:21,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:38:21,151 INFO L470 AbstractCegarLoop]: Abstraction has 994 states and 2994 transitions. [2021-09-22 14:38:21,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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) [2021-09-22 14:38:21,152 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 2994 transitions. [2021-09-22 14:38:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-09-22 14:38:21,154 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:38:21,154 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:38:21,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-09-22 14:38:21,154 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:38:21,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:38:21,154 INFO L82 PathProgramCache]: Analyzing trace with hash 872860717, now seen corresponding path program 2 times [2021-09-22 14:38:21,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:38:21,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692291920] [2021-09-22 14:38:21,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:38:21,154 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:38:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:38:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:38:21,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:38:21,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692291920] [2021-09-22 14:38:21,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692291920] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:38:21,228 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:38:21,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-22 14:38:21,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177661666] [2021-09-22 14:38:21,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:38:21,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:38:21,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:38:21,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:38:21,231 INFO L87 Difference]: Start difference. First operand 994 states and 2994 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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) [2021-09-22 14:38:21,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:38:21,251 INFO L93 Difference]: Finished difference Result 1246 states and 3715 transitions. [2021-09-22 14:38:21,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:38:21,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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 30 [2021-09-22 14:38:21,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:38:21,253 INFO L225 Difference]: With dead ends: 1246 [2021-09-22 14:38:21,253 INFO L226 Difference]: Without dead ends: 695 [2021-09-22 14:38:21,253 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:38:21,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2021-09-22 14:38:21,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2021-09-22 14:38:21,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 2.881844380403458) internal successors, (2000), 694 states have internal predecessors, (2000), 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) [2021-09-22 14:38:21,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 2000 transitions. [2021-09-22 14:38:21,263 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 2000 transitions. Word has length 30 [2021-09-22 14:38:21,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:38:21,263 INFO L470 AbstractCegarLoop]: Abstraction has 695 states and 2000 transitions. [2021-09-22 14:38:21,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 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) [2021-09-22 14:38:21,263 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 2000 transitions. [2021-09-22 14:38:21,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-09-22 14:38:21,265 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:38:21,265 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:38:21,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-09-22 14:38:21,265 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:38:21,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:38:21,266 INFO L82 PathProgramCache]: Analyzing trace with hash 93206635, now seen corresponding path program 3 times [2021-09-22 14:38:21,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:38:21,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793226213] [2021-09-22 14:38:21,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:38:21,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:38:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:38:21,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:38:21,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:38:21,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793226213] [2021-09-22 14:38:21,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793226213] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:38:21,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:38:21,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-09-22 14:38:21,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660385012] [2021-09-22 14:38:21,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-09-22 14:38:21,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:38:21,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-09-22 14:38:21,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-09-22 14:38:21,407 INFO L87 Difference]: Start difference. First operand 695 states and 2000 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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) [2021-09-22 14:38:21,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:38:21,542 INFO L93 Difference]: Finished difference Result 734 states and 2087 transitions. [2021-09-22 14:38:21,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-22 14:38:21,542 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 30 [2021-09-22 14:38:21,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:38:21,543 INFO L225 Difference]: With dead ends: 734 [2021-09-22 14:38:21,543 INFO L226 Difference]: Without dead ends: 515 [2021-09-22 14:38:21,543 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 84.9ms TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-09-22 14:38:21,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2021-09-22 14:38:21,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 411. [2021-09-22 14:38:21,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 2.824390243902439) internal successors, (1158), 410 states have internal predecessors, (1158), 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) [2021-09-22 14:38:21,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1158 transitions. [2021-09-22 14:38:21,549 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1158 transitions. Word has length 30 [2021-09-22 14:38:21,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:38:21,549 INFO L470 AbstractCegarLoop]: Abstraction has 411 states and 1158 transitions. [2021-09-22 14:38:21,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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) [2021-09-22 14:38:21,549 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1158 transitions. [2021-09-22 14:38:21,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-09-22 14:38:21,550 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:38:21,550 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:38:21,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-09-22 14:38:21,550 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-09-22 14:38:21,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:38:21,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1456236935, now seen corresponding path program 4 times [2021-09-22 14:38:21,551 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:38:21,551 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649923163] [2021-09-22 14:38:21,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:38:21,551 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:38:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-09-22 14:38:21,584 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-09-22 14:38:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-09-22 14:38:21,660 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-09-22 14:38:21,661 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-09-22 14:38:21,661 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:38:21,662 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:38:21,662 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-09-22 14:38:21,662 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-09-22 14:38:21,662 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-09-22 14:38:21,663 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION [2021-09-22 14:38:21,663 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:38:21,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-09-22 14:38:21,667 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-09-22 14:38:21,667 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-22 14:38:21,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.09 02:38:21 BasicIcfg [2021-09-22 14:38:21,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-22 14:38:21,733 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-22 14:38:21,733 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-22 14:38:21,733 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-22 14:38:21,733 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:38:11" (3/4) ... [2021-09-22 14:38:21,734 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-09-22 14:38:21,813 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-22 14:38:21,813 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-22 14:38:21,814 INFO L168 Benchmark]: Toolchain (without parser) took 11775.01 ms. Allocated memory was 54.5 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 30.1 MB in the beginning and 653.6 MB in the end (delta: -623.5 MB). Peak memory consumption was 409.3 MB. Max. memory is 16.1 GB. [2021-09-22 14:38:21,814 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 54.5 MB. Free memory was 37.0 MB in the beginning and 36.9 MB in the end (delta: 38.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-09-22 14:38:21,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 457.81 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 29.9 MB in the beginning and 37.3 MB in the end (delta: -7.4 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. [2021-09-22 14:38:21,814 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.38 ms. Allocated memory is still 67.1 MB. Free memory was 37.1 MB in the beginning and 34.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-09-22 14:38:21,814 INFO L168 Benchmark]: Boogie Preprocessor took 52.46 ms. Allocated memory is still 67.1 MB. Free memory was 34.6 MB in the beginning and 45.9 MB in the end (delta: -11.3 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.1 GB. [2021-09-22 14:38:21,815 INFO L168 Benchmark]: RCFGBuilder took 1412.45 ms. Allocated memory was 67.1 MB in the beginning and 81.8 MB in the end (delta: 14.7 MB). Free memory was 45.9 MB in the beginning and 41.3 MB in the end (delta: 4.5 MB). Peak memory consumption was 29.8 MB. Max. memory is 16.1 GB. [2021-09-22 14:38:21,815 INFO L168 Benchmark]: TraceAbstraction took 9734.67 ms. Allocated memory was 81.8 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 40.9 MB in the beginning and 680.8 MB in the end (delta: -640.0 MB). Peak memory consumption was 364.5 MB. Max. memory is 16.1 GB. [2021-09-22 14:38:21,815 INFO L168 Benchmark]: Witness Printer took 79.89 ms. Allocated memory is still 1.1 GB. Free memory was 680.8 MB in the beginning and 653.6 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2021-09-22 14:38:21,816 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 54.5 MB. Free memory was 37.0 MB in the beginning and 36.9 MB in the end (delta: 38.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 457.81 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 29.9 MB in the beginning and 37.3 MB in the end (delta: -7.4 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 33.38 ms. Allocated memory is still 67.1 MB. Free memory was 37.1 MB in the beginning and 34.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 52.46 ms. Allocated memory is still 67.1 MB. Free memory was 34.6 MB in the beginning and 45.9 MB in the end (delta: -11.3 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1412.45 ms. Allocated memory was 67.1 MB in the beginning and 81.8 MB in the end (delta: 14.7 MB). Free memory was 45.9 MB in the beginning and 41.3 MB in the end (delta: 4.5 MB). Peak memory consumption was 29.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9734.67 ms. Allocated memory was 81.8 MB in the beginning and 1.1 GB in the end (delta: 1.0 GB). Free memory was 40.9 MB in the beginning and 680.8 MB in the end (delta: -640.0 MB). Peak memory consumption was 364.5 MB. Max. memory is 16.1 GB. * Witness Printer took 79.89 ms. Allocated memory is still 1.1 GB. Free memory was 680.8 MB in the beginning and 653.6 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4520.9ms, 143 PlacesBefore, 49 PlacesAfterwards, 132 TransitionsBefore, 37 TransitionsAfterwards, 3224 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 9632 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3914, positive: 3667, positive conditional: 0, positive unconditional: 3667, negative: 247, negative conditional: 0, negative unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2119, positive: 2060, positive conditional: 0, positive unconditional: 2060, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2119, positive: 2036, positive conditional: 0, positive unconditional: 2036, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 83, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 244, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 225, negative conditional: 0, negative unconditional: 225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3914, positive: 1607, positive conditional: 0, positive unconditional: 1607, negative: 188, negative conditional: 0, negative unconditional: 188, unknown: 2119, unknown conditional: 0, unknown unconditional: 2119] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 210, Positive conditional cache size: 0, Positive unconditional cache size: 210, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool a$flush_delayed; [L724] 0 int a$mem_tmp; [L725] 0 _Bool a$r_buff0_thd0; [L726] 0 _Bool a$r_buff0_thd1; [L727] 0 _Bool a$r_buff0_thd2; [L728] 0 _Bool a$r_buff0_thd3; [L729] 0 _Bool a$r_buff0_thd4; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$r_buff1_thd4; [L735] 0 _Bool a$read_delayed; [L736] 0 int *a$read_delayed_var; [L737] 0 int a$w_buff0; [L738] 0 _Bool a$w_buff0_used; [L739] 0 int a$w_buff1; [L740] 0 _Bool a$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t177; [L872] FCALL, FORK 0 pthread_create(&t177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t178; [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L874] FCALL, FORK 0 pthread_create(&t178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t179; [L876] FCALL, FORK 0 pthread_create(&t179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t180; [L878] FCALL, FORK 0 pthread_create(&t180, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L790] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L792] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L794] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L807] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L817] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L827] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L770] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L772] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L774] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L884] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L885] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L886] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L887] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L888] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 9509.6ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 75.9ms, AutomataDifference: 1547.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4715.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 630 SDtfs, 830 SDslu, 1438 SDs, 0 SdLazy, 495 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 455.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 331.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=6349occurred in iteration=2, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1571.4ms AutomataMinimizationTime, 13 MinimizatonAttempts, 4567 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 39.1ms SsaConstructionTime, 432.7ms SatisfiabilityAnalysisTime, 853.6ms InterpolantComputationTime, 286 NumberOfCodeBlocks, 286 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 243 ConstructedInterpolants, 0 QuantifiedInterpolants, 1673 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-09-22 14:38:21,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...