./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe031_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3b0cc5-06bf-4f6b-9a1a-fb9857afe913/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3b0cc5-06bf-4f6b-9a1a-fb9857afe913/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3b0cc5-06bf-4f6b-9a1a-fb9857afe913/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3b0cc5-06bf-4f6b-9a1a-fb9857afe913/bin/uautomizer-Z5i5R5N3CC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3b0cc5-06bf-4f6b-9a1a-fb9857afe913/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3b0cc5-06bf-4f6b-9a1a-fb9857afe913/bin/uautomizer-Z5i5R5N3CC --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 c6768c7a8354b7367355bf78153a1ca4e21b48fa ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.0-7b2dab5 [2021-10-11 00:28:36,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 00:28:36,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 00:28:36,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 00:28:36,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 00:28:36,419 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 00:28:36,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 00:28:36,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 00:28:36,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 00:28:36,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 00:28:36,443 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 00:28:36,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 00:28:36,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 00:28:36,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 00:28:36,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 00:28:36,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 00:28:36,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 00:28:36,463 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 00:28:36,466 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 00:28:36,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 00:28:36,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 00:28:36,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 00:28:36,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 00:28:36,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 00:28:36,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 00:28:36,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 00:28:36,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 00:28:36,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 00:28:36,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 00:28:36,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 00:28:36,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 00:28:36,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 00:28:36,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 00:28:36,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 00:28:36,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 00:28:36,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 00:28:36,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 00:28:36,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 00:28:36,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 00:28:36,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 00:28:36,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 00:28:36,507 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3b0cc5-06bf-4f6b-9a1a-fb9857afe913/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-11 00:28:36,559 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 00:28:36,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 00:28:36,561 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 00:28:36,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 00:28:36,562 INFO L138 SettingsManager]: * Use SBE=true [2021-10-11 00:28:36,562 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 00:28:36,563 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 00:28:36,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 00:28:36,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 00:28:36,564 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 00:28:36,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 00:28:36,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 00:28:36,566 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 00:28:36,566 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 00:28:36,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 00:28:36,567 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 00:28:36,567 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 00:28:36,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 00:28:36,568 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-11 00:28:36,568 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 00:28:36,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 00:28:36,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 00:28:36,569 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 00:28:36,569 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 00:28:36,569 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-11 00:28:36,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 00:28:36,570 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 00:28:36,570 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 00:28:36,571 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_7a3b0cc5-06bf-4f6b-9a1a-fb9857afe913/bin/uautomizer-Z5i5R5N3CC/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_7a3b0cc5-06bf-4f6b-9a1a-fb9857afe913/bin/uautomizer-Z5i5R5N3CC 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 -> c6768c7a8354b7367355bf78153a1ca4e21b48fa [2021-10-11 00:28:36,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 00:28:36,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 00:28:36,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 00:28:36,941 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 00:28:36,942 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 00:28:36,943 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3b0cc5-06bf-4f6b-9a1a-fb9857afe913/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/pthread-wmm/safe031_power.opt.i [2021-10-11 00:28:37,036 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3b0cc5-06bf-4f6b-9a1a-fb9857afe913/bin/uautomizer-Z5i5R5N3CC/data/97b17baaa/2246de0aaa154dddb7b433b62d41a6b7/FLAG34f735656 [2021-10-11 00:28:37,812 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 00:28:37,813 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3b0cc5-06bf-4f6b-9a1a-fb9857afe913/sv-benchmarks/c/pthread-wmm/safe031_power.opt.i [2021-10-11 00:28:37,837 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3b0cc5-06bf-4f6b-9a1a-fb9857afe913/bin/uautomizer-Z5i5R5N3CC/data/97b17baaa/2246de0aaa154dddb7b433b62d41a6b7/FLAG34f735656 [2021-10-11 00:28:38,030 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3b0cc5-06bf-4f6b-9a1a-fb9857afe913/bin/uautomizer-Z5i5R5N3CC/data/97b17baaa/2246de0aaa154dddb7b433b62d41a6b7 [2021-10-11 00:28:38,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 00:28:38,035 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 00:28:38,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 00:28:38,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 00:28:38,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 00:28:38,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:28:38" (1/1) ... [2021-10-11 00:28:38,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f6180f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:28:38, skipping insertion in model container [2021-10-11 00:28:38,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:28:38" (1/1) ... [2021-10-11 00:28:38,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 00:28:38,145 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 00:28:38,393 WARN L226 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_7a3b0cc5-06bf-4f6b-9a1a-fb9857afe913/sv-benchmarks/c/pthread-wmm/safe031_power.opt.i[951,964] [2021-10-11 00:28:38,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:28:38,773 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 00:28:38,788 WARN L226 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_7a3b0cc5-06bf-4f6b-9a1a-fb9857afe913/sv-benchmarks/c/pthread-wmm/safe031_power.opt.i[951,964] [2021-10-11 00:28:38,841 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:28:38,930 INFO L208 MainTranslator]: Completed translation [2021-10-11 00:28:38,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:28:38 WrapperNode [2021-10-11 00:28:38,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 00:28:38,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 00:28:38,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 00:28:38,933 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 00:28:38,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:28:38" (1/1) ... [2021-10-11 00:28:38,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:28:38" (1/1) ... [2021-10-11 00:28:39,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 00:28:39,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 00:28:39,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 00:28:39,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 00:28:39,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:28:38" (1/1) ... [2021-10-11 00:28:39,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:28:38" (1/1) ... [2021-10-11 00:28:39,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:28:38" (1/1) ... [2021-10-11 00:28:39,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:28:38" (1/1) ... [2021-10-11 00:28:39,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:28:38" (1/1) ... [2021-10-11 00:28:39,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:28:38" (1/1) ... [2021-10-11 00:28:39,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:28:38" (1/1) ... [2021-10-11 00:28:39,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 00:28:39,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 00:28:39,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 00:28:39,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 00:28:39,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:28:38" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3b0cc5-06bf-4f6b-9a1a-fb9857afe913/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 00:28:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-11 00:28:39,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-11 00:28:39,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 00:28:39,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-11 00:28:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-11 00:28:39,223 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-11 00:28:39,223 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-11 00:28:39,223 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-11 00:28:39,224 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-11 00:28:39,224 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-11 00:28:39,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 00:28:39,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-11 00:28:39,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 00:28:39,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 00:28:39,228 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-11 00:28:41,949 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 00:28:41,949 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-11 00:28:41,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:28:41 BoogieIcfgContainer [2021-10-11 00:28:41,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 00:28:41,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 00:28:41,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 00:28:41,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 00:28:41,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:28:38" (1/3) ... [2021-10-11 00:28:41,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16400c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:28:41, skipping insertion in model container [2021-10-11 00:28:41,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:28:38" (2/3) ... [2021-10-11 00:28:41,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16400c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:28:41, skipping insertion in model container [2021-10-11 00:28:41,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:28:41" (3/3) ... [2021-10-11 00:28:41,962 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_power.opt.i [2021-10-11 00:28:41,979 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-11 00:28:41,980 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 00:28:41,984 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-10-11 00:28:41,985 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-11 00:28:42,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,028 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,028 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,029 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,029 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,031 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,031 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,032 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,032 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,037 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,037 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,038 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,038 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,038 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,039 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,039 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,040 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,042 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,047 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,048 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,052 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,053 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,054 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,054 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,054 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,054 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,057 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,058 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,058 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:28:42,068 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-11 00:28:42,081 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-10-11 00:28:42,104 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 00:28:42,104 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 00:28:42,105 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 00:28:42,105 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 00:28:42,105 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 00:28:42,105 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 00:28:42,105 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 00:28:42,105 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 00:28:42,120 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-11 00:28:42,122 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 207 flow [2021-10-11 00:28:42,126 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 96 transitions, 207 flow [2021-10-11 00:28:42,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2021-10-11 00:28:42,176 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-10-11 00:28:42,177 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-11 00:28:42,181 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-10-11 00:28:42,185 INFO L116 LiptonReduction]: Number of co-enabled transitions 1578 [2021-10-11 00:28:43,539 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2021-10-11 00:28:43,540 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:43,670 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:28:43,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:43,676 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 00:28:43,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:43,792 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:28:43,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:43,798 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 00:28:43,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:43,890 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2021-10-11 00:28:43,891 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:43,940 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:28:43,941 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:43,944 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 00:28:43,944 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:44,012 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:28:44,013 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:44,015 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 00:28:44,015 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:45,454 WARN L197 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2021-10-11 00:28:45,892 WARN L197 SmtUtils]: Spent 433.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-10-11 00:28:48,055 WARN L197 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-10-11 00:28:49,134 WARN L197 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 263 [2021-10-11 00:28:49,577 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 00:28:49,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:49,581 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 00:28:49,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:49,626 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:28:49,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:49,628 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 00:28:49,629 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:49,689 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:49,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:49,691 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:49,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:49,695 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:49,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:28:49,701 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:49,701 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:28:49,731 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:49,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:49,734 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:49,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:49,737 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:49,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:28:49,741 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:49,741 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:28:50,250 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:50,250 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:50,252 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:50,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:50,255 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:50,255 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:28:50,260 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:50,260 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:28:50,287 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:50,288 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:50,290 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:50,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:50,297 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:50,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:28:50,301 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:50,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:28:50,482 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:50,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:50,484 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:50,484 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:50,487 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:50,487 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:28:50,490 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:50,491 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:28:50,517 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:50,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:50,519 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:50,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:50,522 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:50,522 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:28:50,525 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:50,526 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:28:51,078 WARN L197 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-10-11 00:28:51,740 WARN L197 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 89 [2021-10-11 00:28:51,997 WARN L197 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-10-11 00:28:52,099 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-10-11 00:28:52,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:52,130 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:28:52,130 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:52,132 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 00:28:52,132 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:52,167 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 00:28:52,168 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:52,168 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 00:28:52,169 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:52,572 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:52,572 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:52,573 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:52,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:52,575 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:52,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:52,577 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:52,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:52,598 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:52,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:52,599 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:52,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:52,602 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:52,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:28:52,604 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:52,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:28:52,768 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:28:52,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:52,770 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 00:28:52,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:52,803 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:28:52,803 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:52,805 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 00:28:52,805 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:53,149 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:53,150 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:53,177 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,178 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:28:53,180 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:28:53,204 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,205 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:53,207 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,207 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:53,210 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,210 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:53,213 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,213 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:53,289 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,290 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:53,292 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,293 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:53,295 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:28:53,303 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,304 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:28:53,327 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,328 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:53,329 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:53,331 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,332 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:53,334 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,334 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:53,385 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,386 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:53,388 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:53,391 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,391 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:53,394 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:28:53,418 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:53,420 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,420 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:28:53,422 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:28:53,425 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:28:53,425 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:28:53,852 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2021-10-11 00:28:54,037 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2021-10-11 00:28:54,208 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-10-11 00:28:54,329 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-10-11 00:28:54,441 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-10-11 00:28:55,325 WARN L197 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-10-11 00:28:55,624 WARN L197 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-10-11 00:28:56,193 WARN L197 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-10-11 00:28:56,420 WARN L197 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-10-11 00:28:56,425 INFO L131 LiptonReduction]: Checked pairs total: 3750 [2021-10-11 00:28:56,425 INFO L133 LiptonReduction]: Total number of compositions: 80 [2021-10-11 00:28:56,442 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2021-10-11 00:28:56,523 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 770 states. [2021-10-11 00:28:56,525 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states. [2021-10-11 00:28:56,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-11 00:28:56,533 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:28:56,533 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:28:56,534 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:28:56,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:28:56,547 INFO L82 PathProgramCache]: Analyzing trace with hash -91940209, now seen corresponding path program 1 times [2021-10-11 00:28:56,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:28:56,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934773650] [2021-10-11 00:28:56,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:28:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:28:56,986 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-11 00:28:56,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934773650] [2021-10-11 00:28:56,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:28:56,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-11 00:28:56,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078885788] [2021-10-11 00:28:56,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:28:56,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:28:57,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:28:57,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:28:57,014 INFO L87 Difference]: Start difference. First operand 770 states. Second operand 3 states. [2021-10-11 00:28:57,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:28:57,123 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2021-10-11 00:28:57,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:28:57,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2021-10-11 00:28:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:28:57,152 INFO L225 Difference]: With dead ends: 650 [2021-10-11 00:28:57,153 INFO L226 Difference]: Without dead ends: 550 [2021-10-11 00:28:57,154 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:28:57,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-10-11 00:28:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2021-10-11 00:28:57,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2021-10-11 00:28:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions. [2021-10-11 00:28:57,272 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 7 [2021-10-11 00:28:57,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:28:57,273 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions. [2021-10-11 00:28:57,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:28:57,274 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions. [2021-10-11 00:28:57,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 00:28:57,276 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:28:57,277 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:28:57,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 00:28:57,277 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:28:57,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:28:57,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1199905836, now seen corresponding path program 1 times [2021-10-11 00:28:57,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:28:57,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807718875] [2021-10-11 00:28:57,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:28:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:28:57,528 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-11 00:28:57,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807718875] [2021-10-11 00:28:57,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:28:57,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 00:28:57,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790278441] [2021-10-11 00:28:57,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:28:57,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:28:57,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:28:57,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:28:57,532 INFO L87 Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand 4 states. [2021-10-11 00:28:57,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:28:57,593 INFO L93 Difference]: Finished difference Result 630 states and 1862 transitions. [2021-10-11 00:28:57,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:28:57,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2021-10-11 00:28:57,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:28:57,609 INFO L225 Difference]: With dead ends: 630 [2021-10-11 00:28:57,609 INFO L226 Difference]: Without dead ends: 530 [2021-10-11 00:28:57,611 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:28:57,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-10-11 00:28:57,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2021-10-11 00:28:57,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2021-10-11 00:28:57,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1617 transitions. [2021-10-11 00:28:57,667 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1617 transitions. Word has length 10 [2021-10-11 00:28:57,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:28:57,668 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1617 transitions. [2021-10-11 00:28:57,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:28:57,668 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1617 transitions. [2021-10-11 00:28:57,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 00:28:57,671 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:28:57,671 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:28:57,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 00:28:57,672 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:28:57,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:28:57,672 INFO L82 PathProgramCache]: Analyzing trace with hash -581593344, now seen corresponding path program 1 times [2021-10-11 00:28:57,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:28:57,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038611700] [2021-10-11 00:28:57,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:28:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:28:57,891 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-11 00:28:57,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038611700] [2021-10-11 00:28:57,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:28:57,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 00:28:57,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396887238] [2021-10-11 00:28:57,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:28:57,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:28:57,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:28:57,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:28:57,895 INFO L87 Difference]: Start difference. First operand 530 states and 1617 transitions. Second operand 4 states. [2021-10-11 00:28:57,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:28:57,976 INFO L93 Difference]: Finished difference Result 593 states and 1749 transitions. [2021-10-11 00:28:57,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:28:57,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2021-10-11 00:28:57,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:28:57,984 INFO L225 Difference]: With dead ends: 593 [2021-10-11 00:28:57,984 INFO L226 Difference]: Without dead ends: 518 [2021-10-11 00:28:57,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:28:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2021-10-11 00:28:58,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2021-10-11 00:28:58,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2021-10-11 00:28:58,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 1573 transitions. [2021-10-11 00:28:58,011 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 1573 transitions. Word has length 11 [2021-10-11 00:28:58,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:28:58,011 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 1573 transitions. [2021-10-11 00:28:58,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:28:58,012 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 1573 transitions. [2021-10-11 00:28:58,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 00:28:58,015 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:28:58,015 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:28:58,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 00:28:58,016 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:28:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:28:58,016 INFO L82 PathProgramCache]: Analyzing trace with hash -870231967, now seen corresponding path program 1 times [2021-10-11 00:28:58,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:28:58,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478196906] [2021-10-11 00:28:58,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:28:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:28:58,155 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-11 00:28:58,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478196906] [2021-10-11 00:28:58,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:28:58,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:28:58,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274221101] [2021-10-11 00:28:58,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:28:58,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:28:58,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:28:58,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:28:58,158 INFO L87 Difference]: Start difference. First operand 518 states and 1573 transitions. Second operand 6 states. [2021-10-11 00:28:58,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:28:58,342 INFO L93 Difference]: Finished difference Result 633 states and 1890 transitions. [2021-10-11 00:28:58,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 00:28:58,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2021-10-11 00:28:58,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:28:58,349 INFO L225 Difference]: With dead ends: 633 [2021-10-11 00:28:58,349 INFO L226 Difference]: Without dead ends: 558 [2021-10-11 00:28:58,350 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-10-11 00:28:58,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2021-10-11 00:28:58,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2021-10-11 00:28:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2021-10-11 00:28:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1699 transitions. [2021-10-11 00:28:58,377 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1699 transitions. Word has length 12 [2021-10-11 00:28:58,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:28:58,377 INFO L481 AbstractCegarLoop]: Abstraction has 558 states and 1699 transitions. [2021-10-11 00:28:58,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:28:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1699 transitions. [2021-10-11 00:28:58,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 00:28:58,379 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:28:58,380 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:28:58,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 00:28:58,380 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:28:58,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:28:58,380 INFO L82 PathProgramCache]: Analyzing trace with hash -849532027, now seen corresponding path program 2 times [2021-10-11 00:28:58,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:28:58,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837902500] [2021-10-11 00:28:58,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:28:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:28:58,494 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-11 00:28:58,494 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837902500] [2021-10-11 00:28:58,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:28:58,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:28:58,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844542794] [2021-10-11 00:28:58,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:28:58,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:28:58,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:28:58,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:28:58,497 INFO L87 Difference]: Start difference. First operand 558 states and 1699 transitions. Second operand 6 states. [2021-10-11 00:28:58,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:28:58,619 INFO L93 Difference]: Finished difference Result 605 states and 1779 transitions. [2021-10-11 00:28:58,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:28:58,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2021-10-11 00:28:58,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:28:58,626 INFO L225 Difference]: With dead ends: 605 [2021-10-11 00:28:58,626 INFO L226 Difference]: Without dead ends: 530 [2021-10-11 00:28:58,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-10-11 00:28:58,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-10-11 00:28:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2021-10-11 00:28:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2021-10-11 00:28:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1595 transitions. [2021-10-11 00:28:58,653 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1595 transitions. Word has length 12 [2021-10-11 00:28:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:28:58,653 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1595 transitions. [2021-10-11 00:28:58,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:28:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1595 transitions. [2021-10-11 00:28:58,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-11 00:28:58,655 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:28:58,655 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:28:58,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 00:28:58,656 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:28:58,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:28:58,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1162877187, now seen corresponding path program 1 times [2021-10-11 00:28:58,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:28:58,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284893719] [2021-10-11 00:28:58,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:28:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:28:58,764 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-11 00:28:58,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284893719] [2021-10-11 00:28:58,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:28:58,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:28:58,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302682537] [2021-10-11 00:28:58,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:28:58,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:28:58,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:28:58,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:28:58,767 INFO L87 Difference]: Start difference. First operand 530 states and 1595 transitions. Second operand 6 states. [2021-10-11 00:28:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:28:59,021 INFO L93 Difference]: Finished difference Result 614 states and 1801 transitions. [2021-10-11 00:28:59,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 00:28:59,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2021-10-11 00:28:59,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:28:59,030 INFO L225 Difference]: With dead ends: 614 [2021-10-11 00:28:59,030 INFO L226 Difference]: Without dead ends: 546 [2021-10-11 00:28:59,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-10-11 00:28:59,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2021-10-11 00:28:59,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 506. [2021-10-11 00:28:59,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2021-10-11 00:28:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 1497 transitions. [2021-10-11 00:28:59,058 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 1497 transitions. Word has length 13 [2021-10-11 00:28:59,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:28:59,059 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 1497 transitions. [2021-10-11 00:28:59,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:28:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 1497 transitions. [2021-10-11 00:28:59,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-11 00:28:59,061 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:28:59,061 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:28:59,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 00:28:59,061 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:28:59,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:28:59,062 INFO L82 PathProgramCache]: Analyzing trace with hash -620951754, now seen corresponding path program 1 times [2021-10-11 00:28:59,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:28:59,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173522140] [2021-10-11 00:28:59,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:28:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:28:59,148 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-11 00:28:59,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173522140] [2021-10-11 00:28:59,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:28:59,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:28:59,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566467904] [2021-10-11 00:28:59,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:28:59,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:28:59,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:28:59,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:28:59,151 INFO L87 Difference]: Start difference. First operand 506 states and 1497 transitions. Second operand 4 states. [2021-10-11 00:28:59,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:28:59,196 INFO L93 Difference]: Finished difference Result 755 states and 2150 transitions. [2021-10-11 00:28:59,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:28:59,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2021-10-11 00:28:59,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:28:59,203 INFO L225 Difference]: With dead ends: 755 [2021-10-11 00:28:59,203 INFO L226 Difference]: Without dead ends: 470 [2021-10-11 00:28:59,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:28:59,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-10-11 00:28:59,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 434. [2021-10-11 00:28:59,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2021-10-11 00:28:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1213 transitions. [2021-10-11 00:28:59,228 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1213 transitions. Word has length 13 [2021-10-11 00:28:59,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:28:59,229 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1213 transitions. [2021-10-11 00:28:59,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:28:59,229 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1213 transitions. [2021-10-11 00:28:59,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 00:28:59,230 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:28:59,231 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:28:59,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 00:28:59,231 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:28:59,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:28:59,232 INFO L82 PathProgramCache]: Analyzing trace with hash -2069632166, now seen corresponding path program 1 times [2021-10-11 00:28:59,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:28:59,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863533739] [2021-10-11 00:28:59,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:28:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:28:59,364 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-11 00:28:59,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863533739] [2021-10-11 00:28:59,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:28:59,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:28:59,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559442587] [2021-10-11 00:28:59,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:28:59,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:28:59,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:28:59,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:28:59,373 INFO L87 Difference]: Start difference. First operand 434 states and 1213 transitions. Second operand 4 states. [2021-10-11 00:28:59,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:28:59,417 INFO L93 Difference]: Finished difference Result 414 states and 1014 transitions. [2021-10-11 00:28:59,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:28:59,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2021-10-11 00:28:59,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:28:59,421 INFO L225 Difference]: With dead ends: 414 [2021-10-11 00:28:59,421 INFO L226 Difference]: Without dead ends: 310 [2021-10-11 00:28:59,421 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:28:59,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-10-11 00:28:59,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2021-10-11 00:28:59,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2021-10-11 00:28:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 741 transitions. [2021-10-11 00:28:59,434 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 741 transitions. Word has length 14 [2021-10-11 00:28:59,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:28:59,434 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 741 transitions. [2021-10-11 00:28:59,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:28:59,434 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 741 transitions. [2021-10-11 00:28:59,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 00:28:59,435 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:28:59,435 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:28:59,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 00:28:59,436 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:28:59,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:28:59,436 INFO L82 PathProgramCache]: Analyzing trace with hash -56041785, now seen corresponding path program 1 times [2021-10-11 00:28:59,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:28:59,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716762128] [2021-10-11 00:28:59,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:28:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:28:59,582 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-11 00:28:59,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716762128] [2021-10-11 00:28:59,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:28:59,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:28:59,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388641068] [2021-10-11 00:28:59,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:28:59,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:28:59,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:28:59,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:28:59,584 INFO L87 Difference]: Start difference. First operand 310 states and 741 transitions. Second operand 5 states. [2021-10-11 00:28:59,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:28:59,635 INFO L93 Difference]: Finished difference Result 240 states and 514 transitions. [2021-10-11 00:28:59,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:28:59,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2021-10-11 00:28:59,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:28:59,639 INFO L225 Difference]: With dead ends: 240 [2021-10-11 00:28:59,639 INFO L226 Difference]: Without dead ends: 186 [2021-10-11 00:28:59,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:28:59,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2021-10-11 00:28:59,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2021-10-11 00:28:59,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2021-10-11 00:28:59,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 387 transitions. [2021-10-11 00:28:59,647 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 387 transitions. Word has length 15 [2021-10-11 00:28:59,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:28:59,648 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 387 transitions. [2021-10-11 00:28:59,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:28:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 387 transitions. [2021-10-11 00:28:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 00:28:59,649 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:28:59,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:28:59,650 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 00:28:59,650 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:28:59,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:28:59,650 INFO L82 PathProgramCache]: Analyzing trace with hash 2037657781, now seen corresponding path program 1 times [2021-10-11 00:28:59,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:28:59,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653719840] [2021-10-11 00:28:59,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:28:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:28:59,744 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-11 00:28:59,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653719840] [2021-10-11 00:28:59,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:28:59,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:28:59,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794965413] [2021-10-11 00:28:59,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:28:59,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:28:59,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:28:59,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:28:59,747 INFO L87 Difference]: Start difference. First operand 186 states and 387 transitions. Second operand 6 states. [2021-10-11 00:28:59,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:28:59,808 INFO L93 Difference]: Finished difference Result 158 states and 330 transitions. [2021-10-11 00:28:59,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 00:28:59,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2021-10-11 00:28:59,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:28:59,811 INFO L225 Difference]: With dead ends: 158 [2021-10-11 00:28:59,811 INFO L226 Difference]: Without dead ends: 98 [2021-10-11 00:28:59,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:28:59,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-10-11 00:28:59,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2021-10-11 00:28:59,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2021-10-11 00:28:59,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 177 transitions. [2021-10-11 00:28:59,816 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 177 transitions. Word has length 17 [2021-10-11 00:28:59,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:28:59,816 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 177 transitions. [2021-10-11 00:28:59,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:28:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 177 transitions. [2021-10-11 00:28:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-11 00:28:59,817 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:28:59,818 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:28:59,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-11 00:28:59,818 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:28:59,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:28:59,819 INFO L82 PathProgramCache]: Analyzing trace with hash -453767717, now seen corresponding path program 1 times [2021-10-11 00:28:59,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:28:59,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432288951] [2021-10-11 00:28:59,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:28:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:28:59,888 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-11 00:28:59,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432288951] [2021-10-11 00:28:59,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:28:59,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:28:59,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482216632] [2021-10-11 00:28:59,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:28:59,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:28:59,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:28:59,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:28:59,891 INFO L87 Difference]: Start difference. First operand 88 states and 177 transitions. Second operand 5 states. [2021-10-11 00:28:59,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:28:59,932 INFO L93 Difference]: Finished difference Result 115 states and 226 transitions. [2021-10-11 00:28:59,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:28:59,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2021-10-11 00:28:59,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:28:59,934 INFO L225 Difference]: With dead ends: 115 [2021-10-11 00:28:59,935 INFO L226 Difference]: Without dead ends: 48 [2021-10-11 00:28:59,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:28:59,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-10-11 00:28:59,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2021-10-11 00:28:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2021-10-11 00:28:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2021-10-11 00:28:59,938 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 21 [2021-10-11 00:28:59,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:28:59,938 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2021-10-11 00:28:59,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:28:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2021-10-11 00:28:59,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-11 00:28:59,939 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:28:59,940 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:28:59,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-11 00:28:59,940 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:28:59,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:28:59,941 INFO L82 PathProgramCache]: Analyzing trace with hash -36042101, now seen corresponding path program 2 times [2021-10-11 00:28:59,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:28:59,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301808989] [2021-10-11 00:28:59,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:28:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:29:00,253 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-11 00:29:00,254 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301808989] [2021-10-11 00:29:00,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:29:00,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-11 00:29:00,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800475115] [2021-10-11 00:29:00,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 00:29:00,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:29:00,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 00:29:00,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-11 00:29:00,256 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand 9 states. [2021-10-11 00:29:00,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:29:00,495 INFO L93 Difference]: Finished difference Result 75 states and 120 transitions. [2021-10-11 00:29:00,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 00:29:00,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2021-10-11 00:29:00,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:29:00,496 INFO L225 Difference]: With dead ends: 75 [2021-10-11 00:29:00,496 INFO L226 Difference]: Without dead ends: 48 [2021-10-11 00:29:00,497 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-10-11 00:29:00,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-10-11 00:29:00,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 36. [2021-10-11 00:29:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2021-10-11 00:29:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2021-10-11 00:29:00,499 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 21 [2021-10-11 00:29:00,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:29:00,499 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2021-10-11 00:29:00,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 00:29:00,499 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2021-10-11 00:29:00,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-11 00:29:00,500 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:29:00,500 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:29:00,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-11 00:29:00,500 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:29:00,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:00,501 INFO L82 PathProgramCache]: Analyzing trace with hash -689523069, now seen corresponding path program 3 times [2021-10-11 00:29:00,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:00,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967701359] [2021-10-11 00:29:00,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:00,553 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:00,609 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:00,647 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:29:00,648 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-10-11 00:29:00,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-11 00:29:00,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:29:00 BasicIcfg [2021-10-11 00:29:00,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 00:29:00,802 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 00:29:00,802 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 00:29:00,802 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 00:29:00,802 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:28:41" (3/4) ... [2021-10-11 00:29:00,810 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-11 00:29:00,943 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a3b0cc5-06bf-4f6b-9a1a-fb9857afe913/bin/uautomizer-Z5i5R5N3CC/witness.graphml [2021-10-11 00:29:00,943 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 00:29:00,944 INFO L168 Benchmark]: Toolchain (without parser) took 22909.11 ms. Allocated memory was 86.0 MB in the beginning and 323.0 MB in the end (delta: 237.0 MB). Free memory was 47.4 MB in the beginning and 236.6 MB in the end (delta: -189.2 MB). Peak memory consumption was 47.0 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:00,945 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 86.0 MB. Free memory was 65.5 MB in the beginning and 65.4 MB in the end (delta: 71.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:29:00,945 INFO L168 Benchmark]: CACSL2BoogieTranslator took 894.66 ms. Allocated memory is still 86.0 MB. Free memory was 47.3 MB in the beginning and 38.6 MB in the end (delta: 8.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:00,946 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.08 ms. Allocated memory is still 86.0 MB. Free memory was 38.6 MB in the beginning and 35.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:00,946 INFO L168 Benchmark]: Boogie Preprocessor took 62.01 ms. Allocated memory is still 86.0 MB. Free memory was 35.6 MB in the beginning and 33.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:00,947 INFO L168 Benchmark]: RCFGBuilder took 2860.92 ms. Allocated memory was 86.0 MB in the beginning and 140.5 MB in the end (delta: 54.5 MB). Free memory was 33.5 MB in the beginning and 93.9 MB in the end (delta: -60.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:00,947 INFO L168 Benchmark]: TraceAbstraction took 18847.17 ms. Allocated memory was 140.5 MB in the beginning and 323.0 MB in the end (delta: 182.5 MB). Free memory was 93.9 MB in the beginning and 249.1 MB in the end (delta: -155.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:00,948 INFO L168 Benchmark]: Witness Printer took 141.55 ms. Allocated memory is still 323.0 MB. Free memory was 249.1 MB in the beginning and 236.6 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:00,951 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.28 ms. Allocated memory is still 86.0 MB. Free memory was 65.5 MB in the beginning and 65.4 MB in the end (delta: 71.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 894.66 ms. Allocated memory is still 86.0 MB. Free memory was 47.3 MB in the beginning and 38.6 MB in the end (delta: 8.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 95.08 ms. Allocated memory is still 86.0 MB. Free memory was 38.6 MB in the beginning and 35.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 62.01 ms. Allocated memory is still 86.0 MB. Free memory was 35.6 MB in the beginning and 33.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2860.92 ms. Allocated memory was 86.0 MB in the beginning and 140.5 MB in the end (delta: 54.5 MB). Free memory was 33.5 MB in the beginning and 93.9 MB in the end (delta: -60.4 MB). Peak memory consumption was 25.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 18847.17 ms. Allocated memory was 140.5 MB in the beginning and 323.0 MB in the end (delta: 182.5 MB). Free memory was 93.9 MB in the beginning and 249.1 MB in the end (delta: -155.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 16.1 GB. * Witness Printer took 141.55 ms. Allocated memory is still 323.0 MB. Free memory was 249.1 MB in the beginning and 236.6 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1117 VarBasedMoverChecksPositive, 57 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 37 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 150 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 14.2s, 104 PlacesBefore, 36 PlacesAfterwards, 96 TransitionsBefore, 27 TransitionsAfterwards, 1578 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, 3750 MoverChecksTotal - 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_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2516; [L816] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t2517; [L818] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] 0 pthread_t t2518; [L820] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L761] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 3 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L826] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L828] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L830] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.4s, HoareTripleCheckerStatistics: 330 SDtfs, 359 SDslu, 673 SDs, 0 SdLazy, 297 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=770occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 98 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 14986 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...