./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix037_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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/mix037_tso.opt.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 c22735bb665974dfaaf4e2a506cab3c2b92703fd .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-20ed64e [2021-08-26 14:30:46,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 14:30:46,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 14:30:46,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 14:30:46,436 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 14:30:46,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 14:30:46,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 14:30:46,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 14:30:46,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 14:30:46,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 14:30:46,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 14:30:46,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 14:30:46,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 14:30:46,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 14:30:46,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 14:30:46,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 14:30:46,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 14:30:46,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 14:30:46,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 14:30:46,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 14:30:46,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 14:30:46,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 14:30:46,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 14:30:46,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 14:30:46,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 14:30:46,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 14:30:46,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 14:30:46,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 14:30:46,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 14:30:46,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 14:30:46,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 14:30:46,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 14:30:46,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 14:30:46,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 14:30:46,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 14:30:46,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 14:30:46,487 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 14:30:46,487 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 14:30:46,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 14:30:46,488 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 14:30:46,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 14:30:46,492 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 14:30:46,520 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 14:30:46,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 14:30:46,521 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 14:30:46,521 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 14:30:46,523 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 14:30:46,523 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 14:30:46,523 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 14:30:46,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 14:30:46,524 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 14:30:46,524 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 14:30:46,524 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 14:30:46,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 14:30:46,525 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 14:30:46,525 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 14:30:46,525 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 14:30:46,525 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 14:30:46,525 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 14:30:46,526 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 14:30:46,526 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 14:30:46,526 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 14:30:46,526 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 14:30:46,526 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 14:30:46,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 14:30:46,527 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 14:30:46,527 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 14:30:46,527 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 14:30:46,527 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 14:30:46,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 14:30:46,527 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 14:30:46,527 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 14:30:46,528 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 -> c22735bb665974dfaaf4e2a506cab3c2b92703fd [2021-08-26 14:30:46,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 14:30:46,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 14:30:46,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 14:30:46,802 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 14:30:46,802 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 14:30:46,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix037_tso.opt.i [2021-08-26 14:30:46,867 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84bc7dadd/052466c27767435299e1b2641cbb3c5e/FLAG75e528bd4 [2021-08-26 14:30:47,233 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 14:30:47,237 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix037_tso.opt.i [2021-08-26 14:30:47,251 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84bc7dadd/052466c27767435299e1b2641cbb3c5e/FLAG75e528bd4 [2021-08-26 14:30:47,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84bc7dadd/052466c27767435299e1b2641cbb3c5e [2021-08-26 14:30:47,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 14:30:47,611 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 14:30:47,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 14:30:47,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 14:30:47,630 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 14:30:47,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:30:47" (1/1) ... [2021-08-26 14:30:47,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76de0312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:30:47, skipping insertion in model container [2021-08-26 14:30:47,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:30:47" (1/1) ... [2021-08-26 14:30:47,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 14:30:47,667 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 14:30:47,757 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/mix037_tso.opt.i[948,961] [2021-08-26 14:30:47,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 14:30:47,927 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 14:30:47,938 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/mix037_tso.opt.i[948,961] [2021-08-26 14:30:47,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 14:30:47,997 INFO L208 MainTranslator]: Completed translation [2021-08-26 14:30:47,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:30:47 WrapperNode [2021-08-26 14:30:47,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 14:30:47,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 14:30:48,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 14:30:48,000 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 14:30:48,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:30:47" (1/1) ... [2021-08-26 14:30:48,019 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:30:47" (1/1) ... [2021-08-26 14:30:48,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 14:30:48,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 14:30:48,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 14:30:48,047 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 14:30:48,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:30:47" (1/1) ... [2021-08-26 14:30:48,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:30:47" (1/1) ... [2021-08-26 14:30:48,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:30:47" (1/1) ... [2021-08-26 14:30:48,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:30:47" (1/1) ... [2021-08-26 14:30:48,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:30:47" (1/1) ... [2021-08-26 14:30:48,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:30:47" (1/1) ... [2021-08-26 14:30:48,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:30:47" (1/1) ... [2021-08-26 14:30:48,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 14:30:48,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 14:30:48,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 14:30:48,088 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 14:30:48,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:30:47" (1/1) ... [2021-08-26 14:30:48,104 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 14:30:48,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 14:30:48,116 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-08-26 14:30:48,120 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-08-26 14:30:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-26 14:30:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-26 14:30:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 14:30:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 14:30:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-26 14:30:48,144 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-26 14:30:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-26 14:30:48,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-26 14:30:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-26 14:30:48,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-26 14:30:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-08-26 14:30:48,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-08-26 14:30:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 14:30:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-26 14:30:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 14:30:48,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 14:30:48,147 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-26 14:30:49,362 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 14:30:49,362 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-26 14:30:49,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:30:49 BoogieIcfgContainer [2021-08-26 14:30:49,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 14:30:49,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 14:30:49,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 14:30:49,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 14:30:49,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 02:30:47" (1/3) ... [2021-08-26 14:30:49,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c60829e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:30:49, skipping insertion in model container [2021-08-26 14:30:49,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:30:47" (2/3) ... [2021-08-26 14:30:49,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c60829e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:30:49, skipping insertion in model container [2021-08-26 14:30:49,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:30:49" (3/3) ... [2021-08-26 14:30:49,369 INFO L111 eAbstractionObserver]: Analyzing ICFG mix037_tso.opt.i [2021-08-26 14:30:49,372 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-26 14:30:49,372 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 14:30:49,373 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-26 14:30:49,373 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-26 14:30:49,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,399 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,399 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,399 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,399 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,401 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,401 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,401 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,401 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,402 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,402 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,403 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,403 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,409 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,410 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,411 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,412 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,413 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,415 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,415 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,416 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,416 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,416 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,416 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,416 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,417 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,417 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,417 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,418 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,418 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,418 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,418 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,418 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,418 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,418 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,419 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,420 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,423 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,424 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,424 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,425 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,428 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,428 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,429 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,429 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,430 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,431 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,431 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:30:49,432 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-26 14:30:49,459 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 14:30:49,463 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-08-26 14:30:49,463 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-26 14:30:49,472 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-08-26 14:30:49,478 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 278 flow [2021-08-26 14:30:49,493 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 278 flow [2021-08-26 14:30:49,494 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2021-08-26 14:30:49,540 INFO L129 PetriNetUnfolder]: 2/125 cut-off events. [2021-08-26 14:30:49,541 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-26 14:30:49,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2021-08-26 14:30:49,548 INFO L116 LiptonReduction]: Number of co-enabled transitions 2760 [2021-08-26 14:30:54,809 INFO L131 LiptonReduction]: Checked pairs total: 6820 [2021-08-26 14:30:54,809 INFO L133 LiptonReduction]: Total number of compositions: 111 [2021-08-26 14:30:54,814 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 32 transitions, 84 flow [2021-08-26 14:30:54,875 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2090 states, 2087 states have (on average 3.8485864877815046) internal successors, (8032), 2089 states have internal predecessors, (8032), 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-08-26 14:30:54,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 2090 states, 2087 states have (on average 3.8485864877815046) internal successors, (8032), 2089 states have internal predecessors, (8032), 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-08-26 14:30:54,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-26 14:30:54,886 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:30:54,887 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:30:54,887 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-26 14:30:54,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:30:54,890 INFO L82 PathProgramCache]: Analyzing trace with hash -942337251, now seen corresponding path program 1 times [2021-08-26 14:30:54,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:30:54,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106558701] [2021-08-26 14:30:54,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:30:54,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:30:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:30:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:30:55,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:30:55,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106558701] [2021-08-26 14:30:55,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106558701] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:30:55,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:30:55,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-26 14:30:55,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314571168] [2021-08-26 14:30:55,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 14:30:55,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:30:55,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 14:30:55,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:30:55,098 INFO L87 Difference]: Start difference. First operand has 2090 states, 2087 states have (on average 3.8485864877815046) internal successors, (8032), 2089 states have internal predecessors, (8032), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-08-26 14:30:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:30:55,176 INFO L93 Difference]: Finished difference Result 1770 states and 6608 transitions. [2021-08-26 14:30:55,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 14:30:55,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2021-08-26 14:30:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:30:55,212 INFO L225 Difference]: With dead ends: 1770 [2021-08-26 14:30:55,212 INFO L226 Difference]: Without dead ends: 1706 [2021-08-26 14:30:55,213 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:30:55,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2021-08-26 14:30:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1706. [2021-08-26 14:30:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1705 states have (on average 3.7536656891495603) internal successors, (6400), 1705 states have internal predecessors, (6400), 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-08-26 14:30:55,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 6400 transitions. [2021-08-26 14:30:55,307 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 6400 transitions. Word has length 9 [2021-08-26 14:30:55,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:30:55,308 INFO L470 AbstractCegarLoop]: Abstraction has 1706 states and 6400 transitions. [2021-08-26 14:30:55,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-08-26 14:30:55,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 6400 transitions. [2021-08-26 14:30:55,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 14:30:55,310 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:30:55,310 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:30:55,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 14:30:55,310 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-26 14:30:55,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:30:55,311 INFO L82 PathProgramCache]: Analyzing trace with hash 652077014, now seen corresponding path program 1 times [2021-08-26 14:30:55,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:30:55,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987719191] [2021-08-26 14:30:55,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:30:55,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:30:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:30:55,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-08-26 14:30:55,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:30:55,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987719191] [2021-08-26 14:30:55,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987719191] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:30:55,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:30:55,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-26 14:30:55,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238288385] [2021-08-26 14:30:55,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 14:30:55,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:30:55,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 14:30:55,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:30:55,408 INFO L87 Difference]: Start difference. First operand 1706 states and 6400 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-08-26 14:30:55,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:30:55,438 INFO L93 Difference]: Finished difference Result 2494 states and 8946 transitions. [2021-08-26 14:30:55,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 14:30:55,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2021-08-26 14:30:55,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:30:55,451 INFO L225 Difference]: With dead ends: 2494 [2021-08-26 14:30:55,451 INFO L226 Difference]: Without dead ends: 2422 [2021-08-26 14:30:55,452 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:30:55,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2021-08-26 14:30:55,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2238. [2021-08-26 14:30:55,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2238 states, 2237 states have (on average 3.6611533303531516) internal successors, (8190), 2237 states have internal predecessors, (8190), 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-08-26 14:30:55,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 8190 transitions. [2021-08-26 14:30:55,553 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 8190 transitions. Word has length 11 [2021-08-26 14:30:55,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:30:55,553 INFO L470 AbstractCegarLoop]: Abstraction has 2238 states and 8190 transitions. [2021-08-26 14:30:55,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-08-26 14:30:55,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 8190 transitions. [2021-08-26 14:30:55,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 14:30:55,555 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:30:55,555 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:30:55,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 14:30:55,556 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-26 14:30:55,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:30:55,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1260449847, now seen corresponding path program 1 times [2021-08-26 14:30:55,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:30:55,562 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190562642] [2021-08-26 14:30:55,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:30:55,563 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:30:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:30:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:30:55,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:30:55,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190562642] [2021-08-26 14:30:55,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190562642] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:30:55,667 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:30:55,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 14:30:55,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140533966] [2021-08-26 14:30:55,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:30:55,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:30:55,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:30:55,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:30:55,669 INFO L87 Difference]: Start difference. First operand 2238 states and 8190 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-08-26 14:30:55,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:30:55,711 INFO L93 Difference]: Finished difference Result 2254 states and 8074 transitions. [2021-08-26 14:30:55,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 14:30:55,712 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-08-26 14:30:55,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:30:55,723 INFO L225 Difference]: With dead ends: 2254 [2021-08-26 14:30:55,723 INFO L226 Difference]: Without dead ends: 2254 [2021-08-26 14:30:55,724 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:30:55,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2021-08-26 14:30:55,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 1890. [2021-08-26 14:30:55,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1889 states have (on average 3.667548967707782) internal successors, (6928), 1889 states have internal predecessors, (6928), 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-08-26 14:30:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 6928 transitions. [2021-08-26 14:30:55,773 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 6928 transitions. Word has length 12 [2021-08-26 14:30:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:30:55,773 INFO L470 AbstractCegarLoop]: Abstraction has 1890 states and 6928 transitions. [2021-08-26 14:30:55,773 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-08-26 14:30:55,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 6928 transitions. [2021-08-26 14:30:55,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 14:30:55,776 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:30:55,776 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:30:55,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 14:30:55,776 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-26 14:30:55,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:30:55,777 INFO L82 PathProgramCache]: Analyzing trace with hash -419343686, now seen corresponding path program 1 times [2021-08-26 14:30:55,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:30:55,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975836872] [2021-08-26 14:30:55,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:30:55,778 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:30:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:30:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:30:55,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:30:55,881 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975836872] [2021-08-26 14:30:55,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975836872] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:30:55,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:30:55,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 14:30:55,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529096555] [2021-08-26 14:30:55,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:30:55,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:30:55,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:30:55,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:30:55,886 INFO L87 Difference]: Start difference. First operand 1890 states and 6928 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-08-26 14:30:55,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:30:55,921 INFO L93 Difference]: Finished difference Result 2190 states and 7834 transitions. [2021-08-26 14:30:55,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 14:30:55,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-08-26 14:30:55,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:30:55,933 INFO L225 Difference]: With dead ends: 2190 [2021-08-26 14:30:55,933 INFO L226 Difference]: Without dead ends: 2190 [2021-08-26 14:30:55,934 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:30:55,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2021-08-26 14:30:56,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 1858. [2021-08-26 14:30:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1857 states have (on average 3.6532040926225093) internal successors, (6784), 1857 states have internal predecessors, (6784), 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-08-26 14:30:56,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 6784 transitions. [2021-08-26 14:30:56,032 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 6784 transitions. Word has length 13 [2021-08-26 14:30:56,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:30:56,032 INFO L470 AbstractCegarLoop]: Abstraction has 1858 states and 6784 transitions. [2021-08-26 14:30:56,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-08-26 14:30:56,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 6784 transitions. [2021-08-26 14:30:56,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 14:30:56,035 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:30:56,035 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:30:56,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 14:30:56,035 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-26 14:30:56,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:30:56,036 INFO L82 PathProgramCache]: Analyzing trace with hash -114753179, now seen corresponding path program 1 times [2021-08-26 14:30:56,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:30:56,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570400758] [2021-08-26 14:30:56,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:30:56,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:30:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:30:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:30:56,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:30:56,109 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570400758] [2021-08-26 14:30:56,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570400758] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:30:56,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:30:56,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:30:56,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679057997] [2021-08-26 14:30:56,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:30:56,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:30:56,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:30:56,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:30:56,112 INFO L87 Difference]: Start difference. First operand 1858 states and 6784 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-08-26 14:30:56,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:30:56,150 INFO L93 Difference]: Finished difference Result 1963 states and 6505 transitions. [2021-08-26 14:30:56,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:30:56,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-08-26 14:30:56,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:30:56,157 INFO L225 Difference]: With dead ends: 1963 [2021-08-26 14:30:56,157 INFO L226 Difference]: Without dead ends: 1475 [2021-08-26 14:30:56,157 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:30:56,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2021-08-26 14:30:56,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1475. [2021-08-26 14:30:56,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1474 states have (on average 3.3059701492537314) internal successors, (4873), 1474 states have internal predecessors, (4873), 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-08-26 14:30:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 4873 transitions. [2021-08-26 14:30:56,188 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 4873 transitions. Word has length 14 [2021-08-26 14:30:56,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:30:56,188 INFO L470 AbstractCegarLoop]: Abstraction has 1475 states and 4873 transitions. [2021-08-26 14:30:56,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-08-26 14:30:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 4873 transitions. [2021-08-26 14:30:56,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 14:30:56,190 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:30:56,190 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:30:56,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 14:30:56,190 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-26 14:30:56,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:30:56,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1083802310, now seen corresponding path program 1 times [2021-08-26 14:30:56,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:30:56,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575826076] [2021-08-26 14:30:56,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:30:56,191 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:30:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:30:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:30:56,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:30:56,233 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575826076] [2021-08-26 14:30:56,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575826076] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:30:56,234 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:30:56,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 14:30:56,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547805544] [2021-08-26 14:30:56,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 14:30:56,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:30:56,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 14:30:56,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:30:56,235 INFO L87 Difference]: Start difference. First operand 1475 states and 4873 transitions. Second operand has 3 states, 2 states have (on average 8.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-08-26 14:30:56,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:30:56,249 INFO L93 Difference]: Finished difference Result 1944 states and 6262 transitions. [2021-08-26 14:30:56,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 14:30:56,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.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-08-26 14:30:56,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:30:56,255 INFO L225 Difference]: With dead ends: 1944 [2021-08-26 14:30:56,255 INFO L226 Difference]: Without dead ends: 1328 [2021-08-26 14:30:56,255 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:30:56,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2021-08-26 14:30:56,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1190. [2021-08-26 14:30:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1189 states have (on average 3.1774600504625736) internal successors, (3778), 1189 states have internal predecessors, (3778), 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-08-26 14:30:56,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 3778 transitions. [2021-08-26 14:30:56,278 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 3778 transitions. Word has length 16 [2021-08-26 14:30:56,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:30:56,278 INFO L470 AbstractCegarLoop]: Abstraction has 1190 states and 3778 transitions. [2021-08-26 14:30:56,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.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-08-26 14:30:56,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 3778 transitions. [2021-08-26 14:30:56,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 14:30:56,280 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:30:56,280 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:30:56,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 14:30:56,280 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-26 14:30:56,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:30:56,280 INFO L82 PathProgramCache]: Analyzing trace with hash 724907716, now seen corresponding path program 1 times [2021-08-26 14:30:56,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:30:56,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571303098] [2021-08-26 14:30:56,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:30:56,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:30:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:30:56,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:30:56,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:30:56,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571303098] [2021-08-26 14:30:56,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571303098] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:30:56,337 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:30:56,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 14:30:56,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325383754] [2021-08-26 14:30:56,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 14:30:56,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:30:56,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 14:30:56,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:30:56,338 INFO L87 Difference]: Start difference. First operand 1190 states and 3778 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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-08-26 14:30:56,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:30:56,377 INFO L93 Difference]: Finished difference Result 1034 states and 2984 transitions. [2021-08-26 14:30:56,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 14:30:56,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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-08-26 14:30:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:30:56,381 INFO L225 Difference]: With dead ends: 1034 [2021-08-26 14:30:56,381 INFO L226 Difference]: Without dead ends: 785 [2021-08-26 14:30:56,381 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.7ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:30:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2021-08-26 14:30:56,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2021-08-26 14:30:56,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 784 states have (on average 2.8316326530612246) internal successors, (2220), 784 states have internal predecessors, (2220), 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-08-26 14:30:56,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 2220 transitions. [2021-08-26 14:30:56,396 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 2220 transitions. Word has length 16 [2021-08-26 14:30:56,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:30:56,396 INFO L470 AbstractCegarLoop]: Abstraction has 785 states and 2220 transitions. [2021-08-26 14:30:56,397 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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-08-26 14:30:56,397 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 2220 transitions. [2021-08-26 14:30:56,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-26 14:30:56,398 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:30:56,398 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-08-26 14:30:56,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 14:30:56,398 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-26 14:30:56,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:30:56,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1342307396, now seen corresponding path program 1 times [2021-08-26 14:30:56,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:30:56,399 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880997333] [2021-08-26 14:30:56,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:30:56,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:30:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:30:56,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:30:56,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:30:56,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880997333] [2021-08-26 14:30:56,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880997333] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:30:56,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:30:56,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 14:30:56,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063262784] [2021-08-26 14:30:56,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 14:30:56,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:30:56,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 14:30:56,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:30:56,477 INFO L87 Difference]: Start difference. First operand 785 states and 2220 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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-08-26 14:30:56,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:30:56,520 INFO L93 Difference]: Finished difference Result 683 states and 1892 transitions. [2021-08-26 14:30:56,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 14:30:56,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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-08-26 14:30:56,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:30:56,523 INFO L225 Difference]: With dead ends: 683 [2021-08-26 14:30:56,523 INFO L226 Difference]: Without dead ends: 596 [2021-08-26 14:30:56,523 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 16.8ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:30:56,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-08-26 14:30:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2021-08-26 14:30:56,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 2.8117647058823527) internal successors, (1673), 595 states have internal predecessors, (1673), 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-08-26 14:30:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1673 transitions. [2021-08-26 14:30:56,535 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1673 transitions. Word has length 19 [2021-08-26 14:30:56,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:30:56,535 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 1673 transitions. [2021-08-26 14:30:56,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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-08-26 14:30:56,535 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1673 transitions. [2021-08-26 14:30:56,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-26 14:30:56,536 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:30:56,536 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-08-26 14:30:56,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 14:30:56,537 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-26 14:30:56,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:30:56,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1933112590, now seen corresponding path program 1 times [2021-08-26 14:30:56,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:30:56,540 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405842891] [2021-08-26 14:30:56,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:30:56,540 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:30:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:30:56,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:30:56,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:30:56,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405842891] [2021-08-26 14:30:56,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405842891] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:30:56,626 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:30:56,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 14:30:56,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632758747] [2021-08-26 14:30:56,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 14:30:56,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:30:56,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 14:30:56,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:30:56,628 INFO L87 Difference]: Start difference. First operand 596 states and 1673 transitions. Second operand has 5 states, 4 states have (on average 5.5) 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-08-26 14:30:56,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:30:56,664 INFO L93 Difference]: Finished difference Result 805 states and 2198 transitions. [2021-08-26 14:30:56,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 14:30:56,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) 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-08-26 14:30:56,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:30:56,672 INFO L225 Difference]: With dead ends: 805 [2021-08-26 14:30:56,672 INFO L226 Difference]: Without dead ends: 573 [2021-08-26 14:30:56,673 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.6ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:30:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2021-08-26 14:30:56,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 530. [2021-08-26 14:30:56,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 2.6313799621928164) internal successors, (1392), 529 states have internal predecessors, (1392), 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-08-26 14:30:56,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1392 transitions. [2021-08-26 14:30:56,681 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1392 transitions. Word has length 22 [2021-08-26 14:30:56,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:30:56,683 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 1392 transitions. [2021-08-26 14:30:56,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) 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-08-26 14:30:56,683 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1392 transitions. [2021-08-26 14:30:56,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-26 14:30:56,684 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:30:56,684 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-08-26 14:30:56,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 14:30:56,684 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-26 14:30:56,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:30:56,685 INFO L82 PathProgramCache]: Analyzing trace with hash -483155948, now seen corresponding path program 1 times [2021-08-26 14:30:56,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:30:56,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998588707] [2021-08-26 14:30:56,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:30:56,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:30:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:30:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:30:56,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:30:56,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998588707] [2021-08-26 14:30:56,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998588707] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:30:56,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:30:56,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:30:56,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361167331] [2021-08-26 14:30:56,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:30:56,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:30:56,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:30:56,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:30:56,744 INFO L87 Difference]: Start difference. First operand 530 states and 1392 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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-08-26 14:30:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:30:56,765 INFO L93 Difference]: Finished difference Result 718 states and 1816 transitions. [2021-08-26 14:30:56,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 14:30:56,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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-08-26 14:30:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:30:56,767 INFO L225 Difference]: With dead ends: 718 [2021-08-26 14:30:56,767 INFO L226 Difference]: Without dead ends: 424 [2021-08-26 14:30:56,768 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:30:56,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2021-08-26 14:30:56,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 422. [2021-08-26 14:30:56,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 2.332541567695962) internal successors, (982), 421 states have internal predecessors, (982), 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-08-26 14:30:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 982 transitions. [2021-08-26 14:30:56,775 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 982 transitions. Word has length 22 [2021-08-26 14:30:56,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:30:56,775 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 982 transitions. [2021-08-26 14:30:56,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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-08-26 14:30:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 982 transitions. [2021-08-26 14:30:56,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-26 14:30:56,777 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:30:56,777 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-08-26 14:30:56,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 14:30:56,777 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-26 14:30:56,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:30:56,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1438454928, now seen corresponding path program 2 times [2021-08-26 14:30:56,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:30:56,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56649610] [2021-08-26 14:30:56,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:30:56,778 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:30:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:30:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:30:56,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:30:56,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56649610] [2021-08-26 14:30:56,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56649610] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:30:56,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:30:56,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 14:30:56,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565836868] [2021-08-26 14:30:56,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 14:30:56,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:30:56,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 14:30:56,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:30:56,843 INFO L87 Difference]: Start difference. First operand 422 states and 982 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 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-08-26 14:30:56,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:30:56,886 INFO L93 Difference]: Finished difference Result 398 states and 935 transitions. [2021-08-26 14:30:56,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 14:30:56,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 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-08-26 14:30:56,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:30:56,888 INFO L225 Difference]: With dead ends: 398 [2021-08-26 14:30:56,888 INFO L226 Difference]: Without dead ends: 80 [2021-08-26 14:30:56,888 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 20.7ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-08-26 14:30:56,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-08-26 14:30:56,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-08-26 14:30:56,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 2.1012658227848102) internal successors, (166), 79 states have internal predecessors, (166), 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-08-26 14:30:56,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 166 transitions. [2021-08-26 14:30:56,890 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 166 transitions. Word has length 22 [2021-08-26 14:30:56,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:30:56,890 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 166 transitions. [2021-08-26 14:30:56,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 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-08-26 14:30:56,891 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 166 transitions. [2021-08-26 14:30:56,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-26 14:30:56,891 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:30:56,891 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] [2021-08-26 14:30:56,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 14:30:56,892 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-26 14:30:56,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:30:56,892 INFO L82 PathProgramCache]: Analyzing trace with hash 565545376, now seen corresponding path program 1 times [2021-08-26 14:30:56,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:30:56,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025341385] [2021-08-26 14:30:56,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:30:56,893 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:30:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:30:56,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:30:56,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:30:56,991 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025341385] [2021-08-26 14:30:56,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025341385] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:30:56,992 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:30:56,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 14:30:56,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715041419] [2021-08-26 14:30:56,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 14:30:56,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:30:56,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 14:30:56,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:30:56,993 INFO L87 Difference]: Start difference. First operand 80 states and 166 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-08-26 14:30:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:30:57,037 INFO L93 Difference]: Finished difference Result 98 states and 200 transitions. [2021-08-26 14:30:57,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 14:30:57,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2021-08-26 14:30:57,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:30:57,038 INFO L225 Difference]: With dead ends: 98 [2021-08-26 14:30:57,038 INFO L226 Difference]: Without dead ends: 52 [2021-08-26 14:30:57,039 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 34.8ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-08-26 14:30:57,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-08-26 14:30:57,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-08-26 14:30:57,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.7647058823529411) internal successors, (90), 51 states have internal predecessors, (90), 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-08-26 14:30:57,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 90 transitions. [2021-08-26 14:30:57,040 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 90 transitions. Word has length 25 [2021-08-26 14:30:57,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:30:57,040 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 90 transitions. [2021-08-26 14:30:57,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-08-26 14:30:57,041 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 90 transitions. [2021-08-26 14:30:57,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-26 14:30:57,041 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:30:57,041 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] [2021-08-26 14:30:57,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 14:30:57,042 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-26 14:30:57,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:30:57,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1302178906, now seen corresponding path program 2 times [2021-08-26 14:30:57,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:30:57,043 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843492036] [2021-08-26 14:30:57,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:30:57,043 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:30:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 14:30:57,067 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 14:30:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 14:30:57,131 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 14:30:57,131 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 14:30:57,132 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:30:57,133 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:30:57,135 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-26 14:30:57,135 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-26 14:30:57,135 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-26 14:30:57,135 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION [2021-08-26 14:30:57,136 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:30:57,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 14:30:57,140 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-26 14:30:57,140 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 14:30:57,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 02:30:57 BasicIcfg [2021-08-26 14:30:57,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 14:30:57,235 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 14:30:57,235 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 14:30:57,235 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 14:30:57,236 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:30:49" (3/4) ... [2021-08-26 14:30:57,237 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-26 14:30:57,331 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 14:30:57,331 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 14:30:57,332 INFO L168 Benchmark]: Toolchain (without parser) took 9721.13 ms. Allocated memory was 62.9 MB in the beginning and 371.2 MB in the end (delta: 308.3 MB). Free memory was 41.5 MB in the beginning and 175.7 MB in the end (delta: -134.2 MB). Peak memory consumption was 173.2 MB. Max. memory is 16.1 GB. [2021-08-26 14:30:57,333 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 62.9 MB. Free memory was 44.4 MB in the beginning and 44.4 MB in the end (delta: 33.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 14:30:57,333 INFO L168 Benchmark]: CACSL2BoogieTranslator took 387.19 ms. Allocated memory is still 62.9 MB. Free memory was 41.3 MB in the beginning and 35.0 MB in the end (delta: 6.3 MB). Peak memory consumption was 14.6 MB. Max. memory is 16.1 GB. [2021-08-26 14:30:57,333 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.10 ms. Allocated memory is still 62.9 MB. Free memory was 35.0 MB in the beginning and 32.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 14:30:57,333 INFO L168 Benchmark]: Boogie Preprocessor took 40.56 ms. Allocated memory is still 62.9 MB. Free memory was 32.4 MB in the beginning and 30.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 14:30:57,334 INFO L168 Benchmark]: RCFGBuilder took 1275.79 ms. Allocated memory was 62.9 MB in the beginning and 94.4 MB in the end (delta: 31.5 MB). Free memory was 30.1 MB in the beginning and 56.5 MB in the end (delta: -26.4 MB). Peak memory consumption was 20.3 MB. Max. memory is 16.1 GB. [2021-08-26 14:30:57,334 INFO L168 Benchmark]: TraceAbstraction took 7869.92 ms. Allocated memory was 94.4 MB in the beginning and 371.2 MB in the end (delta: 276.8 MB). Free memory was 56.5 MB in the beginning and 197.7 MB in the end (delta: -141.2 MB). Peak memory consumption was 136.3 MB. Max. memory is 16.1 GB. [2021-08-26 14:30:57,334 INFO L168 Benchmark]: Witness Printer took 96.16 ms. Allocated memory is still 371.2 MB. Free memory was 197.7 MB in the beginning and 175.7 MB in the end (delta: 22.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-08-26 14:30:57,335 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 62.9 MB. Free memory was 44.4 MB in the beginning and 44.4 MB in the end (delta: 33.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 387.19 ms. Allocated memory is still 62.9 MB. Free memory was 41.3 MB in the beginning and 35.0 MB in the end (delta: 6.3 MB). Peak memory consumption was 14.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 47.10 ms. Allocated memory is still 62.9 MB. Free memory was 35.0 MB in the beginning and 32.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 40.56 ms. Allocated memory is still 62.9 MB. Free memory was 32.4 MB in the beginning and 30.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1275.79 ms. Allocated memory was 62.9 MB in the beginning and 94.4 MB in the end (delta: 31.5 MB). Free memory was 30.1 MB in the beginning and 56.5 MB in the end (delta: -26.4 MB). Peak memory consumption was 20.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7869.92 ms. Allocated memory was 94.4 MB in the beginning and 371.2 MB in the end (delta: 276.8 MB). Free memory was 56.5 MB in the beginning and 197.7 MB in the end (delta: -141.2 MB). Peak memory consumption was 136.3 MB. Max. memory is 16.1 GB. * Witness Printer took 96.16 ms. Allocated memory is still 371.2 MB. Free memory was 197.7 MB in the beginning and 175.7 MB in the end (delta: 22.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5316.1ms, 140 PlacesBefore, 44 PlacesAfterwards, 129 TransitionsBefore, 32 TransitionsAfterwards, 2760 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 111 TotalNumberOfCompositions, 6820 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3603, positive: 3406, positive conditional: 0, positive unconditional: 3406, negative: 197, negative conditional: 0, negative unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1976, positive: 1917, positive conditional: 0, positive unconditional: 1917, 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: 1976, positive: 1894, positive conditional: 0, positive unconditional: 1894, negative: 82, negative conditional: 0, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 82, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 284, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 249, negative conditional: 0, negative unconditional: 249, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3603, positive: 1489, positive conditional: 0, positive unconditional: 1489, negative: 138, negative conditional: 0, negative unconditional: 138, unknown: 1976, unknown conditional: 0, unknown unconditional: 1976] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 176, Positive conditional cache size: 0, Positive unconditional cache size: 176, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - 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_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t997; [L857] FCALL, FORK 0 pthread_create(&t997, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 pthread_t t998; [L859] FCALL, FORK 0 pthread_create(&t998, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t999; [L861] FCALL, FORK 0 pthread_create(&t999, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t1000; [L863] FCALL, FORK 0 pthread_create(&t1000, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L784] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L834] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L869] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L869] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L869] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L876] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 863]: 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: 859]: 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: 861]: 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: 857]: 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, 164 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 7680.4ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 26.3ms, AutomataDifference: 601.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5412.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 400 SDtfs, 480 SDslu, 573 SDs, 0 SdLazy, 213 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 188.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 152.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2238occurred in iteration=2, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 429.9ms AutomataMinimizationTime, 12 MinimizatonAttempts, 1063 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 30.1ms SsaConstructionTime, 251.3ms SatisfiabilityAnalysisTime, 663.7ms InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-08-26 14:30:57,369 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...