./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f413b41672ef8cb3f594e0d22a82a07ab4d735f8bfa69fff7e94198d51bd0eb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 09:27:07,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:27:07,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:27:08,015 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:27:08,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:27:08,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:27:08,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:27:08,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:27:08,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:27:08,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:27:08,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:27:08,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:27:08,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:27:08,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:27:08,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:27:08,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:27:08,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:27:08,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:27:08,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:27:08,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:27:08,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:27:08,059 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:27:08,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:27:08,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:27:08,064 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:27:08,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:27:08,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:27:08,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:27:08,066 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:27:08,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:27:08,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:27:08,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:27:08,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:27:08,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:27:08,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:27:08,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:27:08,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:27:08,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:27:08,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:27:08,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:27:08,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:27:08,076 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-20 09:27:08,096 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:27:08,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:27:08,096 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:27:08,097 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:27:08,097 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:27:08,098 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:27:08,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:27:08,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:27:08,099 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:27:08,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:27:08,100 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:27:08,100 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 09:27:08,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:27:08,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:27:08,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:27:08,101 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 09:27:08,101 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 09:27:08,101 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 09:27:08,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:27:08,102 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 09:27:08,102 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:27:08,102 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:27:08,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:27:08,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:27:08,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:27:08,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:08,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:27:08,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:27:08,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:27:08,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:27:08,104 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_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/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_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 6f413b41672ef8cb3f594e0d22a82a07ab4d735f8bfa69fff7e94198d51bd0eb [2022-11-20 09:27:08,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:27:08,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:27:08,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:27:08,413 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:27:08,415 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:27:08,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i [2022-11-20 09:27:11,471 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:27:11,829 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:27:11,831 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i [2022-11-20 09:27:11,849 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/data/1f1e3b84d/1edee3e7f5e44a9d8b2489fec9dae436/FLAG686faa8c2 [2022-11-20 09:27:11,863 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/data/1f1e3b84d/1edee3e7f5e44a9d8b2489fec9dae436 [2022-11-20 09:27:11,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:27:11,878 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:27:11,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:11,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:27:11,886 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:27:11,887 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:11" (1/1) ... [2022-11-20 09:27:11,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9bae401 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:11, skipping insertion in model container [2022-11-20 09:27:11,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:11" (1/1) ... [2022-11-20 09:27:11,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:27:11,965 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:27:12,142 WARN L237 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_d57cb844-a778-4984-86c3-def5fa1422f1/sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i[993,1006] [2022-11-20 09:27:12,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:12,416 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:27:12,429 WARN L237 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_d57cb844-a778-4984-86c3-def5fa1422f1/sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i[993,1006] [2022-11-20 09:27:12,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:12,507 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:27:12,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12 WrapperNode [2022-11-20 09:27:12,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:12,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:12,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:27:12,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:27:12,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,559 INFO L138 Inliner]: procedures = 176, calls = 65, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-11-20 09:27:12,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:12,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:27:12,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:27:12,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:27:12,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,613 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:27:12,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:27:12,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:27:12,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:27:12,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (1/1) ... [2022-11-20 09:27:12,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:12,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:12,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:27:12,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:27:12,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 09:27:12,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 09:27:12,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 09:27:12,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:27:12,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 09:27:12,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:27:12,716 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 09:27:12,716 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 09:27:12,716 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 09:27:12,716 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 09:27:12,716 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 09:27:12,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 09:27:12,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:27:12,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 09:27:12,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:27:12,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:27:12,719 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 09:27:12,896 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:27:12,898 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:27:13,537 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:27:13,926 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:27:13,926 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 09:27:13,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:13 BoogieIcfgContainer [2022-11-20 09:27:13,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:27:13,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:27:13,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:27:13,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:27:13,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:27:11" (1/3) ... [2022-11-20 09:27:13,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378c6d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:13, skipping insertion in model container [2022-11-20 09:27:13,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:12" (2/3) ... [2022-11-20 09:27:13,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378c6d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:13, skipping insertion in model container [2022-11-20 09:27:13,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:13" (3/3) ... [2022-11-20 09:27:13,939 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.oepc.i [2022-11-20 09:27:13,960 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:27:13,960 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-11-20 09:27:13,961 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 09:27:14,122 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 09:27:14,176 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 09:27:14,200 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 164 transitions, 343 flow [2022-11-20 09:27:14,203 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 164 transitions, 343 flow [2022-11-20 09:27:14,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 164 transitions, 343 flow [2022-11-20 09:27:14,303 INFO L130 PetriNetUnfolder]: 2/161 cut-off events. [2022-11-20 09:27:14,304 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 09:27:14,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 161 events. 2/161 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 180 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-20 09:27:14,313 INFO L119 LiptonReduction]: Number of co-enabled transitions 4540 [2022-11-20 09:27:31,977 INFO L134 LiptonReduction]: Checked pairs total: 15563 [2022-11-20 09:27:31,978 INFO L136 LiptonReduction]: Total number of compositions: 168 [2022-11-20 09:27:31,987 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68 places, 59 transitions, 133 flow [2022-11-20 09:27:32,355 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 8226 states, 7354 states have (on average 3.881289094370411) internal successors, (28543), 8225 states have internal predecessors, (28543), 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) [2022-11-20 09:27:32,382 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:27:32,390 INFO L357 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@21e9584b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:27:32,391 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2022-11-20 09:27:32,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 8226 states, 7354 states have (on average 3.881289094370411) internal successors, (28543), 8225 states have internal predecessors, (28543), 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) [2022-11-20 09:27:32,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 09:27:32,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:32,441 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 09:27:32,442 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:27:32,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:32,450 INFO L85 PathProgramCache]: Analyzing trace with hash 818, now seen corresponding path program 1 times [2022-11-20 09:27:32,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:32,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646382951] [2022-11-20 09:27:32,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:32,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:32,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:32,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:32,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646382951] [2022-11-20 09:27:32,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646382951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:32,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:32,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 09:27:32,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898510042] [2022-11-20 09:27:32,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:32,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 09:27:32,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:32,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 09:27:32,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:27:32,693 INFO L87 Difference]: Start difference. First operand has 8226 states, 7354 states have (on average 3.881289094370411) internal successors, (28543), 8225 states have internal predecessors, (28543), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) [2022-11-20 09:27:32,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:32,876 INFO L93 Difference]: Finished difference Result 2486 states and 8177 transitions. [2022-11-20 09:27:32,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 09:27:32,878 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2022-11-20 09:27:32,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:32,925 INFO L225 Difference]: With dead ends: 2486 [2022-11-20 09:27:32,925 INFO L226 Difference]: Without dead ends: 2486 [2022-11-20 09:27:32,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:27:32,931 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:32,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:27:33,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2022-11-20 09:27:33,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2486. [2022-11-20 09:27:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2352 states have (on average 3.4766156462585034) internal successors, (8177), 2485 states have internal predecessors, (8177), 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) [2022-11-20 09:27:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 8177 transitions. [2022-11-20 09:27:33,190 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 8177 transitions. Word has length 1 [2022-11-20 09:27:33,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:33,191 INFO L495 AbstractCegarLoop]: Abstraction has 2486 states and 8177 transitions. [2022-11-20 09:27:33,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) [2022-11-20 09:27:33,197 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 8177 transitions. [2022-11-20 09:27:33,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 09:27:33,198 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:33,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 09:27:33,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:27:33,199 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:27:33,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:33,201 INFO L85 PathProgramCache]: Analyzing trace with hash 807882, now seen corresponding path program 1 times [2022-11-20 09:27:33,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:33,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542499577] [2022-11-20 09:27:33,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:33,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:33,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:33,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:33,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542499577] [2022-11-20 09:27:33,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542499577] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:33,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:33,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:27:33,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503845242] [2022-11-20 09:27:33,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:33,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:33,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:33,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:33,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:33,503 INFO L87 Difference]: Start difference. First operand 2486 states and 8177 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:33,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:33,678 INFO L93 Difference]: Finished difference Result 1916 states and 5867 transitions. [2022-11-20 09:27:33,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:33,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 09:27:33,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:33,695 INFO L225 Difference]: With dead ends: 1916 [2022-11-20 09:27:33,695 INFO L226 Difference]: Without dead ends: 1898 [2022-11-20 09:27:33,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:33,704 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:33,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:27:33,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2022-11-20 09:27:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1652. [2022-11-20 09:27:33,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 1603 states have (on average 3.293824079850281) internal successors, (5280), 1651 states have internal predecessors, (5280), 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) [2022-11-20 09:27:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 5280 transitions. [2022-11-20 09:27:33,780 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 5280 transitions. Word has length 3 [2022-11-20 09:27:33,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:33,781 INFO L495 AbstractCegarLoop]: Abstraction has 1652 states and 5280 transitions. [2022-11-20 09:27:33,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:33,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 5280 transitions. [2022-11-20 09:27:33,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 09:27:33,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:33,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 09:27:33,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:27:33,785 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:27:33,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:33,786 INFO L85 PathProgramCache]: Analyzing trace with hash 807883, now seen corresponding path program 1 times [2022-11-20 09:27:33,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:33,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840054345] [2022-11-20 09:27:33,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:33,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:34,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:34,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840054345] [2022-11-20 09:27:34,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840054345] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:34,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:34,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:27:34,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902732444] [2022-11-20 09:27:34,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:34,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:34,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:34,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:34,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:34,010 INFO L87 Difference]: Start difference. First operand 1652 states and 5280 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:34,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:34,102 INFO L93 Difference]: Finished difference Result 1070 states and 3277 transitions. [2022-11-20 09:27:34,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:34,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 09:27:34,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:34,112 INFO L225 Difference]: With dead ends: 1070 [2022-11-20 09:27:34,112 INFO L226 Difference]: Without dead ends: 1052 [2022-11-20 09:27:34,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:34,114 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:34,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:27:34,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2022-11-20 09:27:34,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2022-11-20 09:27:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1034 states have (on average 3.137330754352031) internal successors, (3244), 1051 states have internal predecessors, (3244), 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) [2022-11-20 09:27:34,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 3244 transitions. [2022-11-20 09:27:34,155 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 3244 transitions. Word has length 3 [2022-11-20 09:27:34,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:34,156 INFO L495 AbstractCegarLoop]: Abstraction has 1052 states and 3244 transitions. [2022-11-20 09:27:34,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:34,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 3244 transitions. [2022-11-20 09:27:34,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 09:27:34,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:34,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:34,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 09:27:34,158 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:27:34,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:34,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1871194934, now seen corresponding path program 1 times [2022-11-20 09:27:34,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:34,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765732463] [2022-11-20 09:27:34,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:34,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:34,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:34,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765732463] [2022-11-20 09:27:34,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765732463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:34,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:34,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:27:34,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976869451] [2022-11-20 09:27:34,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:34,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:34,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:34,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:34,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:34,292 INFO L87 Difference]: Start difference. First operand 1052 states and 3244 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) [2022-11-20 09:27:34,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:34,419 INFO L93 Difference]: Finished difference Result 1022 states and 3140 transitions. [2022-11-20 09:27:34,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:34,420 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 [2022-11-20 09:27:34,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:34,428 INFO L225 Difference]: With dead ends: 1022 [2022-11-20 09:27:34,428 INFO L226 Difference]: Without dead ends: 1022 [2022-11-20 09:27:34,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:34,430 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:34,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 6 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:27:34,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2022-11-20 09:27:34,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1022. [2022-11-20 09:27:34,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1004 states have (on average 3.1274900398406373) internal successors, (3140), 1021 states have internal predecessors, (3140), 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) [2022-11-20 09:27:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 3140 transitions. [2022-11-20 09:27:34,468 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 3140 transitions. Word has length 10 [2022-11-20 09:27:34,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:34,469 INFO L495 AbstractCegarLoop]: Abstraction has 1022 states and 3140 transitions. [2022-11-20 09:27:34,469 INFO L496 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) [2022-11-20 09:27:34,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 3140 transitions. [2022-11-20 09:27:34,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 09:27:34,471 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:34,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:34,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 09:27:34,472 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:27:34,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:34,472 INFO L85 PathProgramCache]: Analyzing trace with hash -2128678671, now seen corresponding path program 1 times [2022-11-20 09:27:34,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:34,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598169853] [2022-11-20 09:27:34,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:34,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:34,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:34,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598169853] [2022-11-20 09:27:34,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598169853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:34,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:34,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:27:34,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051686149] [2022-11-20 09:27:34,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:34,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:27:34,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:34,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:27:34,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:27:34,715 INFO L87 Difference]: Start difference. First operand 1022 states and 3140 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:34,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:34,887 INFO L93 Difference]: Finished difference Result 1622 states and 4932 transitions. [2022-11-20 09:27:34,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:27:34,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 09:27:34,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:34,899 INFO L225 Difference]: With dead ends: 1622 [2022-11-20 09:27:34,900 INFO L226 Difference]: Without dead ends: 1622 [2022-11-20 09:27:34,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:27:34,901 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 46 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:34,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:27:34,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2022-11-20 09:27:34,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1130. [2022-11-20 09:27:34,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1112 states have (on average 3.1555755395683454) internal successors, (3509), 1129 states have internal predecessors, (3509), 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) [2022-11-20 09:27:34,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 3509 transitions. [2022-11-20 09:27:34,948 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 3509 transitions. Word has length 11 [2022-11-20 09:27:34,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:34,948 INFO L495 AbstractCegarLoop]: Abstraction has 1130 states and 3509 transitions. [2022-11-20 09:27:34,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:34,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 3509 transitions. [2022-11-20 09:27:34,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 09:27:34,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:34,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:34,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 09:27:34,952 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:27:34,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:34,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2128678665, now seen corresponding path program 1 times [2022-11-20 09:27:34,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:34,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603925318] [2022-11-20 09:27:34,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:34,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:35,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:35,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:35,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603925318] [2022-11-20 09:27:35,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603925318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:35,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:35,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:27:35,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558078683] [2022-11-20 09:27:35,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:35,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:35,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:35,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:35,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:35,099 INFO L87 Difference]: Start difference. First operand 1130 states and 3509 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:35,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:35,229 INFO L93 Difference]: Finished difference Result 1469 states and 4368 transitions. [2022-11-20 09:27:35,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:35,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 09:27:35,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:35,238 INFO L225 Difference]: With dead ends: 1469 [2022-11-20 09:27:35,238 INFO L226 Difference]: Without dead ends: 1469 [2022-11-20 09:27:35,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:35,239 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:35,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:27:35,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2022-11-20 09:27:35,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1130. [2022-11-20 09:27:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1112 states have (on average 3.115107913669065) internal successors, (3464), 1129 states have internal predecessors, (3464), 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) [2022-11-20 09:27:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 3464 transitions. [2022-11-20 09:27:35,338 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 3464 transitions. Word has length 11 [2022-11-20 09:27:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:35,339 INFO L495 AbstractCegarLoop]: Abstraction has 1130 states and 3464 transitions. [2022-11-20 09:27:35,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 3464 transitions. [2022-11-20 09:27:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 09:27:35,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:35,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:35,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 09:27:35,341 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:27:35,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:35,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2122500111, now seen corresponding path program 1 times [2022-11-20 09:27:35,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:35,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213858070] [2022-11-20 09:27:35,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:35,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:35,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:35,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213858070] [2022-11-20 09:27:35,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213858070] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:35,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:35,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:27:35,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884582779] [2022-11-20 09:27:35,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:35,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:35,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:35,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:35,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:35,672 INFO L87 Difference]: Start difference. First operand 1130 states and 3464 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:35,789 INFO L93 Difference]: Finished difference Result 1127 states and 3453 transitions. [2022-11-20 09:27:35,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:35,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 09:27:35,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:35,807 INFO L225 Difference]: With dead ends: 1127 [2022-11-20 09:27:35,807 INFO L226 Difference]: Without dead ends: 1127 [2022-11-20 09:27:35,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:35,808 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 8 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:35,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:27:35,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2022-11-20 09:27:35,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1127. [2022-11-20 09:27:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 1109 states have (on average 3.1136158701532914) internal successors, (3453), 1126 states have internal predecessors, (3453), 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) [2022-11-20 09:27:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 3453 transitions. [2022-11-20 09:27:35,846 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 3453 transitions. Word has length 11 [2022-11-20 09:27:35,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:35,846 INFO L495 AbstractCegarLoop]: Abstraction has 1127 states and 3453 transitions. [2022-11-20 09:27:35,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:35,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 3453 transitions. [2022-11-20 09:27:35,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 09:27:35,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:35,848 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:35,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 09:27:35,848 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:27:35,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:35,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1030357795, now seen corresponding path program 2 times [2022-11-20 09:27:35,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:35,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654901744] [2022-11-20 09:27:35,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:35,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:36,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:36,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:36,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654901744] [2022-11-20 09:27:36,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654901744] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:36,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:36,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:27:36,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651152000] [2022-11-20 09:27:36,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:36,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:36,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:36,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:36,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:36,094 INFO L87 Difference]: Start difference. First operand 1127 states and 3453 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:36,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:36,220 INFO L93 Difference]: Finished difference Result 1037 states and 3171 transitions. [2022-11-20 09:27:36,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:27:36,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 09:27:36,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:36,228 INFO L225 Difference]: With dead ends: 1037 [2022-11-20 09:27:36,228 INFO L226 Difference]: Without dead ends: 1037 [2022-11-20 09:27:36,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:36,229 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 67 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:36,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 2 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:27:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2022-11-20 09:27:36,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 929. [2022-11-20 09:27:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 913 states have (on average 3.11829134720701) internal successors, (2847), 928 states have internal predecessors, (2847), 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) [2022-11-20 09:27:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 2847 transitions. [2022-11-20 09:27:36,261 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 2847 transitions. Word has length 11 [2022-11-20 09:27:36,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:36,262 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 2847 transitions. [2022-11-20 09:27:36,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:36,262 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 2847 transitions. [2022-11-20 09:27:36,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 09:27:36,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:36,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:36,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 09:27:36,264 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:27:36,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:36,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1564528440, now seen corresponding path program 1 times [2022-11-20 09:27:36,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:36,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141695092] [2022-11-20 09:27:36,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:36,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:36,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:36,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141695092] [2022-11-20 09:27:36,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141695092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:36,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:36,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:27:36,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238153800] [2022-11-20 09:27:36,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:36,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:27:36,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:36,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:27:36,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:36,487 INFO L87 Difference]: Start difference. First operand 929 states and 2847 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:36,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:36,571 INFO L93 Difference]: Finished difference Result 920 states and 2817 transitions. [2022-11-20 09:27:36,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:36,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 09:27:36,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:36,577 INFO L225 Difference]: With dead ends: 920 [2022-11-20 09:27:36,577 INFO L226 Difference]: Without dead ends: 920 [2022-11-20 09:27:36,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:27:36,579 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:36,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 6 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:27:36,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2022-11-20 09:27:36,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2022-11-20 09:27:36,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 904 states have (on average 3.1161504424778763) internal successors, (2817), 919 states have internal predecessors, (2817), 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) [2022-11-20 09:27:36,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 2817 transitions. [2022-11-20 09:27:36,636 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 2817 transitions. Word has length 12 [2022-11-20 09:27:36,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:36,636 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 2817 transitions. [2022-11-20 09:27:36,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:36,636 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 2817 transitions. [2022-11-20 09:27:36,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 09:27:36,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:36,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:36,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 09:27:36,638 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:27:36,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:36,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1372993744, now seen corresponding path program 1 times [2022-11-20 09:27:36,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:36,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412110866] [2022-11-20 09:27:36,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:36,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:36,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:36,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:36,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412110866] [2022-11-20 09:27:36,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412110866] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:36,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:36,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:27:36,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339902415] [2022-11-20 09:27:36,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:36,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:36,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:36,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:36,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:36,999 INFO L87 Difference]: Start difference. First operand 920 states and 2817 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:37,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:37,214 INFO L93 Difference]: Finished difference Result 1114 states and 3405 transitions. [2022-11-20 09:27:37,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:27:37,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 09:27:37,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:37,222 INFO L225 Difference]: With dead ends: 1114 [2022-11-20 09:27:37,223 INFO L226 Difference]: Without dead ends: 1114 [2022-11-20 09:27:37,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:27:37,224 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 54 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:37,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:27:37,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2022-11-20 09:27:37,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 940. [2022-11-20 09:27:37,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 924 states have (on average 3.116883116883117) internal successors, (2880), 939 states have internal predecessors, (2880), 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) [2022-11-20 09:27:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 2880 transitions. [2022-11-20 09:27:37,289 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 2880 transitions. Word has length 12 [2022-11-20 09:27:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:37,289 INFO L495 AbstractCegarLoop]: Abstraction has 940 states and 2880 transitions. [2022-11-20 09:27:37,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 2880 transitions. [2022-11-20 09:27:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 09:27:37,290 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:37,290 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:37,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 09:27:37,291 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:27:37,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:37,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1255741641, now seen corresponding path program 1 times [2022-11-20 09:27:37,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:37,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265912182] [2022-11-20 09:27:37,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:37,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:37,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:37,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:37,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265912182] [2022-11-20 09:27:37,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265912182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:37,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:37,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:27:37,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810693394] [2022-11-20 09:27:37,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:37,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:27:37,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:37,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:27:37,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:27:37,549 INFO L87 Difference]: Start difference. First operand 940 states and 2880 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:37,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:37,680 INFO L93 Difference]: Finished difference Result 1362 states and 4092 transitions. [2022-11-20 09:27:37,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:27:37,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 09:27:37,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:37,688 INFO L225 Difference]: With dead ends: 1362 [2022-11-20 09:27:37,689 INFO L226 Difference]: Without dead ends: 1362 [2022-11-20 09:27:37,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:37,690 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 61 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:37,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 9 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:27:37,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2022-11-20 09:27:37,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1000. [2022-11-20 09:27:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 984 states have (on average 3.0985772357723578) internal successors, (3049), 999 states have internal predecessors, (3049), 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) [2022-11-20 09:27:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 3049 transitions. [2022-11-20 09:27:37,725 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 3049 transitions. Word has length 13 [2022-11-20 09:27:37,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:37,726 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 3049 transitions. [2022-11-20 09:27:37,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 3049 transitions. [2022-11-20 09:27:37,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 09:27:37,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:37,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:37,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 09:27:37,728 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:27:37,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:37,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1724068647, now seen corresponding path program 1 times [2022-11-20 09:27:37,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:37,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014008508] [2022-11-20 09:27:37,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:37,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:38,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:38,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014008508] [2022-11-20 09:27:38,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014008508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:38,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:38,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:27:38,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37805076] [2022-11-20 09:27:38,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:38,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:27:38,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:38,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:27:38,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:27:38,069 INFO L87 Difference]: Start difference. First operand 1000 states and 3049 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:38,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:38,208 INFO L93 Difference]: Finished difference Result 992 states and 3023 transitions. [2022-11-20 09:27:38,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:27:38,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-20 09:27:38,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:38,214 INFO L225 Difference]: With dead ends: 992 [2022-11-20 09:27:38,214 INFO L226 Difference]: Without dead ends: 992 [2022-11-20 09:27:38,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:27:38,215 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 17 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:38,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:27:38,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-11-20 09:27:38,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2022-11-20 09:27:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 976 states have (on average 3.0973360655737703) internal successors, (3023), 991 states have internal predecessors, (3023), 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) [2022-11-20 09:27:38,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 3023 transitions. [2022-11-20 09:27:38,248 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 3023 transitions. Word has length 13 [2022-11-20 09:27:38,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:38,249 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 3023 transitions. [2022-11-20 09:27:38,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:38,249 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 3023 transitions. [2022-11-20 09:27:38,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 09:27:38,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:38,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:38,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 09:27:38,251 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:27:38,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:38,252 INFO L85 PathProgramCache]: Analyzing trace with hash -386850785, now seen corresponding path program 1 times [2022-11-20 09:27:38,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:38,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777691018] [2022-11-20 09:27:38,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:38,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:38,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:38,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777691018] [2022-11-20 09:27:38,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777691018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:38,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:38,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:27:38,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99268832] [2022-11-20 09:27:38,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:38,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:38,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:38,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:38,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:38,464 INFO L87 Difference]: Start difference. First operand 992 states and 3023 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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) [2022-11-20 09:27:38,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:38,587 INFO L93 Difference]: Finished difference Result 929 states and 2807 transitions. [2022-11-20 09:27:38,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:27:38,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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 [2022-11-20 09:27:38,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:38,592 INFO L225 Difference]: With dead ends: 929 [2022-11-20 09:27:38,592 INFO L226 Difference]: Without dead ends: 929 [2022-11-20 09:27:38,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:38,593 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:38,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 5 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:27:38,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-11-20 09:27:38,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 893. [2022-11-20 09:27:38,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 877 states have (on average 3.063854047890536) internal successors, (2687), 892 states have internal predecessors, (2687), 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) [2022-11-20 09:27:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 2687 transitions. [2022-11-20 09:27:38,624 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 2687 transitions. Word has length 13 [2022-11-20 09:27:38,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:38,624 INFO L495 AbstractCegarLoop]: Abstraction has 893 states and 2687 transitions. [2022-11-20 09:27:38,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 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) [2022-11-20 09:27:38,625 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 2687 transitions. [2022-11-20 09:27:38,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-20 09:27:38,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:38,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:38,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 09:27:38,627 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:27:38,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:38,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1837650336, now seen corresponding path program 1 times [2022-11-20 09:27:38,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:38,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8886138] [2022-11-20 09:27:38,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:38,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:38,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:38,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8886138] [2022-11-20 09:27:38,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8886138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:38,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:38,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:27:38,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527479704] [2022-11-20 09:27:38,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:38,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:27:38,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:38,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:27:38,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:27:38,922 INFO L87 Difference]: Start difference. First operand 893 states and 2687 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:39,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:39,061 INFO L93 Difference]: Finished difference Result 651 states and 1644 transitions. [2022-11-20 09:27:39,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:27:39,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-20 09:27:39,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:39,064 INFO L225 Difference]: With dead ends: 651 [2022-11-20 09:27:39,064 INFO L226 Difference]: Without dead ends: 559 [2022-11-20 09:27:39,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:39,065 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:39,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 6 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:27:39,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-11-20 09:27:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2022-11-20 09:27:39,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 543 states have (on average 2.604051565377532) internal successors, (1414), 558 states have internal predecessors, (1414), 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) [2022-11-20 09:27:39,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1414 transitions. [2022-11-20 09:27:39,082 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1414 transitions. Word has length 14 [2022-11-20 09:27:39,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:39,082 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 1414 transitions. [2022-11-20 09:27:39,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:39,083 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1414 transitions. [2022-11-20 09:27:39,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 09:27:39,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:39,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:39,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 09:27:39,084 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:27:39,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:39,085 INFO L85 PathProgramCache]: Analyzing trace with hash -2145895029, now seen corresponding path program 1 times [2022-11-20 09:27:39,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:39,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484814476] [2022-11-20 09:27:39,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:39,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:40,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:40,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484814476] [2022-11-20 09:27:40,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484814476] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:40,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:40,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:27:40,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662873302] [2022-11-20 09:27:40,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:40,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:27:40,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:40,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:27:40,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:27:40,828 INFO L87 Difference]: Start difference. First operand 559 states and 1414 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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) [2022-11-20 09:27:41,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:41,572 INFO L93 Difference]: Finished difference Result 588 states and 1452 transitions. [2022-11-20 09:27:41,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-20 09:27:41,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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 [2022-11-20 09:27:41,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:41,576 INFO L225 Difference]: With dead ends: 588 [2022-11-20 09:27:41,576 INFO L226 Difference]: Without dead ends: 582 [2022-11-20 09:27:41,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-20 09:27:41,577 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 94 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:41,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 12 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 09:27:41,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-11-20 09:27:41,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 555. [2022-11-20 09:27:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 539 states have (on average 2.5918367346938775) internal successors, (1397), 554 states have internal predecessors, (1397), 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) [2022-11-20 09:27:41,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1397 transitions. [2022-11-20 09:27:41,595 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1397 transitions. Word has length 15 [2022-11-20 09:27:41,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:41,596 INFO L495 AbstractCegarLoop]: Abstraction has 555 states and 1397 transitions. [2022-11-20 09:27:41,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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) [2022-11-20 09:27:41,596 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1397 transitions. [2022-11-20 09:27:41,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 09:27:41,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:41,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:41,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 09:27:41,598 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:27:41,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:41,599 INFO L85 PathProgramCache]: Analyzing trace with hash -2098240684, now seen corresponding path program 1 times [2022-11-20 09:27:41,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:41,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029610719] [2022-11-20 09:27:41,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:41,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:41,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:41,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029610719] [2022-11-20 09:27:41,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029610719] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:41,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:41,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:27:41,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440297504] [2022-11-20 09:27:41,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:41,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:27:41,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:41,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:27:41,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:27:41,823 INFO L87 Difference]: Start difference. First operand 555 states and 1397 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:41,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:41,975 INFO L93 Difference]: Finished difference Result 301 states and 638 transitions. [2022-11-20 09:27:41,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:27:41,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 09:27:41,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:41,977 INFO L225 Difference]: With dead ends: 301 [2022-11-20 09:27:41,977 INFO L226 Difference]: Without dead ends: 242 [2022-11-20 09:27:41,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:27:41,978 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 46 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:41,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 17 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:27:41,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-20 09:27:41,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-11-20 09:27:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 232 states have (on average 2.1508620689655173) internal successors, (499), 241 states have internal predecessors, (499), 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) [2022-11-20 09:27:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 499 transitions. [2022-11-20 09:27:41,985 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 499 transitions. Word has length 16 [2022-11-20 09:27:41,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:41,985 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 499 transitions. [2022-11-20 09:27:41,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:41,985 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 499 transitions. [2022-11-20 09:27:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-20 09:27:41,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:41,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:41,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 09:27:41,987 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:27:41,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:41,987 INFO L85 PathProgramCache]: Analyzing trace with hash -330263299, now seen corresponding path program 1 times [2022-11-20 09:27:41,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:41,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287658349] [2022-11-20 09:27:41,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:41,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:27:42,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:27:42,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:27:42,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287658349] [2022-11-20 09:27:42,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287658349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:27:42,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:27:42,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 09:27:42,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665039438] [2022-11-20 09:27:42,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:27:42,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:27:42,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:27:42,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:27:42,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:27:42,229 INFO L87 Difference]: Start difference. First operand 242 states and 499 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:42,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:27:42,376 INFO L93 Difference]: Finished difference Result 169 states and 349 transitions. [2022-11-20 09:27:42,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:27:42,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-20 09:27:42,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:27:42,377 INFO L225 Difference]: With dead ends: 169 [2022-11-20 09:27:42,377 INFO L226 Difference]: Without dead ends: 151 [2022-11-20 09:27:42,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-20 09:27:42,378 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 67 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:27:42,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 12 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:27:42,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-20 09:27:42,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-20 09:27:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 149 states have (on average 2.12751677852349) internal successors, (317), 150 states have internal predecessors, (317), 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) [2022-11-20 09:27:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 317 transitions. [2022-11-20 09:27:42,382 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 317 transitions. Word has length 18 [2022-11-20 09:27:42,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:27:42,382 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 317 transitions. [2022-11-20 09:27:42,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:27:42,383 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 317 transitions. [2022-11-20 09:27:42,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 09:27:42,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:27:42,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:42,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 09:27:42,386 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:27:42,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:27:42,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1178669297, now seen corresponding path program 1 times [2022-11-20 09:27:42,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:27:42,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460296780] [2022-11-20 09:27:42,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:27:42,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:27:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:27:42,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:27:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:27:42,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:27:42,588 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 09:27:42,590 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2022-11-20 09:27:42,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2022-11-20 09:27:42,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2022-11-20 09:27:42,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2022-11-20 09:27:42,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2022-11-20 09:27:42,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2022-11-20 09:27:42,594 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2022-11-20 09:27:42,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2022-11-20 09:27:42,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2022-11-20 09:27:42,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2022-11-20 09:27:42,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2022-11-20 09:27:42,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2022-11-20 09:27:42,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2022-11-20 09:27:42,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2022-11-20 09:27:42,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2022-11-20 09:27:42,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2022-11-20 09:27:42,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2022-11-20 09:27:42,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2022-11-20 09:27:42,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2022-11-20 09:27:42,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2022-11-20 09:27:42,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2022-11-20 09:27:42,598 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2022-11-20 09:27:42,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2022-11-20 09:27:42,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2022-11-20 09:27:42,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2022-11-20 09:27:42,599 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2022-11-20 09:27:42,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2022-11-20 09:27:42,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2022-11-20 09:27:42,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2022-11-20 09:27:42,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2022-11-20 09:27:42,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2022-11-20 09:27:42,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (21 of 53 remaining) [2022-11-20 09:27:42,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 53 remaining) [2022-11-20 09:27:42,603 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 53 remaining) [2022-11-20 09:27:42,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 53 remaining) [2022-11-20 09:27:42,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2022-11-20 09:27:42,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2022-11-20 09:27:42,604 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2022-11-20 09:27:42,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2022-11-20 09:27:42,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2022-11-20 09:27:42,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2022-11-20 09:27:42,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2022-11-20 09:27:42,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2022-11-20 09:27:42,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2022-11-20 09:27:42,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2022-11-20 09:27:42,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2022-11-20 09:27:42,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2022-11-20 09:27:42,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2022-11-20 09:27:42,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2022-11-20 09:27:42,607 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2022-11-20 09:27:42,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2022-11-20 09:27:42,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2022-11-20 09:27:42,608 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2022-11-20 09:27:42,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 09:27:42,611 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:27:42,618 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 09:27:42,618 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:27:42,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:27:42 BasicIcfg [2022-11-20 09:27:42,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:27:42,748 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:27:42,748 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:27:42,748 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:27:42,749 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:13" (3/4) ... [2022-11-20 09:27:42,752 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 09:27:42,752 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:27:42,753 INFO L158 Benchmark]: Toolchain (without parser) took 30874.77ms. Allocated memory was 146.8MB in the beginning and 394.3MB in the end (delta: 247.5MB). Free memory was 110.3MB in the beginning and 239.8MB in the end (delta: -129.5MB). Peak memory consumption was 117.2MB. Max. memory is 16.1GB. [2022-11-20 09:27:42,754 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 109.1MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:27:42,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 625.59ms. Allocated memory is still 146.8MB. Free memory was 110.3MB in the beginning and 88.0MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-20 09:27:42,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.77ms. Allocated memory is still 146.8MB. Free memory was 88.0MB in the beginning and 85.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:27:42,756 INFO L158 Benchmark]: Boogie Preprocessor took 67.20ms. Allocated memory is still 146.8MB. Free memory was 85.2MB in the beginning and 83.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:27:42,756 INFO L158 Benchmark]: RCFGBuilder took 1301.38ms. Allocated memory is still 146.8MB. Free memory was 83.2MB in the beginning and 55.6MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-20 09:27:42,756 INFO L158 Benchmark]: TraceAbstraction took 28816.14ms. Allocated memory was 146.8MB in the beginning and 394.3MB in the end (delta: 247.5MB). Free memory was 55.6MB in the beginning and 240.9MB in the end (delta: -185.2MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. [2022-11-20 09:27:42,757 INFO L158 Benchmark]: Witness Printer took 4.48ms. Allocated memory is still 394.3MB. Free memory was 240.9MB in the beginning and 239.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:27:42,765 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.29ms. Allocated memory is still 109.1MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 625.59ms. Allocated memory is still 146.8MB. Free memory was 110.3MB in the beginning and 88.0MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.77ms. Allocated memory is still 146.8MB. Free memory was 88.0MB in the beginning and 85.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.20ms. Allocated memory is still 146.8MB. Free memory was 85.2MB in the beginning and 83.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1301.38ms. Allocated memory is still 146.8MB. Free memory was 83.2MB in the beginning and 55.6MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 28816.14ms. Allocated memory was 146.8MB in the beginning and 394.3MB in the end (delta: 247.5MB). Free memory was 55.6MB in the beginning and 240.9MB in the end (delta: -185.2MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. * Witness Printer took 4.48ms. Allocated memory is still 394.3MB. Free memory was 240.9MB in the beginning and 239.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.8s, 172 PlacesBefore, 68 PlacesAfterwards, 164 TransitionsBefore, 59 TransitionsAfterwards, 4540 CoEnabledTransitionPairs, 8 FixpointIterations, 71 TrivialSequentialCompositions, 90 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 168 TotalNumberOfCompositions, 15563 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7194, independent: 6838, independent conditional: 0, independent unconditional: 6838, dependent: 356, dependent conditional: 0, dependent unconditional: 356, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3001, independent: 2916, independent conditional: 0, independent unconditional: 2916, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3001, independent: 2722, independent conditional: 0, independent unconditional: 2722, dependent: 279, dependent conditional: 0, dependent unconditional: 279, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 279, independent: 194, independent conditional: 0, independent unconditional: 194, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1403, independent: 800, independent conditional: 0, independent unconditional: 800, dependent: 603, dependent conditional: 0, dependent unconditional: 603, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7194, independent: 3922, independent conditional: 0, independent unconditional: 3922, dependent: 271, dependent conditional: 0, dependent unconditional: 271, unknown: 3001, unknown conditional: 0, unknown unconditional: 3001] , Statistics on independence cache: Total cache size (in pairs): 437, Positive cache size: 397, Positive conditional cache size: 0, Positive unconditional cache size: 397, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2213; [L832] FCALL, FORK 0 pthread_create(&t2213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2213, ((void *)0), P0, ((void *)0))=-2, t2213={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3: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] [L833] 0 pthread_t t2214; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2213={6:0}, t2214={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3: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] [L834] FCALL, FORK 0 pthread_create(&t2214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2214, ((void *)0), P1, ((void *)0))=-1, t2213={6:0}, t2214={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3: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] [L835] 0 pthread_t t2215; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 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) [L765] EXPR 1 \read(y) [L765] 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) [L765] 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) [L766] 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)) [L767] 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)) [L768] 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)) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x=0, y={3: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] [L779] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x=0, y={3: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] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L791] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x=1, y={3: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] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L836] FCALL, FORK 0 pthread_create(&t2215, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2215, ((void *)0), P2, ((void *)0))=0, t2213={6:0}, t2214={7:0}, t2215={5:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x=1, y={3: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] [L803] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x=1, y={3: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] [L806] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x=1, y={3: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] [L809] 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) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 \read(y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] 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) [L809] 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) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 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 [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 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 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x=1, y={3: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] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 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) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 0 \read(y) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] 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) [L842] 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) [L843] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] 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 [L845] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] 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 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2213={6:0}, t2214={7:0}, t2215={5:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x=1, y={3: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] [L849] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L850] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L850] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=1, x=1, y={3: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] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 832]: 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: 836]: 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, 205 locations, 53 error locations. Started 1 CEGAR loops. OverallTime: 28.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 602 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 602 mSDsluCounter, 100 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1310 IncrementalHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 43 mSDtfsCounter, 1310 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8226occurred in iteration=0, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 1784 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 1609 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 could not prove your program: unable to determine feasibility of some traces [2022-11-20 09:27:42,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f413b41672ef8cb3f594e0d22a82a07ab4d735f8bfa69fff7e94198d51bd0eb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 09:27:45,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:27:45,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:27:45,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:27:45,295 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:27:45,296 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:27:45,298 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:27:45,300 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:27:45,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:27:45,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:27:45,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:27:45,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:27:45,313 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:27:45,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:27:45,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:27:45,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:27:45,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:27:45,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:27:45,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:27:45,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:27:45,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:27:45,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:27:45,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:27:45,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:27:45,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:27:45,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:27:45,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:27:45,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:27:45,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:27:45,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:27:45,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:27:45,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:27:45,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:27:45,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:27:45,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:27:45,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:27:45,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:27:45,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:27:45,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:27:45,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:27:45,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:27:45,379 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-20 09:27:45,419 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:27:45,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:27:45,420 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:27:45,420 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:27:45,421 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:27:45,421 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:27:45,422 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:27:45,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:27:45,422 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:27:45,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:27:45,422 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:27:45,423 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 09:27:45,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:27:45,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:27:45,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:27:45,423 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 09:27:45,423 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 09:27:45,424 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 09:27:45,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:27:45,424 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 09:27:45,424 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 09:27:45,424 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 09:27:45,424 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:27:45,425 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:27:45,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:27:45,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:27:45,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:27:45,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:45,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:27:45,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:27:45,428 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 09:27:45,428 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 09:27:45,428 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 09:27:45,429 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/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_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 6f413b41672ef8cb3f594e0d22a82a07ab4d735f8bfa69fff7e94198d51bd0eb [2022-11-20 09:27:45,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:27:45,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:27:45,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:27:45,864 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:27:45,864 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:27:45,866 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i [2022-11-20 09:27:49,060 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:27:49,316 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:27:49,317 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i [2022-11-20 09:27:49,347 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/data/30d8095ef/2e7ba118d3fd46cd91c9581a5af860fb/FLAG881b0377a [2022-11-20 09:27:49,363 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/data/30d8095ef/2e7ba118d3fd46cd91c9581a5af860fb [2022-11-20 09:27:49,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:27:49,368 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:27:49,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:49,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:27:49,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:27:49,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:49" (1/1) ... [2022-11-20 09:27:49,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d87abd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:49, skipping insertion in model container [2022-11-20 09:27:49,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:27:49" (1/1) ... [2022-11-20 09:27:49,389 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:27:49,434 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:27:49,596 WARN L237 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_d57cb844-a778-4984-86c3-def5fa1422f1/sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i[993,1006] [2022-11-20 09:27:49,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:49,926 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:27:49,946 WARN L237 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_d57cb844-a778-4984-86c3-def5fa1422f1/sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i[993,1006] [2022-11-20 09:27:50,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:27:50,105 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:27:50,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:50 WrapperNode [2022-11-20 09:27:50,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:27:50,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:50,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:27:50,110 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:27:50,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:50" (1/1) ... [2022-11-20 09:27:50,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:50" (1/1) ... [2022-11-20 09:27:50,200 INFO L138 Inliner]: procedures = 180, calls = 65, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-11-20 09:27:50,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:27:50,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:27:50,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:27:50,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:27:50,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:50" (1/1) ... [2022-11-20 09:27:50,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:50" (1/1) ... [2022-11-20 09:27:50,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:50" (1/1) ... [2022-11-20 09:27:50,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:50" (1/1) ... [2022-11-20 09:27:50,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:50" (1/1) ... [2022-11-20 09:27:50,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:50" (1/1) ... [2022-11-20 09:27:50,261 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:50" (1/1) ... [2022-11-20 09:27:50,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:50" (1/1) ... [2022-11-20 09:27:50,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:27:50,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:27:50,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:27:50,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:27:50,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:50" (1/1) ... [2022-11-20 09:27:50,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:27:50,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:27:50,313 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:27:50,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:27:50,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-20 09:27:50,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 09:27:50,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:27:50,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 09:27:50,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:27:50,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-20 09:27:50,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 09:27:50,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-11-20 09:27:50,365 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-20 09:27:50,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-20 09:27:50,366 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-20 09:27:50,366 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-20 09:27:50,366 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-20 09:27:50,366 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-20 09:27:50,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 09:27:50,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:27:50,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:27:50,369 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 09:27:50,628 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:27:50,633 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:27:51,236 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:27:51,694 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:27:51,694 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 09:27:51,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:51 BoogieIcfgContainer [2022-11-20 09:27:51,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:27:51,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:27:51,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:27:51,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:27:51,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:27:49" (1/3) ... [2022-11-20 09:27:51,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e0fffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:51, skipping insertion in model container [2022-11-20 09:27:51,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:27:50" (2/3) ... [2022-11-20 09:27:51,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e0fffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:27:51, skipping insertion in model container [2022-11-20 09:27:51,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:51" (3/3) ... [2022-11-20 09:27:51,712 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.oepc.i [2022-11-20 09:27:51,733 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:27:51,733 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2022-11-20 09:27:51,733 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 09:27:51,863 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-20 09:27:51,916 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 09:27:51,945 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 165 transitions, 345 flow [2022-11-20 09:27:51,960 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 165 transitions, 345 flow [2022-11-20 09:27:51,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 165 transitions, 345 flow [2022-11-20 09:27:52,120 INFO L130 PetriNetUnfolder]: 2/162 cut-off events. [2022-11-20 09:27:52,121 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 09:27:52,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 162 events. 2/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 180 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 100. Up to 2 conditions per place. [2022-11-20 09:27:52,133 INFO L119 LiptonReduction]: Number of co-enabled transitions 4540 [2022-11-20 09:28:20,053 INFO L134 LiptonReduction]: Checked pairs total: 15283 [2022-11-20 09:28:20,053 INFO L136 LiptonReduction]: Total number of compositions: 168 [2022-11-20 09:28:20,063 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68 places, 59 transitions, 133 flow [2022-11-20 09:28:20,402 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 8226 states, 7354 states have (on average 3.881289094370411) internal successors, (28543), 8225 states have internal predecessors, (28543), 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) [2022-11-20 09:28:20,428 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:28:20,436 INFO L357 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@f0bc3d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:28:20,436 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2022-11-20 09:28:20,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 8226 states, 7354 states have (on average 3.881289094370411) internal successors, (28543), 8225 states have internal predecessors, (28543), 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) [2022-11-20 09:28:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-20 09:28:20,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:20,490 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-20 09:28:20,492 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:28:20,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:20,503 INFO L85 PathProgramCache]: Analyzing trace with hash 820, now seen corresponding path program 1 times [2022-11-20 09:28:20,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:28:20,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744298843] [2022-11-20 09:28:20,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:20,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:28:20,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:28:20,519 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 09:28:20,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-20 09:28:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:20,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 09:28:20,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:20,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:28:20,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:20,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:28:20,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744298843] [2022-11-20 09:28:20,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744298843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:20,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:28:20,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-20 09:28:20,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895911376] [2022-11-20 09:28:20,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:20,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 09:28:20,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:28:20,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 09:28:20,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:28:20,814 INFO L87 Difference]: Start difference. First operand has 8226 states, 7354 states have (on average 3.881289094370411) internal successors, (28543), 8225 states have internal predecessors, (28543), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) [2022-11-20 09:28:21,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:21,083 INFO L93 Difference]: Finished difference Result 2486 states and 8177 transitions. [2022-11-20 09:28:21,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 09:28:21,086 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2022-11-20 09:28:21,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:21,125 INFO L225 Difference]: With dead ends: 2486 [2022-11-20 09:28:21,126 INFO L226 Difference]: Without dead ends: 2486 [2022-11-20 09:28:21,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:28:21,131 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:21,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:28:21,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2022-11-20 09:28:21,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2486. [2022-11-20 09:28:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2352 states have (on average 3.4766156462585034) internal successors, (8177), 2485 states have internal predecessors, (8177), 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) [2022-11-20 09:28:21,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 8177 transitions. [2022-11-20 09:28:21,506 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 8177 transitions. Word has length 1 [2022-11-20 09:28:21,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:21,507 INFO L495 AbstractCegarLoop]: Abstraction has 2486 states and 8177 transitions. [2022-11-20 09:28:21,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) [2022-11-20 09:28:21,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 8177 transitions. [2022-11-20 09:28:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 09:28:21,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:21,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 09:28:21,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-20 09:28:21,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:28:21,721 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:28:21,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:21,722 INFO L85 PathProgramCache]: Analyzing trace with hash 808908, now seen corresponding path program 1 times [2022-11-20 09:28:21,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:28:21,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291319146] [2022-11-20 09:28:21,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:21,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:28:21,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:28:21,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 09:28:21,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-20 09:28:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:21,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 09:28:21,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:21,985 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-20 09:28:21,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-20 09:28:22,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:28:22,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:22,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:28:22,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291319146] [2022-11-20 09:28:22,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291319146] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:22,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:28:22,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:28:22,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979915764] [2022-11-20 09:28:22,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:22,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:28:22,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:28:22,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:28:22,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:28:22,042 INFO L87 Difference]: Start difference. First operand 2486 states and 8177 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:22,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:22,289 INFO L93 Difference]: Finished difference Result 1502 states and 4781 transitions. [2022-11-20 09:28:22,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:28:22,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 09:28:22,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:22,301 INFO L225 Difference]: With dead ends: 1502 [2022-11-20 09:28:22,302 INFO L226 Difference]: Without dead ends: 1502 [2022-11-20 09:28:22,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:28:22,304 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:22,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:28:22,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2022-11-20 09:28:22,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1502. [2022-11-20 09:28:22,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1453 states have (on average 3.29043358568479) internal successors, (4781), 1501 states have internal predecessors, (4781), 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) [2022-11-20 09:28:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 4781 transitions. [2022-11-20 09:28:22,441 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 4781 transitions. Word has length 3 [2022-11-20 09:28:22,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:22,442 INFO L495 AbstractCegarLoop]: Abstraction has 1502 states and 4781 transitions. [2022-11-20 09:28:22,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:22,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 4781 transitions. [2022-11-20 09:28:22,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-20 09:28:22,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:22,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-20 09:28:22,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:22,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:28:22,643 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:28:22,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:22,644 INFO L85 PathProgramCache]: Analyzing trace with hash 808909, now seen corresponding path program 1 times [2022-11-20 09:28:22,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:28:22,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352820349] [2022-11-20 09:28:22,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:22,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:28:22,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:28:22,647 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 09:28:22,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-20 09:28:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:22,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:28:22,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:22,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:28:22,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 09:28:22,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:28:22,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:22,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:28:22,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352820349] [2022-11-20 09:28:22,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352820349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:22,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:28:22,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-20 09:28:22,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337690278] [2022-11-20 09:28:22,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:22,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:28:22,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:28:22,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:28:22,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:28:22,878 INFO L87 Difference]: Start difference. First operand 1502 states and 4781 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:23,037 INFO L93 Difference]: Finished difference Result 932 states and 2879 transitions. [2022-11-20 09:28:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:28:23,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-20 09:28:23,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:23,046 INFO L225 Difference]: With dead ends: 932 [2022-11-20 09:28:23,047 INFO L226 Difference]: Without dead ends: 932 [2022-11-20 09:28:23,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:28:23,048 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:23,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 09:28:23,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-11-20 09:28:23,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2022-11-20 09:28:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 914 states have (on average 3.149890590809628) internal successors, (2879), 931 states have internal predecessors, (2879), 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) [2022-11-20 09:28:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 2879 transitions. [2022-11-20 09:28:23,114 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 2879 transitions. Word has length 3 [2022-11-20 09:28:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:23,114 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 2879 transitions. [2022-11-20 09:28:23,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 2879 transitions. [2022-11-20 09:28:23,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 09:28:23,117 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:23,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:23,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:23,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:28:23,328 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:28:23,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:23,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1242115121, now seen corresponding path program 1 times [2022-11-20 09:28:23,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:28:23,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65425574] [2022-11-20 09:28:23,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:23,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:28:23,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:28:23,332 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 09:28:23,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-20 09:28:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:23,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 09:28:23,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:23,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:28:23,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:23,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:28:23,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65425574] [2022-11-20 09:28:23,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65425574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:23,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:28:23,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:28:23,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891456885] [2022-11-20 09:28:23,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:23,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 09:28:23,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:28:23,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 09:28:23,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:28:23,574 INFO L87 Difference]: Start difference. First operand 932 states and 2879 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) 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) [2022-11-20 09:28:23,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:23,776 INFO L93 Difference]: Finished difference Result 568 states and 1461 transitions. [2022-11-20 09:28:23,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 09:28:23,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) 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 [2022-11-20 09:28:23,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:23,783 INFO L225 Difference]: With dead ends: 568 [2022-11-20 09:28:23,784 INFO L226 Difference]: Without dead ends: 568 [2022-11-20 09:28:23,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 09:28:23,785 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:23,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:28:23,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2022-11-20 09:28:23,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2022-11-20 09:28:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 550 states have (on average 2.6563636363636363) internal successors, (1461), 567 states have internal predecessors, (1461), 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) [2022-11-20 09:28:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 1461 transitions. [2022-11-20 09:28:23,810 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 1461 transitions. Word has length 10 [2022-11-20 09:28:23,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:23,811 INFO L495 AbstractCegarLoop]: Abstraction has 568 states and 1461 transitions. [2022-11-20 09:28:23,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) 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) [2022-11-20 09:28:23,811 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 1461 transitions. [2022-11-20 09:28:23,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-20 09:28:23,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:23,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:23,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:24,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:28:24,027 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:28:24,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:24,028 INFO L85 PathProgramCache]: Analyzing trace with hash -331324596, now seen corresponding path program 1 times [2022-11-20 09:28:24,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:28:24,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455970328] [2022-11-20 09:28:24,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:24,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:28:24,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:28:24,032 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 09:28:24,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-20 09:28:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:24,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 09:28:24,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:28:24,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:24,431 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:28:24,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455970328] [2022-11-20 09:28:24,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455970328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:24,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:28:24,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:28:24,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127780687] [2022-11-20 09:28:24,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:24,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:28:24,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:28:24,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:28:24,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:28:24,435 INFO L87 Difference]: Start difference. First operand 568 states and 1461 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:24,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:24,709 INFO L93 Difference]: Finished difference Result 220 states and 448 transitions. [2022-11-20 09:28:24,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:28:24,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-20 09:28:24,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:24,712 INFO L225 Difference]: With dead ends: 220 [2022-11-20 09:28:24,713 INFO L226 Difference]: Without dead ends: 220 [2022-11-20 09:28:24,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:28:24,714 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:24,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 11 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:28:24,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-20 09:28:24,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-11-20 09:28:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 208 states have (on average 2.1538461538461537) internal successors, (448), 219 states have internal predecessors, (448), 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) [2022-11-20 09:28:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 448 transitions. [2022-11-20 09:28:24,726 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 448 transitions. Word has length 12 [2022-11-20 09:28:24,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:24,727 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 448 transitions. [2022-11-20 09:28:24,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 448 transitions. [2022-11-20 09:28:24,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 09:28:24,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:24,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:24,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:24,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:28:24,945 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:28:24,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:24,945 INFO L85 PathProgramCache]: Analyzing trace with hash 671611936, now seen corresponding path program 1 times [2022-11-20 09:28:24,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:28:24,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388490441] [2022-11-20 09:28:24,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:24,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:28:24,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:28:24,948 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 09:28:24,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-20 09:28:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:25,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:28:25,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:25,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:28:25,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:25,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:28:25,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388490441] [2022-11-20 09:28:25,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388490441] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:25,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:28:25,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 09:28:25,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836556595] [2022-11-20 09:28:25,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:25,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:28:25,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:28:25,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:28:25,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:28:25,217 INFO L87 Difference]: Start difference. First operand 220 states and 448 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:25,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:25,570 INFO L93 Difference]: Finished difference Result 119 states and 252 transitions. [2022-11-20 09:28:25,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 09:28:25,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-20 09:28:25,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:25,572 INFO L225 Difference]: With dead ends: 119 [2022-11-20 09:28:25,572 INFO L226 Difference]: Without dead ends: 119 [2022-11-20 09:28:25,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:28:25,573 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 24 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:25,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 18 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:28:25,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-20 09:28:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-11-20 09:28:25,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 115 states have (on average 2.1913043478260867) internal successors, (252), 118 states have internal predecessors, (252), 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) [2022-11-20 09:28:25,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 252 transitions. [2022-11-20 09:28:25,579 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 252 transitions. Word has length 15 [2022-11-20 09:28:25,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:25,579 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 252 transitions. [2022-11-20 09:28:25,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:28:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 252 transitions. [2022-11-20 09:28:25,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 09:28:25,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:25,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:25,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:25,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:28:25,796 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:28:25,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:25,796 INFO L85 PathProgramCache]: Analyzing trace with hash -98489243, now seen corresponding path program 1 times [2022-11-20 09:28:25,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:28:25,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173580] [2022-11-20 09:28:25,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:25,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:28:25,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:28:25,799 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 09:28:25,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-20 09:28:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:26,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 09:28:26,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:26,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:28:26,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:26,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:28:26,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173580] [2022-11-20 09:28:26,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:26,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:28:26,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:28:26,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655718187] [2022-11-20 09:28:26,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:26,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:28:26,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:28:26,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:28:26,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:28:26,139 INFO L87 Difference]: Start difference. First operand 119 states and 252 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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) [2022-11-20 09:28:26,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:26,352 INFO L93 Difference]: Finished difference Result 118 states and 251 transitions. [2022-11-20 09:28:26,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:28:26,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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 [2022-11-20 09:28:26,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:26,354 INFO L225 Difference]: With dead ends: 118 [2022-11-20 09:28:26,354 INFO L226 Difference]: Without dead ends: 118 [2022-11-20 09:28:26,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:28:26,355 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:26,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 2 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:28:26,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-20 09:28:26,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-11-20 09:28:26,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 115 states have (on average 2.1826086956521737) internal successors, (251), 117 states have internal predecessors, (251), 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) [2022-11-20 09:28:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 251 transitions. [2022-11-20 09:28:26,360 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 251 transitions. Word has length 19 [2022-11-20 09:28:26,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:26,361 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 251 transitions. [2022-11-20 09:28:26,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 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) [2022-11-20 09:28:26,361 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 251 transitions. [2022-11-20 09:28:26,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-20 09:28:26,362 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:26,362 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:26,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-11-20 09:28:26,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:28:26,563 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:28:26,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:26,564 INFO L85 PathProgramCache]: Analyzing trace with hash -98489242, now seen corresponding path program 1 times [2022-11-20 09:28:26,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:28:26,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396138510] [2022-11-20 09:28:26,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:26,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:28:26,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:28:26,567 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 09:28:26,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-20 09:28:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:26,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 09:28:26,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:27,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:28:27,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:27,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:28:27,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396138510] [2022-11-20 09:28:27,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [396138510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:27,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:28:27,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:28:27,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87776080] [2022-11-20 09:28:27,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:27,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 09:28:27,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:28:27,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 09:28:27,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:28:27,090 INFO L87 Difference]: Start difference. First operand 118 states and 251 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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) [2022-11-20 09:28:27,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:27,253 INFO L93 Difference]: Finished difference Result 117 states and 250 transitions. [2022-11-20 09:28:27,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 09:28:27,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 [2022-11-20 09:28:27,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:27,255 INFO L225 Difference]: With dead ends: 117 [2022-11-20 09:28:27,255 INFO L226 Difference]: Without dead ends: 117 [2022-11-20 09:28:27,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 09:28:27,256 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:27,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 09:28:27,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-20 09:28:27,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-11-20 09:28:27,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 115 states have (on average 2.1739130434782608) internal successors, (250), 116 states have internal predecessors, (250), 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) [2022-11-20 09:28:27,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 250 transitions. [2022-11-20 09:28:27,262 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 250 transitions. Word has length 19 [2022-11-20 09:28:27,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:27,263 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 250 transitions. [2022-11-20 09:28:27,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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) [2022-11-20 09:28:27,263 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 250 transitions. [2022-11-20 09:28:27,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 09:28:27,264 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:27,265 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:27,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:27,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:28:27,481 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:28:27,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:27,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1241797160, now seen corresponding path program 1 times [2022-11-20 09:28:27,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:28:27,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277393240] [2022-11-20 09:28:27,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:28:27,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:28:27,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:28:27,484 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 09:28:27,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-20 09:28:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:28:27,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:28:27,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:28:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:28:27,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:28:27,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:28:27,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277393240] [2022-11-20 09:28:27,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277393240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:28:27,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:28:27,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 09:28:27,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592557238] [2022-11-20 09:28:27,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:28:27,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 09:28:27,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:28:27,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 09:28:27,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 09:28:27,864 INFO L87 Difference]: Start difference. First operand 117 states and 250 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2022-11-20 09:28:28,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:28:28,154 INFO L93 Difference]: Finished difference Result 159 states and 331 transitions. [2022-11-20 09:28:28,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 09:28:28,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2022-11-20 09:28:28,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:28:28,156 INFO L225 Difference]: With dead ends: 159 [2022-11-20 09:28:28,156 INFO L226 Difference]: Without dead ends: 159 [2022-11-20 09:28:28,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:28:28,158 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 09:28:28,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 7 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 09:28:28,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-20 09:28:28,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2022-11-20 09:28:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 153 states have (on average 2.1437908496732025) internal successors, (328), 154 states have internal predecessors, (328), 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) [2022-11-20 09:28:28,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 328 transitions. [2022-11-20 09:28:28,166 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 328 transitions. Word has length 20 [2022-11-20 09:28:28,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:28:28,166 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 328 transitions. [2022-11-20 09:28:28,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) [2022-11-20 09:28:28,167 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 328 transitions. [2022-11-20 09:28:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 09:28:28,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:28:28,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:28,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:28,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:28:28,384 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2022-11-20 09:28:28,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:28:28,385 INFO L85 PathProgramCache]: Analyzing trace with hash 170728890, now seen corresponding path program 2 times [2022-11-20 09:28:28,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:28:28,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404805516] [2022-11-20 09:28:28,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:28:28,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:28:28,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:28:28,387 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-20 09:28:28,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-20 09:28:28,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 09:28:28,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-20 09:28:28,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:28:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:28:28,951 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-20 09:28:28,952 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 09:28:28,953 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2022-11-20 09:28:28,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2022-11-20 09:28:28,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2022-11-20 09:28:28,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2022-11-20 09:28:28,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2022-11-20 09:28:28,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2022-11-20 09:28:28,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2022-11-20 09:28:28,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2022-11-20 09:28:28,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2022-11-20 09:28:28,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2022-11-20 09:28:28,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2022-11-20 09:28:28,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2022-11-20 09:28:28,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2022-11-20 09:28:28,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2022-11-20 09:28:28,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2022-11-20 09:28:28,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2022-11-20 09:28:28,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2022-11-20 09:28:28,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2022-11-20 09:28:28,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2022-11-20 09:28:28,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2022-11-20 09:28:28,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2022-11-20 09:28:28,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2022-11-20 09:28:28,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2022-11-20 09:28:28,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2022-11-20 09:28:28,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2022-11-20 09:28:28,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2022-11-20 09:28:28,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2022-11-20 09:28:28,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2022-11-20 09:28:28,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2022-11-20 09:28:28,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2022-11-20 09:28:28,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2022-11-20 09:28:28,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (21 of 53 remaining) [2022-11-20 09:28:28,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 53 remaining) [2022-11-20 09:28:28,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 53 remaining) [2022-11-20 09:28:28,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 53 remaining) [2022-11-20 09:28:28,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2022-11-20 09:28:28,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2022-11-20 09:28:28,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2022-11-20 09:28:28,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2022-11-20 09:28:28,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 53 remaining) [2022-11-20 09:28:28,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 53 remaining) [2022-11-20 09:28:28,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 53 remaining) [2022-11-20 09:28:28,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2022-11-20 09:28:28,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2022-11-20 09:28:28,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 53 remaining) [2022-11-20 09:28:28,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 53 remaining) [2022-11-20 09:28:28,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 53 remaining) [2022-11-20 09:28:28,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2022-11-20 09:28:28,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2022-11-20 09:28:28,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 53 remaining) [2022-11-20 09:28:28,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 53 remaining) [2022-11-20 09:28:28,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 53 remaining) [2022-11-20 09:28:28,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 53 remaining) [2022-11-20 09:28:29,005 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-20 09:28:29,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-20 09:28:29,201 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:28:29,208 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-20 09:28:29,208 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:28:29,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:28:29 BasicIcfg [2022-11-20 09:28:29,356 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:28:29,357 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:28:29,357 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:28:29,357 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:28:29,358 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:27:51" (3/4) ... [2022-11-20 09:28:29,361 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 09:28:29,361 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:28:29,362 INFO L158 Benchmark]: Toolchain (without parser) took 39994.72ms. Allocated memory was 69.2MB in the beginning and 174.1MB in the end (delta: 104.9MB). Free memory was 40.0MB in the beginning and 108.4MB in the end (delta: -68.4MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2022-11-20 09:28:29,363 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 69.2MB. Free memory was 47.9MB in the beginning and 47.8MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:28:29,363 INFO L158 Benchmark]: CACSL2BoogieTranslator took 736.71ms. Allocated memory was 69.2MB in the beginning and 98.6MB in the end (delta: 29.4MB). Free memory was 39.8MB in the beginning and 66.5MB in the end (delta: -26.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-20 09:28:29,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.67ms. Allocated memory is still 98.6MB. Free memory was 66.5MB in the beginning and 64.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:28:29,364 INFO L158 Benchmark]: Boogie Preprocessor took 76.29ms. Allocated memory is still 98.6MB. Free memory was 64.1MB in the beginning and 61.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 09:28:29,364 INFO L158 Benchmark]: RCFGBuilder took 1419.51ms. Allocated memory is still 98.6MB. Free memory was 61.6MB in the beginning and 59.5MB in the end (delta: 2.1MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2022-11-20 09:28:29,365 INFO L158 Benchmark]: TraceAbstraction took 37654.03ms. Allocated memory was 98.6MB in the beginning and 174.1MB in the end (delta: 75.5MB). Free memory was 58.8MB in the beginning and 109.5MB in the end (delta: -50.7MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. [2022-11-20 09:28:29,365 INFO L158 Benchmark]: Witness Printer took 5.04ms. Allocated memory is still 174.1MB. Free memory was 109.5MB in the beginning and 108.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:28:29,367 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.25ms. Allocated memory is still 69.2MB. Free memory was 47.9MB in the beginning and 47.8MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 736.71ms. Allocated memory was 69.2MB in the beginning and 98.6MB in the end (delta: 29.4MB). Free memory was 39.8MB in the beginning and 66.5MB in the end (delta: -26.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.67ms. Allocated memory is still 98.6MB. Free memory was 66.5MB in the beginning and 64.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.29ms. Allocated memory is still 98.6MB. Free memory was 64.1MB in the beginning and 61.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1419.51ms. Allocated memory is still 98.6MB. Free memory was 61.6MB in the beginning and 59.5MB in the end (delta: 2.1MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * TraceAbstraction took 37654.03ms. Allocated memory was 98.6MB in the beginning and 174.1MB in the end (delta: 75.5MB). Free memory was 58.8MB in the beginning and 109.5MB in the end (delta: -50.7MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. * Witness Printer took 5.04ms. Allocated memory is still 174.1MB. Free memory was 109.5MB in the beginning and 108.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.1s, 173 PlacesBefore, 68 PlacesAfterwards, 165 TransitionsBefore, 59 TransitionsAfterwards, 4540 CoEnabledTransitionPairs, 8 FixpointIterations, 72 TrivialSequentialCompositions, 89 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 168 TotalNumberOfCompositions, 15283 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7147, independent: 6802, independent conditional: 0, independent unconditional: 6802, dependent: 341, dependent conditional: 0, dependent unconditional: 341, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2991, independent: 2910, independent conditional: 0, independent unconditional: 2910, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2991, independent: 2721, independent conditional: 0, independent unconditional: 2721, dependent: 270, dependent conditional: 0, dependent unconditional: 270, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 270, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2191, independent: 958, independent conditional: 0, independent unconditional: 958, dependent: 1197, dependent conditional: 0, dependent unconditional: 1197, unknown: 37, unknown conditional: 0, unknown unconditional: 37] ], Cache Queries: [ total: 7147, independent: 3892, independent conditional: 0, independent unconditional: 3892, dependent: 261, dependent conditional: 0, dependent unconditional: 261, unknown: 2994, unknown conditional: 0, unknown unconditional: 2994] , Statistics on independence cache: Total cache size (in pairs): 421, Positive cache size: 384, Positive conditional cache size: 0, Positive unconditional cache size: 384, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 1, Unknown conditional cache size: 0, Unknown unconditional cache size: 1 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2213; [L832] FCALL, FORK 0 pthread_create(&t2213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2213, ((void *)0), P0, ((void *)0))=0, t2213={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3: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] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] 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) [L765] EXPR 1 \read(y) [L765] 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) [L765] 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) [L766] 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)) [L767] 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)) [L768] 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)) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] EXPR 1 \read(y) [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={3: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] [L779] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={3: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] [L833] 0 pthread_t t2214; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2213={15:0}, t2214={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={3: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] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L834] FCALL, FORK 0 pthread_create(&t2214, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2214, ((void *)0), P1, ((void *)0))=1, t2213={15:0}, t2214={7:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={3: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] [L835] 0 pthread_t t2215; [L836] FCALL, FORK 0 pthread_create(&t2215, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2215, ((void *)0), P2, ((void *)0))=2, t2213={15:0}, t2214={7:0}, t2215={5:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y={3: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] [L791] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3: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] [L803] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3: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] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L806] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3: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] [L809] 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) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 \read(y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] 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) [L809] 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) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 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 [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 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 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3: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] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 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) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 0 \read(y) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] 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) [L842] 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) [L843] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] 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 [L845] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] 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 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2213={15:0}, t2214={7:0}, t2215={5:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y={3: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] [L849] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L850] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L850] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=128, weak$$choice2=0, x=1, y={3: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] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 832]: 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: 836]: 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, 206 locations, 53 error locations. Started 1 CEGAR loops. OverallTime: 37.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 28.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 640 IncrementalHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 25 mSDtfsCounter, 640 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8226occurred in iteration=0, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 507 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1188 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 could not prove your program: unable to determine feasibility of some traces [2022-11-20 09:28:29,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57cb844-a778-4984-86c3-def5fa1422f1/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample