./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe008_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb179607-d473-444c-8b6c-48ce6441a649/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb179607-d473-444c-8b6c-48ce6441a649/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb179607-d473-444c-8b6c-48ce6441a649/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb179607-d473-444c-8b6c-48ce6441a649/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe008_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb179607-d473-444c-8b6c-48ce6441a649/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb179607-d473-444c-8b6c-48ce6441a649/bin/uautomizer-WNIpwEf4Nt --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 46c20ed9b9f447fdc623af9e24dc2c31d46dcc15 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-4e77c04 [2021-10-13 01:06:48,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 01:06:48,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 01:06:48,427 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 01:06:48,428 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 01:06:48,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 01:06:48,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 01:06:48,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 01:06:48,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 01:06:48,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 01:06:48,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 01:06:48,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 01:06:48,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 01:06:48,454 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 01:06:48,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 01:06:48,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 01:06:48,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 01:06:48,465 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 01:06:48,468 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 01:06:48,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 01:06:48,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 01:06:48,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 01:06:48,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 01:06:48,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 01:06:48,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 01:06:48,488 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 01:06:48,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 01:06:48,490 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 01:06:48,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 01:06:48,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 01:06:48,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 01:06:48,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 01:06:48,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 01:06:48,496 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 01:06:48,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 01:06:48,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 01:06:48,498 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 01:06:48,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 01:06:48,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 01:06:48,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 01:06:48,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 01:06:48,501 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb179607-d473-444c-8b6c-48ce6441a649/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 01:06:48,542 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 01:06:48,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 01:06:48,543 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 01:06:48,544 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 01:06:48,551 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 01:06:48,551 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 01:06:48,552 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 01:06:48,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 01:06:48,552 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 01:06:48,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 01:06:48,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 01:06:48,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 01:06:48,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 01:06:48,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 01:06:48,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 01:06:48,554 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 01:06:48,555 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 01:06:48,555 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 01:06:48,555 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 01:06:48,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 01:06:48,556 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 01:06:48,556 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 01:06:48,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:06:48,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 01:06:48,557 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 01:06:48,557 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 01:06:48,557 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 01:06:48,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 01:06:48,557 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 01:06:48,559 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 01:06:48,559 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb179607-d473-444c-8b6c-48ce6441a649/bin/uautomizer-WNIpwEf4Nt/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb179607-d473-444c-8b6c-48ce6441a649/bin/uautomizer-WNIpwEf4Nt 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 -> 46c20ed9b9f447fdc623af9e24dc2c31d46dcc15 [2021-10-13 01:06:48,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 01:06:48,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 01:06:48,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 01:06:48,902 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 01:06:48,903 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 01:06:48,903 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb179607-d473-444c-8b6c-48ce6441a649/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/pthread-wmm/safe008_power.oepc.i [2021-10-13 01:06:49,003 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb179607-d473-444c-8b6c-48ce6441a649/bin/uautomizer-WNIpwEf4Nt/data/b88aca7f0/91a98644e0084c2ca455c5526154dc36/FLAGcde817d80 [2021-10-13 01:06:49,524 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 01:06:49,524 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb179607-d473-444c-8b6c-48ce6441a649/sv-benchmarks/c/pthread-wmm/safe008_power.oepc.i [2021-10-13 01:06:49,554 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb179607-d473-444c-8b6c-48ce6441a649/bin/uautomizer-WNIpwEf4Nt/data/b88aca7f0/91a98644e0084c2ca455c5526154dc36/FLAGcde817d80 [2021-10-13 01:06:49,973 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb179607-d473-444c-8b6c-48ce6441a649/bin/uautomizer-WNIpwEf4Nt/data/b88aca7f0/91a98644e0084c2ca455c5526154dc36 [2021-10-13 01:06:49,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 01:06:49,985 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 01:06:49,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 01:06:49,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 01:06:49,997 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 01:06:49,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:06:49" (1/1) ... [2021-10-13 01:06:49,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59982bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:49, skipping insertion in model container [2021-10-13 01:06:49,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:06:49" (1/1) ... [2021-10-13 01:06:50,010 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 01:06:50,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 01:06:50,273 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb179607-d473-444c-8b6c-48ce6441a649/sv-benchmarks/c/pthread-wmm/safe008_power.oepc.i[952,965] [2021-10-13 01:06:50,492 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:06:50,500 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 01:06:50,519 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb179607-d473-444c-8b6c-48ce6441a649/sv-benchmarks/c/pthread-wmm/safe008_power.oepc.i[952,965] [2021-10-13 01:06:50,586 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:06:50,635 INFO L208 MainTranslator]: Completed translation [2021-10-13 01:06:50,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:50 WrapperNode [2021-10-13 01:06:50,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 01:06:50,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 01:06:50,639 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 01:06:50,639 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 01:06:50,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:50" (1/1) ... [2021-10-13 01:06:50,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:50" (1/1) ... [2021-10-13 01:06:50,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 01:06:50,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 01:06:50,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 01:06:50,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 01:06:50,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:50" (1/1) ... [2021-10-13 01:06:50,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:50" (1/1) ... [2021-10-13 01:06:50,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:50" (1/1) ... [2021-10-13 01:06:50,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:50" (1/1) ... [2021-10-13 01:06:50,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:50" (1/1) ... [2021-10-13 01:06:50,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:50" (1/1) ... [2021-10-13 01:06:50,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:50" (1/1) ... [2021-10-13 01:06:50,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 01:06:50,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 01:06:50,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 01:06:50,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 01:06:50,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:50" (1/1) ... [2021-10-13 01:06:50,825 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:06:50,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb179607-d473-444c-8b6c-48ce6441a649/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:06:50,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb179607-d473-444c-8b6c-48ce6441a649/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 01:06:50,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb179607-d473-444c-8b6c-48ce6441a649/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 01:06:50,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 01:06:50,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-13 01:06:50,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 01:06:50,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 01:06:50,903 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-13 01:06:50,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-13 01:06:50,904 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-13 01:06:50,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-13 01:06:50,904 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-13 01:06:50,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-13 01:06:50,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 01:06:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-13 01:06:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 01:06:50,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 01:06:50,907 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-13 01:06:52,879 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 01:06:52,879 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-13 01:06:52,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:06:52 BoogieIcfgContainer [2021-10-13 01:06:52,883 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 01:06:52,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 01:06:52,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 01:06:52,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 01:06:52,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:06:49" (1/3) ... [2021-10-13 01:06:52,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511ab1cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:06:52, skipping insertion in model container [2021-10-13 01:06:52,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:50" (2/3) ... [2021-10-13 01:06:52,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511ab1cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:06:52, skipping insertion in model container [2021-10-13 01:06:52,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:06:52" (3/3) ... [2021-10-13 01:06:52,894 INFO L111 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc.i [2021-10-13 01:06:52,899 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-13 01:06:52,900 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 01:06:52,900 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-13 01:06:52,900 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-13 01:06:52,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,940 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,940 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,941 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,941 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,941 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,942 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,942 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,943 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,944 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,945 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,945 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,945 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,945 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,950 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,950 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,950 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,950 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,950 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,950 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,955 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,955 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,955 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,956 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,956 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,975 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,975 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,976 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,982 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,983 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,984 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,984 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,984 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,984 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,986 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,986 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 01:06:52,989 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-13 01:06:53,038 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 01:06:53,050 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-10-13 01:06:53,050 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-10-13 01:06:53,079 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-13 01:06:53,089 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 229 flow [2021-10-13 01:06:53,092 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 229 flow [2021-10-13 01:06:53,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2021-10-13 01:06:53,149 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2021-10-13 01:06:53,149 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-13 01:06:53,153 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-10-13 01:06:53,156 INFO L116 LiptonReduction]: Number of co-enabled transitions 1876 [2021-10-13 01:06:58,116 INFO L131 LiptonReduction]: Checked pairs total: 5228 [2021-10-13 01:06:58,116 INFO L133 LiptonReduction]: Total number of compositions: 92 [2021-10-13 01:06:58,130 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2021-10-13 01:06:58,193 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 874 states, 871 states have (on average 3.343283582089552) internal successors, (2912), 873 states have internal predecessors, (2912), 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-10-13 01:06:58,198 INFO L276 IsEmpty]: Start isEmpty. Operand has 874 states, 871 states have (on average 3.343283582089552) internal successors, (2912), 873 states have internal predecessors, (2912), 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-10-13 01:06:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-13 01:06:58,203 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:06:58,203 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-13 01:06:58,204 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 01:06:58,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:06:58,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1089240, now seen corresponding path program 1 times [2021-10-13 01:06:58,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:06:58,218 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756580223] [2021-10-13 01:06:58,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:06:58,223 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:06:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:06:58,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:06:58,431 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:06:58,431 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756580223] [2021-10-13 01:06:58,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756580223] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:06:58,432 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:06:58,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 01:06:58,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364749465] [2021-10-13 01:06:58,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:06:58,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:06:58,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:06:58,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:06:58,456 INFO L87 Difference]: Start difference. First operand has 874 states, 871 states have (on average 3.343283582089552) internal successors, (2912), 873 states have internal predecessors, (2912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:06:58,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:06:58,547 INFO L93 Difference]: Finished difference Result 712 states and 2215 transitions. [2021-10-13 01:06:58,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:06:58,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-10-13 01:06:58,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:06:58,575 INFO L225 Difference]: With dead ends: 712 [2021-10-13 01:06:58,576 INFO L226 Difference]: Without dead ends: 687 [2021-10-13 01:06:58,577 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:06:58,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2021-10-13 01:06:58,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2021-10-13 01:06:58,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 3.1341107871720117) internal successors, (2150), 686 states have internal predecessors, (2150), 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-10-13 01:06:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2021-10-13 01:06:58,675 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3 [2021-10-13 01:06:58,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:06:58,675 INFO L470 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2021-10-13 01:06:58,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:06:58,676 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2021-10-13 01:06:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 01:06:58,678 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:06:58,678 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:06:58,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 01:06:58,679 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 01:06:58,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:06:58,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1575106813, now seen corresponding path program 1 times [2021-10-13 01:06:58,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:06:58,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238265606] [2021-10-13 01:06:58,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:06:58,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:06:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:06:58,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:06:58,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:06:58,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238265606] [2021-10-13 01:06:58,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238265606] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:06:58,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:06:58,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 01:06:58,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482514138] [2021-10-13 01:06:58,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:06:58,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:06:58,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:06:58,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:06:58,932 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-10-13 01:06:58,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:06:58,993 INFO L93 Difference]: Finished difference Result 762 states and 2295 transitions. [2021-10-13 01:06:58,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:06:58,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2021-10-13 01:06:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:06:59,001 INFO L225 Difference]: With dead ends: 762 [2021-10-13 01:06:59,001 INFO L226 Difference]: Without dead ends: 637 [2021-10-13 01:06:59,002 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:06:59,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2021-10-13 01:06:59,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2021-10-13 01:06:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 636 states have (on average 3.09748427672956) internal successors, (1970), 636 states have internal predecessors, (1970), 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-10-13 01:06:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1970 transitions. [2021-10-13 01:06:59,037 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1970 transitions. Word has length 10 [2021-10-13 01:06:59,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:06:59,038 INFO L470 AbstractCegarLoop]: Abstraction has 637 states and 1970 transitions. [2021-10-13 01:06:59,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-10-13 01:06:59,038 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1970 transitions. [2021-10-13 01:06:59,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 01:06:59,041 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:06:59,041 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:06:59,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 01:06:59,041 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 01:06:59,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:06:59,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1583532840, now seen corresponding path program 1 times [2021-10-13 01:06:59,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:06:59,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323444123] [2021-10-13 01:06:59,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:06:59,043 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:06:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:06:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:06:59,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:06:59,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323444123] [2021-10-13 01:06:59,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323444123] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:06:59,175 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:06:59,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:06:59,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627912947] [2021-10-13 01:06:59,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:06:59,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:06:59,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:06:59,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:06:59,177 INFO L87 Difference]: Start difference. First operand 637 states and 1970 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-10-13 01:06:59,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:06:59,244 INFO L93 Difference]: Finished difference Result 861 states and 2598 transitions. [2021-10-13 01:06:59,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 01:06:59,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-10-13 01:06:59,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:06:59,248 INFO L225 Difference]: With dead ends: 861 [2021-10-13 01:06:59,249 INFO L226 Difference]: Without dead ends: 421 [2021-10-13 01:06:59,249 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 33.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 01:06:59,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2021-10-13 01:06:59,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2021-10-13 01:06:59,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 2.9095238095238094) internal successors, (1222), 420 states have internal predecessors, (1222), 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-10-13 01:06:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1222 transitions. [2021-10-13 01:06:59,266 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1222 transitions. Word has length 11 [2021-10-13 01:06:59,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:06:59,266 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 1222 transitions. [2021-10-13 01:06:59,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 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-10-13 01:06:59,267 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1222 transitions. [2021-10-13 01:06:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 01:06:59,269 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:06:59,269 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:06:59,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 01:06:59,269 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 01:06:59,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:06:59,270 INFO L82 PathProgramCache]: Analyzing trace with hash 788665782, now seen corresponding path program 1 times [2021-10-13 01:06:59,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:06:59,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600710343] [2021-10-13 01:06:59,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:06:59,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:06:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:06:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:06:59,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:06:59,367 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600710343] [2021-10-13 01:06:59,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600710343] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:06:59,368 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:06:59,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 01:06:59,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794198398] [2021-10-13 01:06:59,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:06:59,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:06:59,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:06:59,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:06:59,369 INFO L87 Difference]: Start difference. First operand 421 states and 1222 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-10-13 01:06:59,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:06:59,408 INFO L93 Difference]: Finished difference Result 457 states and 1285 transitions. [2021-10-13 01:06:59,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:06:59,408 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-10-13 01:06:59,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:06:59,412 INFO L225 Difference]: With dead ends: 457 [2021-10-13 01:06:59,412 INFO L226 Difference]: Without dead ends: 397 [2021-10-13 01:06:59,413 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:06:59,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-10-13 01:06:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2021-10-13 01:06:59,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 2.878787878787879) internal successors, (1140), 396 states have internal predecessors, (1140), 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-10-13 01:06:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 1140 transitions. [2021-10-13 01:06:59,428 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 1140 transitions. Word has length 13 [2021-10-13 01:06:59,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:06:59,429 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 1140 transitions. [2021-10-13 01:06:59,429 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-10-13 01:06:59,429 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 1140 transitions. [2021-10-13 01:06:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-13 01:06:59,433 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:06:59,433 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:06:59,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 01:06:59,433 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 01:06:59,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:06:59,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1161203572, now seen corresponding path program 1 times [2021-10-13 01:06:59,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:06:59,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989758832] [2021-10-13 01:06:59,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:06:59,435 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:06:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:06:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:06:59,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:06:59,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989758832] [2021-10-13 01:06:59,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989758832] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:06:59,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:06:59,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:06:59,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710012915] [2021-10-13 01:06:59,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:06:59,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:06:59,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:06:59,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:06:59,536 INFO L87 Difference]: Start difference. First operand 397 states and 1140 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:06:59,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:06:59,609 INFO L93 Difference]: Finished difference Result 529 states and 1507 transitions. [2021-10-13 01:06:59,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 01:06:59,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-10-13 01:06:59,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:06:59,612 INFO L225 Difference]: With dead ends: 529 [2021-10-13 01:06:59,612 INFO L226 Difference]: Without dead ends: 277 [2021-10-13 01:06:59,613 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 41.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 01:06:59,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-10-13 01:06:59,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2021-10-13 01:06:59,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 2.7318840579710146) internal successors, (754), 276 states have internal predecessors, (754), 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-10-13 01:06:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 754 transitions. [2021-10-13 01:06:59,626 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 754 transitions. Word has length 14 [2021-10-13 01:06:59,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:06:59,627 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 754 transitions. [2021-10-13 01:06:59,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:06:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 754 transitions. [2021-10-13 01:06:59,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 01:06:59,628 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:06:59,628 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:06:59,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 01:06:59,629 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 01:06:59,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:06:59,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1996632015, now seen corresponding path program 1 times [2021-10-13 01:06:59,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:06:59,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511667942] [2021-10-13 01:06:59,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:06:59,630 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:06:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:06:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:06:59,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:06:59,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511667942] [2021-10-13 01:06:59,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511667942] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:06:59,837 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:06:59,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:06:59,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009842379] [2021-10-13 01:06:59,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:06:59,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:06:59,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:06:59,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:06:59,838 INFO L87 Difference]: Start difference. First operand 277 states and 754 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:06:59,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:06:59,967 INFO L93 Difference]: Finished difference Result 311 states and 822 transitions. [2021-10-13 01:06:59,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 01:06:59,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-10-13 01:06:59,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:06:59,970 INFO L225 Difference]: With dead ends: 311 [2021-10-13 01:06:59,970 INFO L226 Difference]: Without dead ends: 275 [2021-10-13 01:06:59,971 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 27.8ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:06:59,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2021-10-13 01:06:59,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2021-10-13 01:06:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 2.7226277372262775) internal successors, (746), 274 states have internal predecessors, (746), 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-10-13 01:06:59,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 746 transitions. [2021-10-13 01:06:59,984 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 746 transitions. Word has length 15 [2021-10-13 01:06:59,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:06:59,984 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 746 transitions. [2021-10-13 01:06:59,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:06:59,984 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 746 transitions. [2021-10-13 01:06:59,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 01:06:59,985 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:06:59,986 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:06:59,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 01:06:59,986 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 01:06:59,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:06:59,991 INFO L82 PathProgramCache]: Analyzing trace with hash 683974316, now seen corresponding path program 1 times [2021-10-13 01:06:59,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:06:59,992 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175035237] [2021-10-13 01:06:59,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:06:59,996 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:07:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:07:00,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:07:00,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:07:00,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175035237] [2021-10-13 01:07:00,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175035237] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:07:00,160 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:07:00,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:07:00,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033704675] [2021-10-13 01:07:00,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:07:00,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:07:00,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:07:00,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:07:00,162 INFO L87 Difference]: Start difference. First operand 275 states and 746 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:07:00,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:07:00,196 INFO L93 Difference]: Finished difference Result 262 states and 628 transitions. [2021-10-13 01:07:00,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:07:00,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-13 01:07:00,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:07:00,199 INFO L225 Difference]: With dead ends: 262 [2021-10-13 01:07:00,199 INFO L226 Difference]: Without dead ends: 209 [2021-10-13 01:07:00,199 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:07:00,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-10-13 01:07:00,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2021-10-13 01:07:00,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 2.394230769230769) internal successors, (498), 208 states have internal predecessors, (498), 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-10-13 01:07:00,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 498 transitions. [2021-10-13 01:07:00,209 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 498 transitions. Word has length 16 [2021-10-13 01:07:00,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:07:00,209 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 498 transitions. [2021-10-13 01:07:00,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 01:07:00,210 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 498 transitions. [2021-10-13 01:07:00,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 01:07:00,211 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:07:00,211 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:07:00,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 01:07:00,212 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 01:07:00,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:07:00,212 INFO L82 PathProgramCache]: Analyzing trace with hash -862411530, now seen corresponding path program 1 times [2021-10-13 01:07:00,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:07:00,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598079621] [2021-10-13 01:07:00,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:07:00,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:07:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:07:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:07:00,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:07:00,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598079621] [2021-10-13 01:07:00,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598079621] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:07:00,347 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:07:00,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:07:00,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381636952] [2021-10-13 01:07:00,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:07:00,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:07:00,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:07:00,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:07:00,350 INFO L87 Difference]: Start difference. First operand 209 states and 498 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-10-13 01:07:00,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:07:00,391 INFO L93 Difference]: Finished difference Result 164 states and 346 transitions. [2021-10-13 01:07:00,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 01:07:00,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2021-10-13 01:07:00,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:07:00,394 INFO L225 Difference]: With dead ends: 164 [2021-10-13 01:07:00,394 INFO L226 Difference]: Without dead ends: 133 [2021-10-13 01:07:00,394 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 10.6ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:07:00,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-10-13 01:07:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-10-13 01:07:00,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.0757575757575757) internal successors, (274), 132 states have internal predecessors, (274), 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-10-13 01:07:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 274 transitions. [2021-10-13 01:07:00,399 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 274 transitions. Word has length 17 [2021-10-13 01:07:00,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:07:00,400 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 274 transitions. [2021-10-13 01:07:00,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-10-13 01:07:00,400 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 274 transitions. [2021-10-13 01:07:00,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 01:07:00,401 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:07:00,401 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-10-13 01:07:00,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 01:07:00,401 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 01:07:00,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:07:00,402 INFO L82 PathProgramCache]: Analyzing trace with hash -425554441, now seen corresponding path program 1 times [2021-10-13 01:07:00,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:07:00,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878215651] [2021-10-13 01:07:00,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:07:00,408 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:07:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:07:00,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:07:00,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:07:00,555 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878215651] [2021-10-13 01:07:00,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878215651] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:07:00,556 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:07:00,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 01:07:00,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316842021] [2021-10-13 01:07:00,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 01:07:00,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:07:00,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 01:07:00,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:07:00,561 INFO L87 Difference]: Start difference. First operand 133 states and 274 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-10-13 01:07:00,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:07:00,601 INFO L93 Difference]: Finished difference Result 112 states and 230 transitions. [2021-10-13 01:07:00,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 01:07:00,601 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-10-13 01:07:00,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:07:00,602 INFO L225 Difference]: With dead ends: 112 [2021-10-13 01:07:00,603 INFO L226 Difference]: Without dead ends: 103 [2021-10-13 01:07:00,603 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 20.1ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:07:00,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-10-13 01:07:00,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-10-13 01:07:00,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 2.0980392156862746) internal successors, (214), 102 states have internal predecessors, (214), 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-10-13 01:07:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 214 transitions. [2021-10-13 01:07:00,607 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 214 transitions. Word has length 19 [2021-10-13 01:07:00,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:07:00,607 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 214 transitions. [2021-10-13 01:07:00,608 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-10-13 01:07:00,608 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 214 transitions. [2021-10-13 01:07:00,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 01:07:00,609 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:07:00,609 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-10-13 01:07:00,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 01:07:00,609 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 01:07:00,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:07:00,610 INFO L82 PathProgramCache]: Analyzing trace with hash 961996315, now seen corresponding path program 1 times [2021-10-13 01:07:00,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:07:00,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941880396] [2021-10-13 01:07:00,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:07:00,610 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:07:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:07:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:07:00,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:07:00,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941880396] [2021-10-13 01:07:00,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941880396] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:07:00,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:07:00,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 01:07:00,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884754551] [2021-10-13 01:07:00,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 01:07:00,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:07:00,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 01:07:00,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-13 01:07:00,832 INFO L87 Difference]: Start difference. First operand 103 states and 214 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-10-13 01:07:00,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:07:00,929 INFO L93 Difference]: Finished difference Result 130 states and 263 transitions. [2021-10-13 01:07:00,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 01:07:00,930 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-10-13 01:07:00,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:07:00,931 INFO L225 Difference]: With dead ends: 130 [2021-10-13 01:07:00,931 INFO L226 Difference]: Without dead ends: 99 [2021-10-13 01:07:00,931 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 72.2ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:07:00,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-10-13 01:07:00,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2021-10-13 01:07:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.930232558139535) internal successors, (166), 86 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-10-13 01:07:00,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 166 transitions. [2021-10-13 01:07:00,933 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 166 transitions. Word has length 22 [2021-10-13 01:07:00,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:07:00,933 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 166 transitions. [2021-10-13 01:07:00,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-10-13 01:07:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 166 transitions. [2021-10-13 01:07:00,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 01:07:00,934 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:07:00,934 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-10-13 01:07:00,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 01:07:00,934 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 01:07:00,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:07:00,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1153624439, now seen corresponding path program 2 times [2021-10-13 01:07:00,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:07:00,935 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794949082] [2021-10-13 01:07:00,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:07:00,935 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:07:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:07:01,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 01:07:01,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:07:01,211 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794949082] [2021-10-13 01:07:01,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794949082] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:07:01,211 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:07:01,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 01:07:01,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544209125] [2021-10-13 01:07:01,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 01:07:01,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:07:01,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 01:07:01,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:07:01,213 INFO L87 Difference]: Start difference. First operand 87 states and 166 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 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-10-13 01:07:01,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:07:01,380 INFO L93 Difference]: Finished difference Result 110 states and 207 transitions. [2021-10-13 01:07:01,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 01:07:01,381 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 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-10-13 01:07:01,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:07:01,381 INFO L225 Difference]: With dead ends: 110 [2021-10-13 01:07:01,381 INFO L226 Difference]: Without dead ends: 65 [2021-10-13 01:07:01,382 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 135.4ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-10-13 01:07:01,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-10-13 01:07:01,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2021-10-13 01:07:01,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.7741935483870968) internal successors, (110), 62 states have internal predecessors, (110), 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-10-13 01:07:01,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2021-10-13 01:07:01,384 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 22 [2021-10-13 01:07:01,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:07:01,385 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2021-10-13 01:07:01,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 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-10-13 01:07:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2021-10-13 01:07:01,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 01:07:01,386 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:07:01,386 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-10-13 01:07:01,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 01:07:01,386 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 01:07:01,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:07:01,387 INFO L82 PathProgramCache]: Analyzing trace with hash 608040475, now seen corresponding path program 3 times [2021-10-13 01:07:01,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:07:01,387 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501121864] [2021-10-13 01:07:01,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:07:01,388 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:07:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:07:01,440 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 01:07:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 01:07:01,526 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 01:07:01,526 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 01:07:01,527 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:07:01,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:07:01,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-13 01:07:01,529 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-13 01:07:01,530 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-13 01:07:01,530 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:07:01,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 01:07:01,536 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-13 01:07:01,536 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 01:07:01,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:07:01 BasicIcfg [2021-10-13 01:07:01,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 01:07:01,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 01:07:01,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 01:07:01,616 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 01:07:01,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:06:52" (3/4) ... [2021-10-13 01:07:01,618 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 01:07:01,716 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb179607-d473-444c-8b6c-48ce6441a649/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 01:07:01,716 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 01:07:01,718 INFO L168 Benchmark]: Toolchain (without parser) took 11731.40 ms. Allocated memory was 142.6 MB in the beginning and 224.4 MB in the end (delta: 81.8 MB). Free memory was 108.5 MB in the beginning and 107.7 MB in the end (delta: 744.2 kB). Peak memory consumption was 82.3 MB. Max. memory is 16.1 GB. [2021-10-13 01:07:01,718 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 86.0 MB. Free memory is still 39.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 01:07:01,719 INFO L168 Benchmark]: CACSL2BoogieTranslator took 651.29 ms. Allocated memory is still 142.6 MB. Free memory was 108.2 MB in the beginning and 105.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 01:07:01,719 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.51 ms. Allocated memory is still 142.6 MB. Free memory was 105.6 MB in the beginning and 102.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 01:07:01,719 INFO L168 Benchmark]: Boogie Preprocessor took 72.17 ms. Allocated memory is still 142.6 MB. Free memory was 102.8 MB in the beginning and 100.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 01:07:01,720 INFO L168 Benchmark]: RCFGBuilder took 2075.53 ms. Allocated memory is still 142.6 MB. Free memory was 100.2 MB in the beginning and 106.5 MB in the end (delta: -6.3 MB). Peak memory consumption was 60.6 MB. Max. memory is 16.1 GB. [2021-10-13 01:07:01,720 INFO L168 Benchmark]: TraceAbstraction took 8730.54 ms. Allocated memory was 142.6 MB in the beginning and 224.4 MB in the end (delta: 81.8 MB). Free memory was 106.5 MB in the beginning and 122.5 MB in the end (delta: -15.9 MB). Peak memory consumption was 65.9 MB. Max. memory is 16.1 GB. [2021-10-13 01:07:01,721 INFO L168 Benchmark]: Witness Printer took 100.61 ms. Allocated memory is still 224.4 MB. Free memory was 122.5 MB in the beginning and 107.7 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-13 01:07:01,723 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.20 ms. Allocated memory is still 86.0 MB. Free memory is still 39.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 651.29 ms. Allocated memory is still 142.6 MB. Free memory was 108.2 MB in the beginning and 105.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 95.51 ms. Allocated memory is still 142.6 MB. Free memory was 105.6 MB in the beginning and 102.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 72.17 ms. Allocated memory is still 142.6 MB. Free memory was 102.8 MB in the beginning and 100.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2075.53 ms. Allocated memory is still 142.6 MB. Free memory was 100.2 MB in the beginning and 106.5 MB in the end (delta: -6.3 MB). Peak memory consumption was 60.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 8730.54 ms. Allocated memory was 142.6 MB in the beginning and 224.4 MB in the end (delta: 81.8 MB). Free memory was 106.5 MB in the beginning and 122.5 MB in the end (delta: -15.9 MB). Peak memory consumption was 65.9 MB. Max. memory is 16.1 GB. * Witness Printer took 100.61 ms. Allocated memory is still 224.4 MB. Free memory was 122.5 MB in the beginning and 107.7 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5024.4ms, 115 PlacesBefore, 37 PlacesAfterwards, 107 TransitionsBefore, 28 TransitionsAfterwards, 1876 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 5228 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3358, positive: 3189, positive conditional: 0, positive unconditional: 3189, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1485, positive: 1448, positive conditional: 0, positive unconditional: 1448, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1485, positive: 1423, positive conditional: 0, positive unconditional: 1423, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 62, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 364, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 334, negative conditional: 0, negative unconditional: 334, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3358, positive: 1741, positive conditional: 0, positive unconditional: 1741, negative: 132, negative conditional: 0, negative unconditional: 132, unknown: 1485, unknown conditional: 0, unknown unconditional: 1485] , Statistics on independence cache: Total cache size (in pairs): 189, Positive cache size: 169, Positive conditional cache size: 0, Positive unconditional cache size: 169, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1961; [L821] FCALL, FORK 0 pthread_create(&t1961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L822] 0 pthread_t t1962; [L823] FCALL, FORK 0 pthread_create(&t1962, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0: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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L824] 0 pthread_t t1963; [L825] FCALL, FORK 0 pthread_create(&t1963, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 2 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L801] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L801] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L802] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L831] 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) [L831] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L831] 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) [L831] 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) [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 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 [L834] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L835] 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 [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 z$flush_delayed = weak$$choice2 [L841] 0 z$mem_tmp = z [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L842] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L843] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L843] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L844] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L845] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L845] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L846] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L847] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L848] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L850] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L850] 0 z = z$flush_delayed ? z$mem_tmp : z [L851] 0 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, 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: 825]: 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: 823]: 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: 821]: 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 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 8496.5ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 24.6ms, AutomataDifference: 933.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5143.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 281 SDtfs, 364 SDslu, 538 SDs, 0 SdLazy, 241 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 460.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 387.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=874occurred in iteration=0, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 201.0ms AutomataMinimizationTime, 11 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 57.1ms SsaConstructionTime, 593.0ms SatisfiabilityAnalysisTime, 1186.8ms InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 1159 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-10-13 01:07:01,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bb179607-d473-444c-8b6c-48ce6441a649/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...