./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9548a61-e2c3-47cc-9c67-c3092c50b5ca/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9548a61-e2c3-47cc-9c67-c3092c50b5ca/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9548a61-e2c3-47cc-9c67-c3092c50b5ca/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9548a61-e2c3-47cc-9c67-c3092c50b5ca/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9548a61-e2c3-47cc-9c67-c3092c50b5ca/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9548a61-e2c3-47cc-9c67-c3092c50b5ca/bin/uautomizer-WNIpwEf4Nt --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 46f7cf09c391d8251a56b39978f04af399fe0420 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 00:53:42,002 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:53:42,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:53:42,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:53:42,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:53:42,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:53:42,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:53:42,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:53:42,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:53:42,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:53:42,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:53:42,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:53:42,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:53:42,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:53:42,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:53:42,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:53:42,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:53:42,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:53:42,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:53:42,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:53:42,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:53:42,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:53:42,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:53:42,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:53:42,108 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:53:42,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:53:42,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:53:42,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:53:42,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:53:42,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:53:42,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:53:42,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:53:42,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:53:42,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:53:42,136 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:53:42,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:53:42,140 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:53:42,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:53:42,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:53:42,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:53:42,145 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:53:42,146 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9548a61-e2c3-47cc-9c67-c3092c50b5ca/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 00:53:42,225 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:53:42,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:53:42,226 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:53:42,227 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:53:42,237 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:53:42,237 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:53:42,238 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:53:42,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:53:42,238 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:53:42,239 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:53:42,240 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:53:42,240 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:53:42,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 00:53:42,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 00:53:42,241 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 00:53:42,242 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:53:42,242 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:53:42,242 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:53:42,242 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 00:53:42,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:53:42,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:53:42,243 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 00:53:42,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:53:42,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:53:42,244 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 00:53:42,245 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 00:53:42,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:53:42,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 00:53:42,245 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 00:53:42,247 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:53:42,248 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_b9548a61-e2c3-47cc-9c67-c3092c50b5ca/bin/uautomizer-WNIpwEf4Nt/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9548a61-e2c3-47cc-9c67-c3092c50b5ca/bin/uautomizer-WNIpwEf4Nt Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 46f7cf09c391d8251a56b39978f04af399fe0420 [2021-10-13 00:53:42,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:53:42,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:53:42,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:53:42,631 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:53:42,632 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:53:42,634 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9548a61-e2c3-47cc-9c67-c3092c50b5ca/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc.i [2021-10-13 00:53:42,715 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9548a61-e2c3-47cc-9c67-c3092c50b5ca/bin/uautomizer-WNIpwEf4Nt/data/c9d741c47/9748877ecbc04ea48cf218b487ae164b/FLAG3e4ad5d44 [2021-10-13 00:53:43,447 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:53:43,448 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9548a61-e2c3-47cc-9c67-c3092c50b5ca/sv-benchmarks/c/pthread-wmm/safe030_power.oepc.i [2021-10-13 00:53:43,476 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9548a61-e2c3-47cc-9c67-c3092c50b5ca/bin/uautomizer-WNIpwEf4Nt/data/c9d741c47/9748877ecbc04ea48cf218b487ae164b/FLAG3e4ad5d44 [2021-10-13 00:53:43,676 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9548a61-e2c3-47cc-9c67-c3092c50b5ca/bin/uautomizer-WNIpwEf4Nt/data/c9d741c47/9748877ecbc04ea48cf218b487ae164b [2021-10-13 00:53:43,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:53:43,681 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:53:43,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:53:43,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:53:43,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:53:43,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:53:43" (1/1) ... [2021-10-13 00:53:43,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42b9056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:43, skipping insertion in model container [2021-10-13 00:53:43,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:53:43" (1/1) ... [2021-10-13 00:53:43,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:53:43,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:53:44,005 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9548a61-e2c3-47cc-9c67-c3092c50b5ca/sv-benchmarks/c/pthread-wmm/safe030_power.oepc.i[952,965] [2021-10-13 00:53:44,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:53:44,470 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:53:44,504 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9548a61-e2c3-47cc-9c67-c3092c50b5ca/sv-benchmarks/c/pthread-wmm/safe030_power.oepc.i[952,965] [2021-10-13 00:53:44,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:53:44,689 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:53:44,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:44 WrapperNode [2021-10-13 00:53:44,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:53:44,694 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:53:44,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:53:44,695 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:53:44,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:44" (1/1) ... [2021-10-13 00:53:44,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:44" (1/1) ... [2021-10-13 00:53:44,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:53:44,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:53:44,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:53:44,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:53:44,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:44" (1/1) ... [2021-10-13 00:53:44,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:44" (1/1) ... [2021-10-13 00:53:44,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:44" (1/1) ... [2021-10-13 00:53:44,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:44" (1/1) ... [2021-10-13 00:53:44,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:44" (1/1) ... [2021-10-13 00:53:44,848 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:44" (1/1) ... [2021-10-13 00:53:44,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:44" (1/1) ... [2021-10-13 00:53:44,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:53:44,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:53:44,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:53:44,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:53:44,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:44" (1/1) ... [2021-10-13 00:53:44,876 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:53:44,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9548a61-e2c3-47cc-9c67-c3092c50b5ca/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:53:44,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9548a61-e2c3-47cc-9c67-c3092c50b5ca/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 00:53:44,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9548a61-e2c3-47cc-9c67-c3092c50b5ca/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 00:53:44,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 00:53:44,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-13 00:53:44,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:53:44,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 00:53:44,982 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-13 00:53:44,982 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-13 00:53:44,982 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-13 00:53:44,982 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-13 00:53:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-13 00:53:44,983 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-13 00:53:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:53:44,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-13 00:53:44,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:53:44,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:53:44,986 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-13 00:53:47,354 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:53:47,356 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-13 00:53:47,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:53:47 BoogieIcfgContainer [2021-10-13 00:53:47,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:53:47,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 00:53:47,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 00:53:47,370 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 00:53:47,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:53:43" (1/3) ... [2021-10-13 00:53:47,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f658a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:53:47, skipping insertion in model container [2021-10-13 00:53:47,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:53:44" (2/3) ... [2021-10-13 00:53:47,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f658a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:53:47, skipping insertion in model container [2021-10-13 00:53:47,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:53:47" (3/3) ... [2021-10-13 00:53:47,380 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc.i [2021-10-13 00:53:47,387 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-13 00:53:47,388 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 00:53:47,388 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-13 00:53:47,388 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-13 00:53:47,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,443 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,444 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,445 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,445 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,445 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,446 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,447 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,448 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,461 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,461 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,463 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,463 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,471 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,471 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,472 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,472 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,488 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,490 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,502 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,511 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,517 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,518 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,519 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:53:47,521 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-13 00:53:47,606 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 00:53:47,621 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 00:53:47,621 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-10-13 00:53:47,648 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-13 00:53:47,664 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 225 flow [2021-10-13 00:53:47,667 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 225 flow [2021-10-13 00:53:47,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2021-10-13 00:53:47,729 INFO L129 PetriNetUnfolder]: 2/102 cut-off events. [2021-10-13 00:53:47,729 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-13 00:53:47,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-10-13 00:53:47,739 INFO L116 LiptonReduction]: Number of co-enabled transitions 1876 [2021-10-13 00:54:11,908 INFO L131 LiptonReduction]: Checked pairs total: 5130 [2021-10-13 00:54:11,909 INFO L133 LiptonReduction]: Total number of compositions: 91 [2021-10-13 00:54:11,924 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2021-10-13 00:54:12,029 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 724 states, 721 states have (on average 3.116504854368932) internal successors, (2247), 723 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:12,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 724 states, 721 states have (on average 3.116504854368932) internal successors, (2247), 723 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-13 00:54:12,042 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:54:12,043 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-13 00:54:12,044 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:54:12,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:54:12,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1084459, now seen corresponding path program 1 times [2021-10-13 00:54:12,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:54:12,065 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609195208] [2021-10-13 00:54:12,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:54:12,067 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:54:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:54:12,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:54:12,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:54:12,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609195208] [2021-10-13 00:54:12,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609195208] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:54:12,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:54:12,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 00:54:12,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012690278] [2021-10-13 00:54:12,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:54:12,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:54:12,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:54:12,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:54:12,543 INFO L87 Difference]: Start difference. First operand has 724 states, 721 states have (on average 3.116504854368932) internal successors, (2247), 723 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:12,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:54:12,669 INFO L93 Difference]: Finished difference Result 587 states and 1790 transitions. [2021-10-13 00:54:12,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:54:12,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-10-13 00:54:12,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:54:12,700 INFO L225 Difference]: With dead ends: 587 [2021-10-13 00:54:12,701 INFO L226 Difference]: Without dead ends: 562 [2021-10-13 00:54:12,702 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:54:12,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2021-10-13 00:54:12,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2021-10-13 00:54:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 561 states have (on average 3.0748663101604277) internal successors, (1725), 561 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2021-10-13 00:54:12,893 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3 [2021-10-13 00:54:12,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:54:12,894 INFO L470 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2021-10-13 00:54:12,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:12,895 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2021-10-13 00:54:12,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 00:54:12,900 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:54:12,900 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:54:12,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 00:54:12,901 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:54:12,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:54:12,907 INFO L82 PathProgramCache]: Analyzing trace with hash -542242882, now seen corresponding path program 1 times [2021-10-13 00:54:12,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:54:12,908 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323926848] [2021-10-13 00:54:12,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:54:12,909 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:54:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:54:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:54:13,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:54:13,234 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323926848] [2021-10-13 00:54:13,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323926848] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:54:13,236 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:54:13,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 00:54:13,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208582534] [2021-10-13 00:54:13,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:54:13,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:54:13,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:54:13,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:54:13,249 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:13,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:54:13,286 INFO L93 Difference]: Finished difference Result 552 states and 1687 transitions. [2021-10-13 00:54:13,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:54:13,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-13 00:54:13,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:54:13,295 INFO L225 Difference]: With dead ends: 552 [2021-10-13 00:54:13,296 INFO L226 Difference]: Without dead ends: 552 [2021-10-13 00:54:13,296 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:54:13,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2021-10-13 00:54:13,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2021-10-13 00:54:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 3.061705989110708) internal successors, (1687), 551 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:13,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1687 transitions. [2021-10-13 00:54:13,342 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1687 transitions. Word has length 9 [2021-10-13 00:54:13,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:54:13,343 INFO L470 AbstractCegarLoop]: Abstraction has 552 states and 1687 transitions. [2021-10-13 00:54:13,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:13,344 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1687 transitions. [2021-10-13 00:54:13,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 00:54:13,356 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:54:13,357 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:54:13,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 00:54:13,358 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:54:13,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:54:13,359 INFO L82 PathProgramCache]: Analyzing trace with hash -505538032, now seen corresponding path program 1 times [2021-10-13 00:54:13,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:54:13,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981873788] [2021-10-13 00:54:13,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:54:13,360 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:54:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:54:13,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-13 00:54:13,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:54:13,583 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981873788] [2021-10-13 00:54:13,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981873788] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:54:13,583 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:54:13,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 00:54:13,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616457427] [2021-10-13 00:54:13,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:54:13,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:54:13,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:54:13,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:54:13,597 INFO L87 Difference]: Start difference. First operand 552 states and 1687 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:13,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:54:13,618 INFO L93 Difference]: Finished difference Result 544 states and 1657 transitions. [2021-10-13 00:54:13,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:54:13,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-13 00:54:13,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:54:13,628 INFO L225 Difference]: With dead ends: 544 [2021-10-13 00:54:13,628 INFO L226 Difference]: Without dead ends: 544 [2021-10-13 00:54:13,630 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:54:13,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2021-10-13 00:54:13,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2021-10-13 00:54:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 3.0515653775322282) internal successors, (1657), 543 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:13,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1657 transitions. [2021-10-13 00:54:13,666 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1657 transitions. Word has length 10 [2021-10-13 00:54:13,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:54:13,666 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 1657 transitions. [2021-10-13 00:54:13,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:13,667 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1657 transitions. [2021-10-13 00:54:13,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 00:54:13,676 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:54:13,676 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:54:13,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 00:54:13,678 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:54:13,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:54:13,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1506737750, now seen corresponding path program 1 times [2021-10-13 00:54:13,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:54:13,679 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500730847] [2021-10-13 00:54:13,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:54:13,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:54:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:54:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:54:13,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:54:13,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500730847] [2021-10-13 00:54:13,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500730847] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:54:13,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:54:13,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:54:13,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780493071] [2021-10-13 00:54:13,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:54:13,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:54:13,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:54:13,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:54:13,929 INFO L87 Difference]: Start difference. First operand 544 states and 1657 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:54:13,990 INFO L93 Difference]: Finished difference Result 541 states and 1645 transitions. [2021-10-13 00:54:13,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:54:13,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-10-13 00:54:13,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:54:13,999 INFO L225 Difference]: With dead ends: 541 [2021-10-13 00:54:13,999 INFO L226 Difference]: Without dead ends: 541 [2021-10-13 00:54:14,000 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:54:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2021-10-13 00:54:14,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2021-10-13 00:54:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 540 states have (on average 3.0462962962962963) internal successors, (1645), 540 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 1645 transitions. [2021-10-13 00:54:14,035 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 1645 transitions. Word has length 11 [2021-10-13 00:54:14,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:54:14,035 INFO L470 AbstractCegarLoop]: Abstraction has 541 states and 1645 transitions. [2021-10-13 00:54:14,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:14,036 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 1645 transitions. [2021-10-13 00:54:14,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 00:54:14,039 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:54:14,039 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:54:14,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 00:54:14,040 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:54:14,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:54:14,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1526754130, now seen corresponding path program 1 times [2021-10-13 00:54:14,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:54:14,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452444998] [2021-10-13 00:54:14,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:54:14,042 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:54:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:54:14,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:54:14,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:54:14,232 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452444998] [2021-10-13 00:54:14,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452444998] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:54:14,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:54:14,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:54:14,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904127632] [2021-10-13 00:54:14,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:54:14,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:54:14,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:54:14,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:54:14,237 INFO L87 Difference]: Start difference. First operand 541 states and 1645 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:54:14,264 INFO L93 Difference]: Finished difference Result 790 states and 2306 transitions. [2021-10-13 00:54:14,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:54:14,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-13 00:54:14,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:54:14,273 INFO L225 Difference]: With dead ends: 790 [2021-10-13 00:54:14,274 INFO L226 Difference]: Without dead ends: 586 [2021-10-13 00:54:14,274 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:54:14,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2021-10-13 00:54:14,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 529. [2021-10-13 00:54:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 2.909090909090909) internal successors, (1536), 528 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1536 transitions. [2021-10-13 00:54:14,306 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1536 transitions. Word has length 12 [2021-10-13 00:54:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:54:14,306 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 1536 transitions. [2021-10-13 00:54:14,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1536 transitions. [2021-10-13 00:54:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 00:54:14,308 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:54:14,309 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:54:14,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 00:54:14,309 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:54:14,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:54:14,310 INFO L82 PathProgramCache]: Analyzing trace with hash -954281166, now seen corresponding path program 1 times [2021-10-13 00:54:14,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:54:14,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121601447] [2021-10-13 00:54:14,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:54:14,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:54:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:54:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:54:14,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:54:14,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121601447] [2021-10-13 00:54:14,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121601447] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:54:14,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:54:14,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:54:14,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285812274] [2021-10-13 00:54:14,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:54:14,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:54:14,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:54:14,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:54:14,670 INFO L87 Difference]: Start difference. First operand 529 states and 1536 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:14,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:54:14,775 INFO L93 Difference]: Finished difference Result 559 states and 1628 transitions. [2021-10-13 00:54:14,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:54:14,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-13 00:54:14,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:54:14,783 INFO L225 Difference]: With dead ends: 559 [2021-10-13 00:54:14,784 INFO L226 Difference]: Without dead ends: 559 [2021-10-13 00:54:14,784 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.6ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:54:14,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2021-10-13 00:54:14,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2021-10-13 00:54:14,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 2.917562724014337) internal successors, (1628), 558 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:14,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1628 transitions. [2021-10-13 00:54:14,815 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1628 transitions. Word has length 12 [2021-10-13 00:54:14,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:54:14,816 INFO L470 AbstractCegarLoop]: Abstraction has 559 states and 1628 transitions. [2021-10-13 00:54:14,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:14,817 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1628 transitions. [2021-10-13 00:54:14,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 00:54:14,818 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:54:14,819 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:54:14,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 00:54:14,819 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:54:14,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:54:14,820 INFO L82 PathProgramCache]: Analyzing trace with hash -538235342, now seen corresponding path program 1 times [2021-10-13 00:54:14,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:54:14,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698564591] [2021-10-13 00:54:14,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:54:14,826 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:54:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:54:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:54:14,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:54:14,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698564591] [2021-10-13 00:54:14,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698564591] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:54:14,964 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:54:14,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:54:14,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697463236] [2021-10-13 00:54:14,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:54:14,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:54:14,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:54:14,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:54:14,967 INFO L87 Difference]: Start difference. First operand 559 states and 1628 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:15,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:54:15,089 INFO L93 Difference]: Finished difference Result 565 states and 1644 transitions. [2021-10-13 00:54:15,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:54:15,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-13 00:54:15,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:54:15,099 INFO L225 Difference]: With dead ends: 565 [2021-10-13 00:54:15,099 INFO L226 Difference]: Without dead ends: 565 [2021-10-13 00:54:15,101 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 18.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:54:15,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-10-13 00:54:15,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 563. [2021-10-13 00:54:15,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 562 states have (on average 2.916370106761566) internal successors, (1639), 562 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1639 transitions. [2021-10-13 00:54:15,137 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 1639 transitions. Word has length 12 [2021-10-13 00:54:15,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:54:15,138 INFO L470 AbstractCegarLoop]: Abstraction has 563 states and 1639 transitions. [2021-10-13 00:54:15,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:15,139 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 1639 transitions. [2021-10-13 00:54:15,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 00:54:15,141 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:54:15,142 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:54:15,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 00:54:15,142 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:54:15,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:54:15,143 INFO L82 PathProgramCache]: Analyzing trace with hash -535770408, now seen corresponding path program 2 times [2021-10-13 00:54:15,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:54:15,144 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451990220] [2021-10-13 00:54:15,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:54:15,145 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:54:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:54:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:54:15,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:54:15,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451990220] [2021-10-13 00:54:15,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451990220] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:54:15,427 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:54:15,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:54:15,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136915621] [2021-10-13 00:54:15,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:54:15,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:54:15,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:54:15,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:54:15,430 INFO L87 Difference]: Start difference. First operand 563 states and 1639 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:15,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:54:15,553 INFO L93 Difference]: Finished difference Result 569 states and 1633 transitions. [2021-10-13 00:54:15,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:54:15,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-13 00:54:15,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:54:15,562 INFO L225 Difference]: With dead ends: 569 [2021-10-13 00:54:15,562 INFO L226 Difference]: Without dead ends: 569 [2021-10-13 00:54:15,562 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 73.8ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:54:15,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2021-10-13 00:54:15,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2021-10-13 00:54:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 2.875) internal successors, (1633), 568 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:15,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 1633 transitions. [2021-10-13 00:54:15,593 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 1633 transitions. Word has length 12 [2021-10-13 00:54:15,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:54:15,594 INFO L470 AbstractCegarLoop]: Abstraction has 569 states and 1633 transitions. [2021-10-13 00:54:15,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:15,595 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 1633 transitions. [2021-10-13 00:54:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 00:54:15,597 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:54:15,597 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:54:15,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 00:54:15,598 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:54:15,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:54:15,599 INFO L82 PathProgramCache]: Analyzing trace with hash 527017203, now seen corresponding path program 1 times [2021-10-13 00:54:15,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:54:15,606 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628506880] [2021-10-13 00:54:15,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:54:15,607 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:54:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:54:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:54:15,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:54:15,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628506880] [2021-10-13 00:54:15,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628506880] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:54:15,753 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:54:15,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:54:15,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145473011] [2021-10-13 00:54:15,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:54:15,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:54:15,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:54:15,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:54:15,756 INFO L87 Difference]: Start difference. First operand 569 states and 1633 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:54:15,779 INFO L93 Difference]: Finished difference Result 805 states and 2232 transitions. [2021-10-13 00:54:15,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:54:15,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-10-13 00:54:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:54:15,787 INFO L225 Difference]: With dead ends: 805 [2021-10-13 00:54:15,788 INFO L226 Difference]: Without dead ends: 605 [2021-10-13 00:54:15,788 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:54:15,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2021-10-13 00:54:15,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 557. [2021-10-13 00:54:15,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 556 states have (on average 2.741007194244604) internal successors, (1524), 556 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1524 transitions. [2021-10-13 00:54:15,819 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1524 transitions. Word has length 13 [2021-10-13 00:54:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:54:15,820 INFO L470 AbstractCegarLoop]: Abstraction has 557 states and 1524 transitions. [2021-10-13 00:54:15,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1524 transitions. [2021-10-13 00:54:15,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 00:54:15,823 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:54:15,823 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:54:15,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 00:54:15,823 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:54:15,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:54:15,824 INFO L82 PathProgramCache]: Analyzing trace with hash 493419050, now seen corresponding path program 1 times [2021-10-13 00:54:15,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:54:15,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269374044] [2021-10-13 00:54:15,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:54:15,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:54:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:54:16,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:54:16,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:54:16,124 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269374044] [2021-10-13 00:54:16,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269374044] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:54:16,124 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:54:16,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:54:16,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772852920] [2021-10-13 00:54:16,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:54:16,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:54:16,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:54:16,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:54:16,127 INFO L87 Difference]: Start difference. First operand 557 states and 1524 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:16,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:54:16,285 INFO L93 Difference]: Finished difference Result 573 states and 1561 transitions. [2021-10-13 00:54:16,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:54:16,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-10-13 00:54:16,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:54:16,293 INFO L225 Difference]: With dead ends: 573 [2021-10-13 00:54:16,294 INFO L226 Difference]: Without dead ends: 573 [2021-10-13 00:54:16,295 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 48.8ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:54:16,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2021-10-13 00:54:16,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 558. [2021-10-13 00:54:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 2.725314183123878) internal successors, (1518), 557 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:16,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1518 transitions. [2021-10-13 00:54:16,326 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1518 transitions. Word has length 13 [2021-10-13 00:54:16,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:54:16,327 INFO L470 AbstractCegarLoop]: Abstraction has 558 states and 1518 transitions. [2021-10-13 00:54:16,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1518 transitions. [2021-10-13 00:54:16,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 00:54:16,329 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:54:16,329 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:54:16,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 00:54:16,330 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:54:16,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:54:16,331 INFO L82 PathProgramCache]: Analyzing trace with hash 492138037, now seen corresponding path program 1 times [2021-10-13 00:54:16,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:54:16,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868563172] [2021-10-13 00:54:16,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:54:16,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:54:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:54:16,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-13 00:54:16,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:54:16,764 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868563172] [2021-10-13 00:54:16,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868563172] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:54:16,765 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:54:16,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:54:16,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126324396] [2021-10-13 00:54:16,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:54:16,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:54:16,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:54:16,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:54:16,767 INFO L87 Difference]: Start difference. First operand 558 states and 1518 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:16,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:54:16,941 INFO L93 Difference]: Finished difference Result 548 states and 1485 transitions. [2021-10-13 00:54:16,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:54:16,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-10-13 00:54:16,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:54:16,950 INFO L225 Difference]: With dead ends: 548 [2021-10-13 00:54:16,950 INFO L226 Difference]: Without dead ends: 548 [2021-10-13 00:54:16,951 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 132.7ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:54:16,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2021-10-13 00:54:16,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 546. [2021-10-13 00:54:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 2.7155963302752295) internal successors, (1480), 545 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1480 transitions. [2021-10-13 00:54:16,984 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1480 transitions. Word has length 13 [2021-10-13 00:54:16,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:54:16,985 INFO L470 AbstractCegarLoop]: Abstraction has 546 states and 1480 transitions. [2021-10-13 00:54:16,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:16,986 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1480 transitions. [2021-10-13 00:54:16,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 00:54:16,988 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:54:16,988 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:54:16,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 00:54:16,989 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:54:16,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:54:16,989 INFO L82 PathProgramCache]: Analyzing trace with hash 494573180, now seen corresponding path program 2 times [2021-10-13 00:54:16,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:54:16,990 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23431277] [2021-10-13 00:54:16,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:54:16,990 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:54:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:54:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:54:17,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:54:17,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23431277] [2021-10-13 00:54:17,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23431277] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:54:17,202 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:54:17,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:54:17,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474572844] [2021-10-13 00:54:17,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:54:17,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:54:17,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:54:17,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:54:17,205 INFO L87 Difference]: Start difference. First operand 546 states and 1480 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:54:17,355 INFO L93 Difference]: Finished difference Result 570 states and 1542 transitions. [2021-10-13 00:54:17,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:54:17,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-10-13 00:54:17,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:54:17,364 INFO L225 Difference]: With dead ends: 570 [2021-10-13 00:54:17,365 INFO L226 Difference]: Without dead ends: 570 [2021-10-13 00:54:17,365 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 45.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:54:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2021-10-13 00:54:17,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 543. [2021-10-13 00:54:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 2.715867158671587) internal successors, (1472), 542 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:17,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1472 transitions. [2021-10-13 00:54:17,397 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 1472 transitions. Word has length 13 [2021-10-13 00:54:17,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:54:17,400 INFO L470 AbstractCegarLoop]: Abstraction has 543 states and 1472 transitions. [2021-10-13 00:54:17,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:17,400 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 1472 transitions. [2021-10-13 00:54:17,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 00:54:17,402 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:54:17,402 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:54:17,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 00:54:17,403 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:54:17,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:54:17,404 INFO L82 PathProgramCache]: Analyzing trace with hash 570984770, now seen corresponding path program 3 times [2021-10-13 00:54:17,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:54:17,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81756577] [2021-10-13 00:54:17,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:54:17,405 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:54:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:54:17,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:54:17,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:54:17,665 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81756577] [2021-10-13 00:54:17,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81756577] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:54:17,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:54:17,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:54:17,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429712971] [2021-10-13 00:54:17,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:54:17,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:54:17,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:54:17,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:54:17,668 INFO L87 Difference]: Start difference. First operand 543 states and 1472 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:17,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:54:17,845 INFO L93 Difference]: Finished difference Result 635 states and 1690 transitions. [2021-10-13 00:54:17,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:54:17,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-10-13 00:54:17,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:54:17,853 INFO L225 Difference]: With dead ends: 635 [2021-10-13 00:54:17,853 INFO L226 Difference]: Without dead ends: 599 [2021-10-13 00:54:17,854 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 76.6ms TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:54:17,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-10-13 00:54:17,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 557. [2021-10-13 00:54:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 556 states have (on average 2.6744604316546763) internal successors, (1487), 556 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:17,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1487 transitions. [2021-10-13 00:54:17,885 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1487 transitions. Word has length 13 [2021-10-13 00:54:17,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:54:17,886 INFO L470 AbstractCegarLoop]: Abstraction has 557 states and 1487 transitions. [2021-10-13 00:54:17,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:17,886 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1487 transitions. [2021-10-13 00:54:17,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-13 00:54:17,888 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:54:17,888 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:54:17,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 00:54:17,889 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:54:17,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:54:17,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1011677201, now seen corresponding path program 1 times [2021-10-13 00:54:17,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:54:17,890 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579146477] [2021-10-13 00:54:17,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:54:17,890 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:54:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:54:18,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:54:18,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:54:18,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579146477] [2021-10-13 00:54:18,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579146477] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:54:18,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:54:18,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:54:18,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208651611] [2021-10-13 00:54:18,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:54:18,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:54:18,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:54:18,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:54:18,031 INFO L87 Difference]: Start difference. First operand 557 states and 1487 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:18,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:54:18,075 INFO L93 Difference]: Finished difference Result 535 states and 1252 transitions. [2021-10-13 00:54:18,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:54:18,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-10-13 00:54:18,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:54:18,080 INFO L225 Difference]: With dead ends: 535 [2021-10-13 00:54:18,080 INFO L226 Difference]: Without dead ends: 390 [2021-10-13 00:54:18,082 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:54:18,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-10-13 00:54:18,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2021-10-13 00:54:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 2.2802056555269923) internal successors, (887), 389 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 887 transitions. [2021-10-13 00:54:18,102 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 887 transitions. Word has length 14 [2021-10-13 00:54:18,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:54:18,102 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 887 transitions. [2021-10-13 00:54:18,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:18,102 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 887 transitions. [2021-10-13 00:54:18,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 00:54:18,104 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:54:18,104 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:54:18,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 00:54:18,105 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:54:18,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:54:18,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1243408195, now seen corresponding path program 1 times [2021-10-13 00:54:18,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:54:18,106 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471536886] [2021-10-13 00:54:18,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:54:18,106 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:54:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:54:18,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:54:18,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:54:18,232 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471536886] [2021-10-13 00:54:18,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471536886] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:54:18,233 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:54:18,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:54:18,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491866924] [2021-10-13 00:54:18,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:54:18,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:54:18,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:54:18,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:54:18,237 INFO L87 Difference]: Start difference. First operand 390 states and 887 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:18,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:54:18,279 INFO L93 Difference]: Finished difference Result 318 states and 665 transitions. [2021-10-13 00:54:18,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:54:18,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-10-13 00:54:18,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:54:18,283 INFO L225 Difference]: With dead ends: 318 [2021-10-13 00:54:18,283 INFO L226 Difference]: Without dead ends: 241 [2021-10-13 00:54:18,287 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 14.4ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:54:18,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2021-10-13 00:54:18,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 215. [2021-10-13 00:54:18,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 2.0700934579439254) internal successors, (443), 214 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:18,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 443 transitions. [2021-10-13 00:54:18,298 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 443 transitions. Word has length 15 [2021-10-13 00:54:18,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:54:18,298 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 443 transitions. [2021-10-13 00:54:18,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:18,299 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 443 transitions. [2021-10-13 00:54:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-13 00:54:18,300 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:54:18,300 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:54:18,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 00:54:18,300 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:54:18,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:54:18,304 INFO L82 PathProgramCache]: Analyzing trace with hash 130417411, now seen corresponding path program 1 times [2021-10-13 00:54:18,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:54:18,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742023528] [2021-10-13 00:54:18,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:54:18,305 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:54:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:54:18,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:54:18,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:54:18,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742023528] [2021-10-13 00:54:18,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742023528] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:54:18,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:54:18,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:54:18,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862918266] [2021-10-13 00:54:18,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:54:18,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:54:18,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:54:18,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:54:18,679 INFO L87 Difference]: Start difference. First operand 215 states and 443 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:54:18,783 INFO L93 Difference]: Finished difference Result 276 states and 543 transitions. [2021-10-13 00:54:18,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:54:18,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-13 00:54:18,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:54:18,786 INFO L225 Difference]: With dead ends: 276 [2021-10-13 00:54:18,787 INFO L226 Difference]: Without dead ends: 208 [2021-10-13 00:54:18,787 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 85.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:54:18,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-10-13 00:54:18,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 205. [2021-10-13 00:54:18,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.9852941176470589) internal successors, (405), 204 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:18,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 405 transitions. [2021-10-13 00:54:18,798 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 405 transitions. Word has length 18 [2021-10-13 00:54:18,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:54:18,799 INFO L470 AbstractCegarLoop]: Abstraction has 205 states and 405 transitions. [2021-10-13 00:54:18,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 405 transitions. [2021-10-13 00:54:18,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-13 00:54:18,801 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:54:18,801 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:54:18,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 00:54:18,801 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:54:18,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:54:18,802 INFO L82 PathProgramCache]: Analyzing trace with hash -930717610, now seen corresponding path program 1 times [2021-10-13 00:54:18,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:54:18,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213920904] [2021-10-13 00:54:18,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:54:18,803 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:54:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:54:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:54:18,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:54:18,974 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213920904] [2021-10-13 00:54:18,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213920904] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:54:18,975 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:54:18,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:54:18,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145990743] [2021-10-13 00:54:18,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:54:18,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:54:18,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:54:18,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:54:18,977 INFO L87 Difference]: Start difference. First operand 205 states and 405 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:19,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:54:19,029 INFO L93 Difference]: Finished difference Result 184 states and 364 transitions. [2021-10-13 00:54:19,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:54:19,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-13 00:54:19,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:54:19,031 INFO L225 Difference]: With dead ends: 184 [2021-10-13 00:54:19,031 INFO L226 Difference]: Without dead ends: 98 [2021-10-13 00:54:19,032 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 26.4ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:54:19,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-10-13 00:54:19,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 86. [2021-10-13 00:54:19,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.9411764705882353) internal successors, (165), 85 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 165 transitions. [2021-10-13 00:54:19,037 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 165 transitions. Word has length 18 [2021-10-13 00:54:19,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:54:19,038 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 165 transitions. [2021-10-13 00:54:19,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:19,038 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 165 transitions. [2021-10-13 00:54:19,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:54:19,039 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:54:19,039 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:54:19,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 00:54:19,040 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:54:19,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:54:19,041 INFO L82 PathProgramCache]: Analyzing trace with hash 35734280, now seen corresponding path program 1 times [2021-10-13 00:54:19,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:54:19,041 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621334668] [2021-10-13 00:54:19,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:54:19,042 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:54:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:54:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:54:19,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:54:19,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621334668] [2021-10-13 00:54:19,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621334668] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:54:19,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:54:19,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 00:54:19,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961036874] [2021-10-13 00:54:19,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 00:54:19,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:54:19,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 00:54:19,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-10-13 00:54:19,681 INFO L87 Difference]: Start difference. First operand 86 states and 165 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:19,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:54:19,963 INFO L93 Difference]: Finished difference Result 106 states and 200 transitions. [2021-10-13 00:54:19,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:54:19,964 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-13 00:54:19,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:54:19,965 INFO L225 Difference]: With dead ends: 106 [2021-10-13 00:54:19,966 INFO L226 Difference]: Without dead ends: 62 [2021-10-13 00:54:19,966 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 295.4ms TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:54:19,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-10-13 00:54:19,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-10-13 00:54:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.7868852459016393) internal successors, (109), 61 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 109 transitions. [2021-10-13 00:54:19,971 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 109 transitions. Word has length 21 [2021-10-13 00:54:19,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:54:19,971 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 109 transitions. [2021-10-13 00:54:19,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:54:19,972 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 109 transitions. [2021-10-13 00:54:19,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 00:54:19,973 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:54:19,974 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:54:19,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 00:54:19,974 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:54:19,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:54:19,975 INFO L82 PathProgramCache]: Analyzing trace with hash 136823560, now seen corresponding path program 2 times [2021-10-13 00:54:19,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:54:19,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477311231] [2021-10-13 00:54:19,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:54:19,976 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:54:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:54:20,064 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:54:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:54:20,196 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:54:20,197 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 00:54:20,198 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:54:20,200 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:54:20,201 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-13 00:54:20,201 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-13 00:54:20,202 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-13 00:54:20,202 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:54:20,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 00:54:20,211 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-13 00:54:20,211 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 00:54:20,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:54:20 BasicIcfg [2021-10-13 00:54:20,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 00:54:20,372 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:54:20,372 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:54:20,373 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:54:20,373 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:53:47" (3/4) ... [2021-10-13 00:54:20,376 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 00:54:20,535 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9548a61-e2c3-47cc-9c67-c3092c50b5ca/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:54:20,535 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:54:20,537 INFO L168 Benchmark]: Toolchain (without parser) took 36854.70 ms. Allocated memory was 96.5 MB in the beginning and 222.3 MB in the end (delta: 125.8 MB). Free memory was 67.7 MB in the beginning and 165.4 MB in the end (delta: -97.7 MB). Peak memory consumption was 29.7 MB. Max. memory is 16.1 GB. [2021-10-13 00:54:20,537 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 96.5 MB. Free memory is still 65.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:54:20,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1009.72 ms. Allocated memory was 96.5 MB in the beginning and 119.5 MB in the end (delta: 23.1 MB). Free memory was 67.6 MB in the beginning and 94.0 MB in the end (delta: -26.4 MB). Peak memory consumption was 28.7 MB. Max. memory is 16.1 GB. [2021-10-13 00:54:20,539 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.86 ms. Allocated memory is still 119.5 MB. Free memory was 93.9 MB in the beginning and 92.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. [2021-10-13 00:54:20,539 INFO L168 Benchmark]: Boogie Preprocessor took 46.92 ms. Allocated memory is still 119.5 MB. Free memory was 92.3 MB in the beginning and 90.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:54:20,540 INFO L168 Benchmark]: RCFGBuilder took 2500.42 ms. Allocated memory is still 119.5 MB. Free memory was 89.6 MB in the beginning and 66.9 MB in the end (delta: 22.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 16.1 GB. [2021-10-13 00:54:20,540 INFO L168 Benchmark]: TraceAbstraction took 33006.94 ms. Allocated memory was 119.5 MB in the beginning and 222.3 MB in the end (delta: 102.8 MB). Free memory was 66.9 MB in the beginning and 178.0 MB in the end (delta: -111.1 MB). Peak memory consumption was 115.0 MB. Max. memory is 16.1 GB. [2021-10-13 00:54:20,541 INFO L168 Benchmark]: Witness Printer took 162.86 ms. Allocated memory is still 222.3 MB. Free memory was 178.0 MB in the beginning and 165.4 MB in the end (delta: 12.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 00:54:20,544 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.27 ms. Allocated memory is still 96.5 MB. Free memory is still 65.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 1009.72 ms. Allocated memory was 96.5 MB in the beginning and 119.5 MB in the end (delta: 23.1 MB). Free memory was 67.6 MB in the beginning and 94.0 MB in the end (delta: -26.4 MB). Peak memory consumption was 28.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 117.86 ms. Allocated memory is still 119.5 MB. Free memory was 93.9 MB in the beginning and 92.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 46.92 ms. Allocated memory is still 119.5 MB. Free memory was 92.3 MB in the beginning and 90.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2500.42 ms. Allocated memory is still 119.5 MB. Free memory was 89.6 MB in the beginning and 66.9 MB in the end (delta: 22.7 MB). Peak memory consumption was 51.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 33006.94 ms. Allocated memory was 119.5 MB in the beginning and 222.3 MB in the end (delta: 102.8 MB). Free memory was 66.9 MB in the beginning and 178.0 MB in the end (delta: -111.1 MB). Peak memory consumption was 115.0 MB. Max. memory is 16.1 GB. * Witness Printer took 162.86 ms. Allocated memory is still 222.3 MB. Free memory was 178.0 MB in the beginning and 165.4 MB in the end (delta: 12.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24241.4ms, 113 PlacesBefore, 36 PlacesAfterwards, 105 TransitionsBefore, 26 TransitionsAfterwards, 1876 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 91 TotalNumberOfCompositions, 5130 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2364, positive: 2186, positive conditional: 0, positive unconditional: 2186, negative: 178, negative conditional: 0, negative unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1376, positive: 1306, positive conditional: 0, positive unconditional: 1306, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1376, positive: 1290, positive conditional: 0, positive unconditional: 1290, negative: 86, negative conditional: 0, negative unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 86, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1329, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 1284, negative conditional: 0, negative unconditional: 1284, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2364, positive: 880, positive conditional: 0, positive unconditional: 880, negative: 108, negative conditional: 0, negative unconditional: 108, unknown: 1376, unknown conditional: 0, unknown unconditional: 1376] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 118, Positive conditional cache size: 0, Positive unconditional cache size: 118, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=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=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=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=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 817]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 32603.1ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 66.1ms, AutomataDifference: 2066.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 24407.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 418 SDtfs, 399 SDslu, 662 SDs, 0 SdLazy, 447 SolverSat, 125 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1096.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 905.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=724occurred in iteration=0, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 622.6ms AutomataMinimizationTime, 18 MinimizatonAttempts, 234 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 111.2ms SsaConstructionTime, 1294.4ms SatisfiabilityAnalysisTime, 3368.4ms InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 2654 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-13 00:54:20,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9548a61-e2c3-47cc-9c67-c3092c50b5ca/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...