./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe023_rmo.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_fe47a012-d469-46e5-a70e-60f243f29047/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe47a012-d469-46e5-a70e-60f243f29047/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_fe47a012-d469-46e5-a70e-60f243f29047/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe47a012-d469-46e5-a70e-60f243f29047/bin/uautomizer-WNIpwEf4Nt/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe023_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe47a012-d469-46e5-a70e-60f243f29047/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_fe47a012-d469-46e5-a70e-60f243f29047/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 225581ede62ae442ca336e20077c7f5befcbb231 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:35:06,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 00:35:06,844 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 00:35:06,895 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 00:35:06,896 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 00:35:06,897 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 00:35:06,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 00:35:06,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 00:35:06,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 00:35:06,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 00:35:06,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 00:35:06,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 00:35:06,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 00:35:06,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 00:35:06,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 00:35:06,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 00:35:06,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 00:35:06,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 00:35:06,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 00:35:06,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 00:35:06,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 00:35:06,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 00:35:06,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 00:35:06,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 00:35:06,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 00:35:06,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 00:35:06,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 00:35:06,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 00:35:06,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 00:35:06,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 00:35:06,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 00:35:06,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 00:35:06,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 00:35:06,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 00:35:06,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 00:35:06,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 00:35:06,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 00:35:06,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 00:35:06,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 00:35:06,953 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 00:35:06,957 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 00:35:06,958 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe47a012-d469-46e5-a70e-60f243f29047/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 00:35:07,010 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 00:35:07,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 00:35:07,011 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 00:35:07,012 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 00:35:07,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 00:35:07,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 00:35:07,014 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 00:35:07,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 00:35:07,015 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 00:35:07,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 00:35:07,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 00:35:07,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 00:35:07,017 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 00:35:07,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 00:35:07,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 00:35:07,018 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 00:35:07,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 00:35:07,018 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 00:35:07,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 00:35:07,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 00:35:07,019 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 00:35:07,019 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 00:35:07,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:35:07,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 00:35:07,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 00:35:07,020 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 00:35:07,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 00:35:07,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 00:35:07,021 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 00:35:07,022 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 00:35:07,023 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_fe47a012-d469-46e5-a70e-60f243f29047/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_fe47a012-d469-46e5-a70e-60f243f29047/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 -> 225581ede62ae442ca336e20077c7f5befcbb231 [2021-10-13 00:35:07,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 00:35:07,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 00:35:07,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 00:35:07,296 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 00:35:07,297 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 00:35:07,298 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe47a012-d469-46e5-a70e-60f243f29047/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/pthread-wmm/safe023_rmo.oepc.i [2021-10-13 00:35:07,424 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe47a012-d469-46e5-a70e-60f243f29047/bin/uautomizer-WNIpwEf4Nt/data/d38a0c78c/fdbf05bbe1464b9892387b5df63dde29/FLAG803ec2681 [2021-10-13 00:35:08,097 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 00:35:08,098 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe47a012-d469-46e5-a70e-60f243f29047/sv-benchmarks/c/pthread-wmm/safe023_rmo.oepc.i [2021-10-13 00:35:08,146 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe47a012-d469-46e5-a70e-60f243f29047/bin/uautomizer-WNIpwEf4Nt/data/d38a0c78c/fdbf05bbe1464b9892387b5df63dde29/FLAG803ec2681 [2021-10-13 00:35:08,333 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe47a012-d469-46e5-a70e-60f243f29047/bin/uautomizer-WNIpwEf4Nt/data/d38a0c78c/fdbf05bbe1464b9892387b5df63dde29 [2021-10-13 00:35:08,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 00:35:08,340 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 00:35:08,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 00:35:08,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 00:35:08,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 00:35:08,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:35:08" (1/1) ... [2021-10-13 00:35:08,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@482f75d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:35:08, skipping insertion in model container [2021-10-13 00:35:08,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:35:08" (1/1) ... [2021-10-13 00:35:08,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 00:35:08,441 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 00:35:08,688 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_fe47a012-d469-46e5-a70e-60f243f29047/sv-benchmarks/c/pthread-wmm/safe023_rmo.oepc.i[993,1006] [2021-10-13 00:35:09,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:35:09,114 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 00:35:09,129 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_fe47a012-d469-46e5-a70e-60f243f29047/sv-benchmarks/c/pthread-wmm/safe023_rmo.oepc.i[993,1006] [2021-10-13 00:35:09,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 00:35:09,304 INFO L208 MainTranslator]: Completed translation [2021-10-13 00:35:09,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:35:09 WrapperNode [2021-10-13 00:35:09,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 00:35:09,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 00:35:09,310 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 00:35:09,310 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 00:35:09,319 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:35:09" (1/1) ... [2021-10-13 00:35:09,364 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:35:09" (1/1) ... [2021-10-13 00:35:09,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 00:35:09,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 00:35:09,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 00:35:09,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 00:35:09,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:35:09" (1/1) ... [2021-10-13 00:35:09,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:35:09" (1/1) ... [2021-10-13 00:35:09,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:35:09" (1/1) ... [2021-10-13 00:35:09,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:35:09" (1/1) ... [2021-10-13 00:35:09,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:35:09" (1/1) ... [2021-10-13 00:35:09,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:35:09" (1/1) ... [2021-10-13 00:35:09,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:35:09" (1/1) ... [2021-10-13 00:35:09,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 00:35:09,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 00:35:09,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 00:35:09,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 00:35:09,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:35:09" (1/1) ... [2021-10-13 00:35:09,528 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 00:35:09,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe47a012-d469-46e5-a70e-60f243f29047/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 00:35:09,564 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe47a012-d469-46e5-a70e-60f243f29047/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 00:35:09,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe47a012-d469-46e5-a70e-60f243f29047/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 00:35:09,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 00:35:09,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-13 00:35:09,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 00:35:09,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 00:35:09,619 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-13 00:35:09,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-13 00:35:09,620 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-13 00:35:09,620 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-13 00:35:09,620 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-13 00:35:09,620 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-13 00:35:09,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 00:35:09,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-13 00:35:09,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 00:35:09,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 00:35:09,623 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:35:13,315 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 00:35:13,315 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-13 00:35:13,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:35:13 BoogieIcfgContainer [2021-10-13 00:35:13,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 00:35:13,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 00:35:13,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 00:35:13,325 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 00:35:13,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:35:08" (1/3) ... [2021-10-13 00:35:13,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aec8753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:35:13, skipping insertion in model container [2021-10-13 00:35:13,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:35:09" (2/3) ... [2021-10-13 00:35:13,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aec8753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:35:13, skipping insertion in model container [2021-10-13 00:35:13,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:35:13" (3/3) ... [2021-10-13 00:35:13,329 INFO L111 eAbstractionObserver]: Analyzing ICFG safe023_rmo.oepc.i [2021-10-13 00:35:13,336 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-13 00:35:13,336 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 00:35:13,337 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-13 00:35:13,337 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-13 00:35:13,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,391 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,391 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,392 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,393 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,397 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,398 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,399 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,400 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,409 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,409 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,409 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,409 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,417 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,419 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,420 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,421 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,424 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,425 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,425 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,425 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,426 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,426 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,426 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,426 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,427 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,427 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,428 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,428 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,428 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,434 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,435 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,435 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,436 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,436 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,437 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,438 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,460 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,460 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,460 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,466 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,468 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,477 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,478 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,485 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,485 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,485 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-13 00:35:13,489 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-13 00:35:13,539 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 00:35:13,545 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:35:13,546 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-10-13 00:35:13,564 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-13 00:35:13,577 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 108 transitions, 231 flow [2021-10-13 00:35:13,579 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 108 transitions, 231 flow [2021-10-13 00:35:13,581 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2021-10-13 00:35:13,631 INFO L129 PetriNetUnfolder]: 2/105 cut-off events. [2021-10-13 00:35:13,631 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-13 00:35:13,635 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2021-10-13 00:35:13,638 INFO L116 LiptonReduction]: Number of co-enabled transitions 1976 [2021-10-13 00:35:32,745 INFO L131 LiptonReduction]: Checked pairs total: 5141 [2021-10-13 00:35:32,745 INFO L133 LiptonReduction]: Total number of compositions: 93 [2021-10-13 00:35:32,756 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 27 transitions, 69 flow [2021-10-13 00:35:32,843 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 866 states, 863 states have (on average 3.1517960602549246) internal successors, (2720), 865 states have internal predecessors, (2720), 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:35:32,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 866 states, 863 states have (on average 3.1517960602549246) internal successors, (2720), 865 states have internal predecessors, (2720), 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:35:32,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-13 00:35:32,862 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:35:32,863 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-13 00:35:32,863 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:35:32,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:35:32,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1755971223, now seen corresponding path program 1 times [2021-10-13 00:35:32,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:35:32,875 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908398816] [2021-10-13 00:35:32,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:35:32,877 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:35:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:35:33,110 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:35:33,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:35:33,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908398816] [2021-10-13 00:35:33,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908398816] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:35:33,111 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:35:33,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 00:35:33,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238490548] [2021-10-13 00:35:33,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:35:33,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:35:33,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:35:33,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:35:33,137 INFO L87 Difference]: Start difference. First operand has 866 states, 863 states have (on average 3.1517960602549246) internal successors, (2720), 865 states have internal predecessors, (2720), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:35:33,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:35:33,267 INFO L93 Difference]: Finished difference Result 704 states and 2171 transitions. [2021-10-13 00:35:33,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:35:33,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2021-10-13 00:35:33,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:35:33,291 INFO L225 Difference]: With dead ends: 704 [2021-10-13 00:35:33,291 INFO L226 Difference]: Without dead ends: 674 [2021-10-13 00:35:33,292 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:35:33,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2021-10-13 00:35:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2021-10-13 00:35:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 673 states have (on average 3.1084695393759287) internal successors, (2092), 673 states have internal predecessors, (2092), 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:35:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 2092 transitions. [2021-10-13 00:35:33,394 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 2092 transitions. Word has length 5 [2021-10-13 00:35:33,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:35:33,394 INFO L470 AbstractCegarLoop]: Abstraction has 674 states and 2092 transitions. [2021-10-13 00:35:33,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:35:33,395 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 2092 transitions. [2021-10-13 00:35:33,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 00:35:33,396 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:35:33,397 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:35:33,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 00:35:33,397 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:35:33,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:35:33,398 INFO L82 PathProgramCache]: Analyzing trace with hash -154336645, now seen corresponding path program 1 times [2021-10-13 00:35:33,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:35:33,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476817098] [2021-10-13 00:35:33,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:35:33,399 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:35:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:35:33,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:35:33,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:35:33,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476817098] [2021-10-13 00:35:33,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476817098] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:35:33,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:35:33,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 00:35:33,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561882042] [2021-10-13 00:35:33,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:35:33,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:35:33,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:35:33,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:35:33,681 INFO L87 Difference]: Start difference. First operand 674 states and 2092 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:35:33,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:35:33,699 INFO L93 Difference]: Finished difference Result 644 states and 1983 transitions. [2021-10-13 00:35:33,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:35:33,705 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:35:33,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:35:33,713 INFO L225 Difference]: With dead ends: 644 [2021-10-13 00:35:33,717 INFO L226 Difference]: Without dead ends: 644 [2021-10-13 00:35:33,718 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:35:33,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2021-10-13 00:35:33,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2021-10-13 00:35:33,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 3.08398133748056) internal successors, (1983), 643 states have internal predecessors, (1983), 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:35:33,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1983 transitions. [2021-10-13 00:35:33,775 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1983 transitions. Word has length 9 [2021-10-13 00:35:33,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:35:33,776 INFO L470 AbstractCegarLoop]: Abstraction has 644 states and 1983 transitions. [2021-10-13 00:35:33,777 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:35:33,777 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1983 transitions. [2021-10-13 00:35:33,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 00:35:33,782 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:35:33,782 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:35:33,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 00:35:33,783 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:35:33,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:35:33,784 INFO L82 PathProgramCache]: Analyzing trace with hash -491422008, now seen corresponding path program 1 times [2021-10-13 00:35:33,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:35:33,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826961044] [2021-10-13 00:35:33,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:35:33,787 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:35:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:35:33,953 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:35:33,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:35:33,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826961044] [2021-10-13 00:35:33,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826961044] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:35:33,954 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:35:33,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 00:35:33,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107306460] [2021-10-13 00:35:33,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 00:35:33,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:35:33,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 00:35:33,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:35:33,955 INFO L87 Difference]: Start difference. First operand 644 states and 1983 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:35:33,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:35:33,972 INFO L93 Difference]: Finished difference Result 584 states and 1770 transitions. [2021-10-13 00:35:33,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 00:35:33,973 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:35:33,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:35:33,978 INFO L225 Difference]: With dead ends: 584 [2021-10-13 00:35:33,978 INFO L226 Difference]: Without dead ends: 584 [2021-10-13 00:35:33,979 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 00:35:33,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2021-10-13 00:35:33,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2021-10-13 00:35:34,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 583 states have (on average 3.0360205831903944) internal successors, (1770), 583 states have internal predecessors, (1770), 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:35:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1770 transitions. [2021-10-13 00:35:34,005 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1770 transitions. Word has length 10 [2021-10-13 00:35:34,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:35:34,006 INFO L470 AbstractCegarLoop]: Abstraction has 584 states and 1770 transitions. [2021-10-13 00:35:34,006 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:35:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1770 transitions. [2021-10-13 00:35:34,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 00:35:34,013 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:35:34,013 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:35:34,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 00:35:34,014 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:35:34,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:35:34,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1582733547, now seen corresponding path program 1 times [2021-10-13 00:35:34,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:35:34,018 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349370523] [2021-10-13 00:35:34,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:35:34,018 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:35:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:35:34,521 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:35:34,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:35:34,521 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349370523] [2021-10-13 00:35:34,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349370523] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:35:34,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:35:34,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:35:34,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320540348] [2021-10-13 00:35:34,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 00:35:34,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:35:34,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 00:35:34,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:35:34,524 INFO L87 Difference]: Start difference. First operand 584 states and 1770 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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:35:35,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:35:35,093 INFO L93 Difference]: Finished difference Result 893 states and 2705 transitions. [2021-10-13 00:35:35,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 00:35:35,094 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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:35:35,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:35:35,101 INFO L225 Difference]: With dead ends: 893 [2021-10-13 00:35:35,102 INFO L226 Difference]: Without dead ends: 713 [2021-10-13 00:35:35,102 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 199.2ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:35:35,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2021-10-13 00:35:35,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2021-10-13 00:35:35,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 712 states have (on average 3.057584269662921) internal successors, (2177), 712 states have internal predecessors, (2177), 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:35:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 2177 transitions. [2021-10-13 00:35:35,136 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 2177 transitions. Word has length 13 [2021-10-13 00:35:35,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:35:35,136 INFO L470 AbstractCegarLoop]: Abstraction has 713 states and 2177 transitions. [2021-10-13 00:35:35,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 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:35:35,137 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 2177 transitions. [2021-10-13 00:35:35,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-13 00:35:35,138 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:35:35,139 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:35:35,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 00:35:35,139 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:35:35,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:35:35,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1820574002, now seen corresponding path program 1 times [2021-10-13 00:35:35,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:35:35,140 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506424479] [2021-10-13 00:35:35,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:35:35,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:35:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:35:35,282 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:35:35,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:35:35,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506424479] [2021-10-13 00:35:35,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506424479] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:35:35,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:35:35,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 00:35:35,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030719143] [2021-10-13 00:35:35,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:35:35,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:35:35,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:35:35,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:35:35,285 INFO L87 Difference]: Start difference. First operand 713 states and 2177 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) 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:35:35,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:35:35,309 INFO L93 Difference]: Finished difference Result 911 states and 2747 transitions. [2021-10-13 00:35:35,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:35:35,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) 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:35:35,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:35:35,314 INFO L225 Difference]: With dead ends: 911 [2021-10-13 00:35:35,314 INFO L226 Difference]: Without dead ends: 416 [2021-10-13 00:35:35,315 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:35:35,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-10-13 00:35:35,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2021-10-13 00:35:35,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.853012048192771) internal successors, (1184), 415 states have internal predecessors, (1184), 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:35:35,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1184 transitions. [2021-10-13 00:35:35,332 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1184 transitions. Word has length 14 [2021-10-13 00:35:35,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:35:35,333 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 1184 transitions. [2021-10-13 00:35:35,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) 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:35:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1184 transitions. [2021-10-13 00:35:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 00:35:35,334 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:35:35,335 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:35:35,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 00:35:35,335 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:35:35,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:35:35,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1416886698, now seen corresponding path program 1 times [2021-10-13 00:35:35,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:35:35,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34950902] [2021-10-13 00:35:35,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:35:35,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:35:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:35:35,518 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:35:35,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:35:35,519 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34950902] [2021-10-13 00:35:35,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34950902] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:35:35,519 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:35:35,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:35:35,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695627270] [2021-10-13 00:35:35,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:35:35,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:35:35,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:35:35,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:35:35,521 INFO L87 Difference]: Start difference. First operand 416 states and 1184 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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:35:35,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:35:35,614 INFO L93 Difference]: Finished difference Result 542 states and 1517 transitions. [2021-10-13 00:35:35,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 00:35:35,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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:35:35,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:35:35,618 INFO L225 Difference]: With dead ends: 542 [2021-10-13 00:35:35,619 INFO L226 Difference]: Without dead ends: 470 [2021-10-13 00:35:35,619 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 30.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:35:35,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-10-13 00:35:35,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2021-10-13 00:35:35,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 2.7739872068230276) internal successors, (1301), 469 states have internal predecessors, (1301), 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:35:35,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1301 transitions. [2021-10-13 00:35:35,638 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1301 transitions. Word has length 15 [2021-10-13 00:35:35,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:35:35,638 INFO L470 AbstractCegarLoop]: Abstraction has 470 states and 1301 transitions. [2021-10-13 00:35:35,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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:35:35,638 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1301 transitions. [2021-10-13 00:35:35,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 00:35:35,640 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:35:35,640 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:35:35,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 00:35:35,640 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:35:35,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:35:35,641 INFO L82 PathProgramCache]: Analyzing trace with hash 973813563, now seen corresponding path program 1 times [2021-10-13 00:35:35,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:35:35,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369391912] [2021-10-13 00:35:35,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:35:35,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:35:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:35:35,758 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:35:35,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:35:35,758 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369391912] [2021-10-13 00:35:35,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369391912] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:35:35,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:35:35,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 00:35:35,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590713484] [2021-10-13 00:35:35,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 00:35:35,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:35:35,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 00:35:35,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 00:35:35,760 INFO L87 Difference]: Start difference. First operand 470 states and 1301 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:35,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:35:35,787 INFO L93 Difference]: Finished difference Result 463 states and 1147 transitions. [2021-10-13 00:35:35,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 00:35:35,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-13 00:35:35,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:35:35,791 INFO L225 Difference]: With dead ends: 463 [2021-10-13 00:35:35,791 INFO L226 Difference]: Without dead ends: 346 [2021-10-13 00:35:35,791 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:35:35,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-10-13 00:35:35,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2021-10-13 00:35:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 2.4260869565217393) internal successors, (837), 345 states have internal predecessors, (837), 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:35:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 837 transitions. [2021-10-13 00:35:35,804 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 837 transitions. Word has length 16 [2021-10-13 00:35:35,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:35:35,804 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 837 transitions. [2021-10-13 00:35:35,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:35,805 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 837 transitions. [2021-10-13 00:35:35,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-13 00:35:35,806 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:35:35,806 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:35:35,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 00:35:35,806 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:35:35,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:35:35,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1551217214, now seen corresponding path program 1 times [2021-10-13 00:35:35,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:35:35,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195041793] [2021-10-13 00:35:35,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:35:35,808 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:35:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:35:35,922 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:35:35,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:35:35,923 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195041793] [2021-10-13 00:35:35,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195041793] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:35:35,923 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:35:35,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:35:35,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074427540] [2021-10-13 00:35:35,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 00:35:35,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:35:35,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 00:35:35,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 00:35:35,925 INFO L87 Difference]: Start difference. First operand 346 states and 837 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:35,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:35:35,956 INFO L93 Difference]: Finished difference Result 297 states and 671 transitions. [2021-10-13 00:35:35,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 00:35:35,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-10-13 00:35:35,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:35:35,959 INFO L225 Difference]: With dead ends: 297 [2021-10-13 00:35:35,959 INFO L226 Difference]: Without dead ends: 237 [2021-10-13 00:35:35,959 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 13.6ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:35:35,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-10-13 00:35:35,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2021-10-13 00:35:35,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 2.223175965665236) internal successors, (518), 233 states have internal predecessors, (518), 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:35:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 518 transitions. [2021-10-13 00:35:35,967 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 518 transitions. Word has length 17 [2021-10-13 00:35:35,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:35:35,967 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 518 transitions. [2021-10-13 00:35:35,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 518 transitions. [2021-10-13 00:35:35,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 00:35:35,969 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:35:35,969 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:35:35,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 00:35:35,969 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:35:35,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:35:35,970 INFO L82 PathProgramCache]: Analyzing trace with hash -334927797, now seen corresponding path program 1 times [2021-10-13 00:35:35,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:35:35,970 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620767781] [2021-10-13 00:35:35,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:35:35,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:35:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:35:36,099 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:35:36,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:35:36,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620767781] [2021-10-13 00:35:36,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620767781] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:35:36,100 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:35:36,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:35:36,100 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324131692] [2021-10-13 00:35:36,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:35:36,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:35:36,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:35:36,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:35:36,101 INFO L87 Difference]: Start difference. First operand 234 states and 518 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:36,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:35:36,140 INFO L93 Difference]: Finished difference Result 216 states and 480 transitions. [2021-10-13 00:35:36,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:35:36,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 00:35:36,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:35:36,142 INFO L225 Difference]: With dead ends: 216 [2021-10-13 00:35:36,142 INFO L226 Difference]: Without dead ends: 203 [2021-10-13 00:35:36,143 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 17.6ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:35:36,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-10-13 00:35:36,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 167. [2021-10-13 00:35:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 2.2771084337349397) internal successors, (378), 166 states have internal predecessors, (378), 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:35:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 378 transitions. [2021-10-13 00:35:36,149 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 378 transitions. Word has length 19 [2021-10-13 00:35:36,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:35:36,150 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 378 transitions. [2021-10-13 00:35:36,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 378 transitions. [2021-10-13 00:35:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 00:35:36,151 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:35:36,151 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:35:36,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 00:35:36,151 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:35:36,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:35:36,152 INFO L82 PathProgramCache]: Analyzing trace with hash -965152647, now seen corresponding path program 1 times [2021-10-13 00:35:36,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:35:36,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684893455] [2021-10-13 00:35:36,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:35:36,152 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:35:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:35:36,387 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:35:36,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:35:36,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684893455] [2021-10-13 00:35:36,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684893455] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:35:36,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:35:36,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:35:36,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517951157] [2021-10-13 00:35:36,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:35:36,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:35:36,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:35:36,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:35:36,389 INFO L87 Difference]: Start difference. First operand 167 states and 378 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:36,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:35:36,626 INFO L93 Difference]: Finished difference Result 319 states and 696 transitions. [2021-10-13 00:35:36,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:35:36,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 00:35:36,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:35:36,630 INFO L225 Difference]: With dead ends: 319 [2021-10-13 00:35:36,630 INFO L226 Difference]: Without dead ends: 254 [2021-10-13 00:35:36,630 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 32.6ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:35:36,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-10-13 00:35:36,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 219. [2021-10-13 00:35:36,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 2.270642201834862) internal successors, (495), 218 states have internal predecessors, (495), 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:35:36,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 495 transitions. [2021-10-13 00:35:36,640 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 495 transitions. Word has length 22 [2021-10-13 00:35:36,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:35:36,640 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 495 transitions. [2021-10-13 00:35:36,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 495 transitions. [2021-10-13 00:35:36,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 00:35:36,642 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:35:36,642 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:35:36,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 00:35:36,642 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:35:36,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:35:36,643 INFO L82 PathProgramCache]: Analyzing trace with hash -134368859, now seen corresponding path program 2 times [2021-10-13 00:35:36,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:35:36,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235660389] [2021-10-13 00:35:36,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:35:36,643 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:35:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:35:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 00:35:36,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:35:36,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235660389] [2021-10-13 00:35:36,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235660389] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:35:36,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:35:36,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:35:36,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173170232] [2021-10-13 00:35:36,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:35:36,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:35:36,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:35:36,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:35:36,884 INFO L87 Difference]: Start difference. First operand 219 states and 495 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:37,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:35:37,081 INFO L93 Difference]: Finished difference Result 295 states and 654 transitions. [2021-10-13 00:35:37,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:35:37,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 00:35:37,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:35:37,084 INFO L225 Difference]: With dead ends: 295 [2021-10-13 00:35:37,085 INFO L226 Difference]: Without dead ends: 243 [2021-10-13 00:35:37,085 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 55.7ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-10-13 00:35:37,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-10-13 00:35:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2021-10-13 00:35:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 2.2247706422018347) internal successors, (485), 218 states have internal predecessors, (485), 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:35:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 485 transitions. [2021-10-13 00:35:37,095 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 485 transitions. Word has length 22 [2021-10-13 00:35:37,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:35:37,095 INFO L470 AbstractCegarLoop]: Abstraction has 219 states and 485 transitions. [2021-10-13 00:35:37,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:37,095 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 485 transitions. [2021-10-13 00:35:37,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 00:35:37,097 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:35:37,097 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:35:37,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 00:35:37,097 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:35:37,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:35:37,098 INFO L82 PathProgramCache]: Analyzing trace with hash -970404199, now seen corresponding path program 3 times [2021-10-13 00:35:37,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:35:37,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827096939] [2021-10-13 00:35:37,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:35:37,098 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:35:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:35:37,394 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:35:37,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:35:37,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827096939] [2021-10-13 00:35:37,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827096939] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:35:37,394 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:35:37,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:35:37,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669629182] [2021-10-13 00:35:37,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:35:37,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:35:37,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:35:37,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:35:37,398 INFO L87 Difference]: Start difference. First operand 219 states and 485 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:37,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:35:37,635 INFO L93 Difference]: Finished difference Result 265 states and 575 transitions. [2021-10-13 00:35:37,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:35:37,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 00:35:37,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:35:37,637 INFO L225 Difference]: With dead ends: 265 [2021-10-13 00:35:37,638 INFO L226 Difference]: Without dead ends: 195 [2021-10-13 00:35:37,638 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 64.1ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:35:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-10-13 00:35:37,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 167. [2021-10-13 00:35:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 2.144578313253012) internal successors, (356), 166 states have internal predecessors, (356), 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:35:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 356 transitions. [2021-10-13 00:35:37,646 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 356 transitions. Word has length 22 [2021-10-13 00:35:37,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:35:37,646 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 356 transitions. [2021-10-13 00:35:37,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 356 transitions. [2021-10-13 00:35:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 00:35:37,647 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:35:37,647 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:35:37,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 00:35:37,648 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:35:37,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:35:37,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1338398181, now seen corresponding path program 4 times [2021-10-13 00:35:37,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:35:37,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297999185] [2021-10-13 00:35:37,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:35:37,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:35:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:35:37,869 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:35:37,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:35:37,869 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297999185] [2021-10-13 00:35:37,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297999185] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:35:37,870 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:35:37,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 00:35:37,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213377131] [2021-10-13 00:35:37,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:35:37,870 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:35:37,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:35:37,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:35:37,871 INFO L87 Difference]: Start difference. First operand 167 states and 356 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:38,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:35:38,016 INFO L93 Difference]: Finished difference Result 213 states and 446 transitions. [2021-10-13 00:35:38,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:35:38,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 00:35:38,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:35:38,018 INFO L225 Difference]: With dead ends: 213 [2021-10-13 00:35:38,018 INFO L226 Difference]: Without dead ends: 174 [2021-10-13 00:35:38,019 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 23.8ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:35:38,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-10-13 00:35:38,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2021-10-13 00:35:38,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 2.1445086705202314) internal successors, (371), 173 states have internal predecessors, (371), 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:35:38,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 371 transitions. [2021-10-13 00:35:38,025 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 371 transitions. Word has length 22 [2021-10-13 00:35:38,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:35:38,025 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 371 transitions. [2021-10-13 00:35:38,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:38,025 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 371 transitions. [2021-10-13 00:35:38,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 00:35:38,026 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:35:38,026 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:35:38,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 00:35:38,027 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:35:38,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:35:38,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1092063707, now seen corresponding path program 5 times [2021-10-13 00:35:38,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:35:38,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368021813] [2021-10-13 00:35:38,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:35:38,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:35:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:35:38,631 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:35:38,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:35:38,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368021813] [2021-10-13 00:35:38,631 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368021813] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:35:38,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:35:38,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-13 00:35:38,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887966774] [2021-10-13 00:35:38,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-13 00:35:38,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:35:38,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-13 00:35:38,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-10-13 00:35:38,633 INFO L87 Difference]: Start difference. First operand 174 states and 371 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:35:38,980 INFO L93 Difference]: Finished difference Result 236 states and 493 transitions. [2021-10-13 00:35:38,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 00:35:38,981 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 00:35:38,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:35:38,982 INFO L225 Difference]: With dead ends: 236 [2021-10-13 00:35:38,982 INFO L226 Difference]: Without dead ends: 202 [2021-10-13 00:35:38,983 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 231.7ms TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-10-13 00:35:38,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-10-13 00:35:38,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 194. [2021-10-13 00:35:38,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 2.1088082901554404) internal successors, (407), 193 states have internal predecessors, (407), 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:35:38,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 407 transitions. [2021-10-13 00:35:38,990 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 407 transitions. Word has length 22 [2021-10-13 00:35:38,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:35:38,991 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 407 transitions. [2021-10-13 00:35:38,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:38,991 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 407 transitions. [2021-10-13 00:35:38,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 00:35:38,992 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:35:38,992 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:35:38,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 00:35:38,992 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:35:38,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:35:38,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1856653545, now seen corresponding path program 6 times [2021-10-13 00:35:38,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:35:38,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418010296] [2021-10-13 00:35:38,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:35:38,993 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:35:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:35:39,294 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:35:39,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:35:39,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418010296] [2021-10-13 00:35:39,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418010296] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:35:39,295 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:35:39,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 00:35:39,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644515842] [2021-10-13 00:35:39,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 00:35:39,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:35:39,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 00:35:39,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:35:39,297 INFO L87 Difference]: Start difference. First operand 194 states and 407 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:39,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:35:39,596 INFO L93 Difference]: Finished difference Result 224 states and 459 transitions. [2021-10-13 00:35:39,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 00:35:39,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 00:35:39,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:35:39,599 INFO L225 Difference]: With dead ends: 224 [2021-10-13 00:35:39,599 INFO L226 Difference]: Without dead ends: 194 [2021-10-13 00:35:39,600 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 132.6ms TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-10-13 00:35:39,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-10-13 00:35:39,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 187. [2021-10-13 00:35:39,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 2.1021505376344085) internal successors, (391), 186 states have internal predecessors, (391), 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:35:39,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 391 transitions. [2021-10-13 00:35:39,608 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 391 transitions. Word has length 22 [2021-10-13 00:35:39,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:35:39,609 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 391 transitions. [2021-10-13 00:35:39,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:39,609 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 391 transitions. [2021-10-13 00:35:39,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 00:35:39,611 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:35:39,611 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:35:39,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 00:35:39,612 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:35:39,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:35:39,613 INFO L82 PathProgramCache]: Analyzing trace with hash -88166027, now seen corresponding path program 7 times [2021-10-13 00:35:39,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:35:39,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617489521] [2021-10-13 00:35:39,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:35:39,613 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:35:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:35:39,882 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:35:39,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:35:39,883 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617489521] [2021-10-13 00:35:39,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617489521] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:35:39,886 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:35:39,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:35:39,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110206421] [2021-10-13 00:35:39,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 00:35:39,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:35:39,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 00:35:39,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-13 00:35:39,890 INFO L87 Difference]: Start difference. First operand 187 states and 391 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:40,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:35:40,059 INFO L93 Difference]: Finished difference Result 209 states and 429 transitions. [2021-10-13 00:35:40,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:35:40,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 00:35:40,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:35:40,062 INFO L225 Difference]: With dead ends: 209 [2021-10-13 00:35:40,062 INFO L226 Difference]: Without dead ends: 167 [2021-10-13 00:35:40,062 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 47.0ms TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:35:40,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-10-13 00:35:40,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2021-10-13 00:35:40,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 2.1265060240963853) internal successors, (353), 166 states have internal predecessors, (353), 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:35:40,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 353 transitions. [2021-10-13 00:35:40,068 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 353 transitions. Word has length 22 [2021-10-13 00:35:40,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:35:40,068 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 353 transitions. [2021-10-13 00:35:40,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 353 transitions. [2021-10-13 00:35:40,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 00:35:40,069 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:35:40,069 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:35:40,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 00:35:40,070 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:35:40,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:35:40,071 INFO L82 PathProgramCache]: Analyzing trace with hash 577359133, now seen corresponding path program 8 times [2021-10-13 00:35:40,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:35:40,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601860716] [2021-10-13 00:35:40,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:35:40,071 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:35:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:35:40,498 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:35:40,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:35:40,499 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601860716] [2021-10-13 00:35:40,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601860716] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:35:40,499 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:35:40,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 00:35:40,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186786052] [2021-10-13 00:35:40,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 00:35:40,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:35:40,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 00:35:40,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-10-13 00:35:40,501 INFO L87 Difference]: Start difference. First operand 167 states and 353 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:40,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:35:40,755 INFO L93 Difference]: Finished difference Result 229 states and 475 transitions. [2021-10-13 00:35:40,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:35:40,756 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 00:35:40,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:35:40,757 INFO L225 Difference]: With dead ends: 229 [2021-10-13 00:35:40,757 INFO L226 Difference]: Without dead ends: 142 [2021-10-13 00:35:40,757 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 127.2ms TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-10-13 00:35:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-10-13 00:35:40,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-10-13 00:35:40,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.099290780141844) internal successors, (296), 141 states have internal predecessors, (296), 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:35:40,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 296 transitions. [2021-10-13 00:35:40,763 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 296 transitions. Word has length 22 [2021-10-13 00:35:40,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:35:40,764 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 296 transitions. [2021-10-13 00:35:40,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:40,764 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 296 transitions. [2021-10-13 00:35:40,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 00:35:40,765 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:35:40,765 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:35:40,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 00:35:40,766 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:35:40,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:35:40,766 INFO L82 PathProgramCache]: Analyzing trace with hash 933895691, now seen corresponding path program 9 times [2021-10-13 00:35:40,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:35:40,767 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728288505] [2021-10-13 00:35:40,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:35:40,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:35:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:35:40,949 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:35:40,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:35:40,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728288505] [2021-10-13 00:35:40,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728288505] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:35:40,949 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:35:40,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 00:35:40,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665277972] [2021-10-13 00:35:40,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 00:35:40,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:35:40,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 00:35:40,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-13 00:35:40,953 INFO L87 Difference]: Start difference. First operand 142 states and 296 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:41,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:35:41,125 INFO L93 Difference]: Finished difference Result 189 states and 376 transitions. [2021-10-13 00:35:41,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 00:35:41,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 00:35:41,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:35:41,127 INFO L225 Difference]: With dead ends: 189 [2021-10-13 00:35:41,127 INFO L226 Difference]: Without dead ends: 165 [2021-10-13 00:35:41,127 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 33.2ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-10-13 00:35:41,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-10-13 00:35:41,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 142. [2021-10-13 00:35:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.0851063829787235) internal successors, (294), 141 states have internal predecessors, (294), 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:35:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 294 transitions. [2021-10-13 00:35:41,132 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 294 transitions. Word has length 22 [2021-10-13 00:35:41,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:35:41,133 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 294 transitions. [2021-10-13 00:35:41,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:41,133 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 294 transitions. [2021-10-13 00:35:41,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 00:35:41,134 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:35:41,134 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:35:41,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 00:35:41,135 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:35:41,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:35:41,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1764679479, now seen corresponding path program 10 times [2021-10-13 00:35:41,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:35:41,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626233982] [2021-10-13 00:35:41,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:35:41,136 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:35:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 00:35:41,613 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:35:41,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 00:35:41,613 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626233982] [2021-10-13 00:35:41,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626233982] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 00:35:41,613 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 00:35:41,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 00:35:41,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451132757] [2021-10-13 00:35:41,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 00:35:41,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 00:35:41,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 00:35:41,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-10-13 00:35:41,616 INFO L87 Difference]: Start difference. First operand 142 states and 294 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 00:35:42,035 INFO L93 Difference]: Finished difference Result 227 states and 448 transitions. [2021-10-13 00:35:42,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 00:35:42,036 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 00:35:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 00:35:42,037 INFO L225 Difference]: With dead ends: 227 [2021-10-13 00:35:42,037 INFO L226 Difference]: Without dead ends: 83 [2021-10-13 00:35:42,038 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 158.0ms TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-10-13 00:35:42,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-10-13 00:35:42,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 59. [2021-10-13 00:35:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.7586206896551724) internal successors, (102), 58 states have internal predecessors, (102), 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:35:42,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 102 transitions. [2021-10-13 00:35:42,041 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 102 transitions. Word has length 22 [2021-10-13 00:35:42,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 00:35:42,041 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 102 transitions. [2021-10-13 00:35:42,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 00:35:42,041 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 102 transitions. [2021-10-13 00:35:42,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 00:35:42,042 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 00:35:42,042 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 00:35:42,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 00:35:42,042 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-10-13 00:35:42,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 00:35:42,043 INFO L82 PathProgramCache]: Analyzing trace with hash -546027181, now seen corresponding path program 11 times [2021-10-13 00:35:42,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 00:35:42,043 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274524415] [2021-10-13 00:35:42,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 00:35:42,043 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 00:35:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:35:42,154 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 00:35:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 00:35:42,344 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-13 00:35:42,345 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 00:35:42,346 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:35:42,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:35:42,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-13 00:35:42,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-13 00:35:42,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-13 00:35:42,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 00:35:42,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 00:35:42,355 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-13 00:35:42,356 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 00:35:42,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:35:42 BasicIcfg [2021-10-13 00:35:42,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 00:35:42,515 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 00:35:42,515 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 00:35:42,515 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 00:35:42,515 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:35:13" (3/4) ... [2021-10-13 00:35:42,517 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 00:35:42,644 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe47a012-d469-46e5-a70e-60f243f29047/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 00:35:42,644 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 00:35:42,646 INFO L168 Benchmark]: Toolchain (without parser) took 34304.58 ms. Allocated memory was 92.3 MB in the beginning and 268.4 MB in the end (delta: 176.2 MB). Free memory was 63.7 MB in the beginning and 197.8 MB in the end (delta: -134.2 MB). Peak memory consumption was 46.6 MB. Max. memory is 16.1 GB. [2021-10-13 00:35:42,646 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 75.5 MB. Free memory was 41.1 MB in the beginning and 41.1 MB in the end (delta: 39.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 00:35:42,647 INFO L168 Benchmark]: CACSL2BoogieTranslator took 956.93 ms. Allocated memory is still 92.3 MB. Free memory was 63.5 MB in the beginning and 37.7 MB in the end (delta: 25.7 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2021-10-13 00:35:42,648 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.77 ms. Allocated memory is still 92.3 MB. Free memory was 37.7 MB in the beginning and 69.2 MB in the end (delta: -31.5 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. [2021-10-13 00:35:42,648 INFO L168 Benchmark]: Boogie Preprocessor took 68.37 ms. Allocated memory is still 92.3 MB. Free memory was 69.2 MB in the beginning and 66.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 00:35:42,649 INFO L168 Benchmark]: RCFGBuilder took 3810.01 ms. Allocated memory was 92.3 MB in the beginning and 121.6 MB in the end (delta: 29.4 MB). Free memory was 65.9 MB in the beginning and 78.9 MB in the end (delta: -13.0 MB). Peak memory consumption was 57.7 MB. Max. memory is 16.1 GB. [2021-10-13 00:35:42,649 INFO L168 Benchmark]: TraceAbstraction took 29193.57 ms. Allocated memory was 121.6 MB in the beginning and 268.4 MB in the end (delta: 146.8 MB). Free memory was 78.9 MB in the beginning and 218.8 MB in the end (delta: -139.9 MB). Peak memory consumption was 124.2 MB. Max. memory is 16.1 GB. [2021-10-13 00:35:42,650 INFO L168 Benchmark]: Witness Printer took 129.75 ms. Allocated memory is still 268.4 MB. Free memory was 218.8 MB in the beginning and 197.8 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-10-13 00:35:42,652 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.25 ms. Allocated memory is still 75.5 MB. Free memory was 41.1 MB in the beginning and 41.1 MB in the end (delta: 39.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 956.93 ms. Allocated memory is still 92.3 MB. Free memory was 63.5 MB in the beginning and 37.7 MB in the end (delta: 25.7 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 129.77 ms. Allocated memory is still 92.3 MB. Free memory was 37.7 MB in the beginning and 69.2 MB in the end (delta: -31.5 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 68.37 ms. Allocated memory is still 92.3 MB. Free memory was 69.2 MB in the beginning and 66.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3810.01 ms. Allocated memory was 92.3 MB in the beginning and 121.6 MB in the end (delta: 29.4 MB). Free memory was 65.9 MB in the beginning and 78.9 MB in the end (delta: -13.0 MB). Peak memory consumption was 57.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 29193.57 ms. Allocated memory was 121.6 MB in the beginning and 268.4 MB in the end (delta: 146.8 MB). Free memory was 78.9 MB in the beginning and 218.8 MB in the end (delta: -139.9 MB). Peak memory consumption was 124.2 MB. Max. memory is 16.1 GB. * Witness Printer took 129.75 ms. Allocated memory is still 268.4 MB. Free memory was 218.8 MB in the beginning and 197.8 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19165.9ms, 116 PlacesBefore, 37 PlacesAfterwards, 108 TransitionsBefore, 27 TransitionsAfterwards, 1976 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 5141 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2102, positive: 1940, positive conditional: 0, positive unconditional: 1940, negative: 162, negative conditional: 0, negative unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1239, positive: 1173, positive conditional: 0, positive unconditional: 1173, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1239, positive: 1164, positive conditional: 0, positive unconditional: 1164, negative: 75, negative conditional: 0, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1246, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 1237, negative conditional: 0, negative unconditional: 1237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2102, positive: 767, positive conditional: 0, positive unconditional: 767, negative: 96, negative conditional: 0, negative unconditional: 96, unknown: 1239, unknown conditional: 0, unknown unconditional: 1239] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2333; [L855] FCALL, FORK 0 pthread_create(&t2333, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2334; [L857] FCALL, FORK 0 pthread_create(&t2334, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2335; [L859] FCALL, FORK 0 pthread_create(&t2335, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L744] 1 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: 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: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 136 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 28815.8ms, OverallIterations: 20, TraceHistogramMax: 1, EmptinessCheckTime: 48.2ms, AutomataDifference: 3567.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 19297.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 504 SDtfs, 623 SDslu, 1209 SDs, 0 SdLazy, 1123 SolverSat, 295 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2265.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1194.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=866occurred in iteration=0, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 333.9ms AutomataMinimizationTime, 19 MinimizatonAttempts, 188 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 203.7ms SsaConstructionTime, 1890.4ms SatisfiabilityAnalysisTime, 2892.1ms InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 319 ConstructedInterpolants, 0 QuantifiedInterpolants, 2776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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:35:42,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe47a012-d469-46e5-a70e-60f243f29047/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...