./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e04fb08f 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_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8 --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 fdecd751bbf3d5ef761eacebee2616261a6cad4ae3645147e0ad096bd1775198 --- 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-e04fb08 [2022-11-16 12:53:04,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:53:04,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:53:05,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:53:05,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:53:05,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:53:05,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:53:05,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:53:05,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:53:05,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:53:05,032 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:53:05,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:53:05,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:53:05,035 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:53:05,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:53:05,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:53:05,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:53:05,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:53:05,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:53:05,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:53:05,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:53:05,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:53:05,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:53:05,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:53:05,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:53:05,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:53:05,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:53:05,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:53:05,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:53:05,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:53:05,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:53:05,057 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:53:05,058 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:53:05,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:53:05,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:53:05,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:53:05,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:53:05,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:53:05,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:53:05,064 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:53:05,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:53:05,068 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 12:53:05,100 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:53:05,100 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:53:05,101 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:53:05,101 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:53:05,103 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:53:05,103 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:53:05,104 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:53:05,104 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:53:05,104 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:53:05,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:53:05,106 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:53:05,106 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:53:05,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:53:05,107 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:53:05,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:53:05,107 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:53:05,107 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:53:05,108 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 12:53:05,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:53:05,108 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:53:05,108 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:53:05,109 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:53:05,109 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:53:05,109 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:53:05,109 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:53:05,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:53:05,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:53:05,110 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:53:05,111 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:53:05,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:53:05,111 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_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8 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 -> fdecd751bbf3d5ef761eacebee2616261a6cad4ae3645147e0ad096bd1775198 [2022-11-16 12:53:05,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:53:05,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:53:05,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:53:05,421 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:53:05,423 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:53:05,424 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 12:53:05,502 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/data/59a34ba2f/bb5d2a6c99cc404fb5a5ab5679a22b34/FLAG25dd1e565 [2022-11-16 12:53:06,144 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:53:06,145 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/sv-benchmarks/c/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 12:53:06,160 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/data/59a34ba2f/bb5d2a6c99cc404fb5a5ab5679a22b34/FLAG25dd1e565 [2022-11-16 12:53:06,401 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/data/59a34ba2f/bb5d2a6c99cc404fb5a5ab5679a22b34 [2022-11-16 12:53:06,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:53:06,405 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:53:06,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:53:06,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:53:06,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:53:06,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:53:06" (1/1) ... [2022-11-16 12:53:06,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d97cbe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:06, skipping insertion in model container [2022-11-16 12:53:06,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:53:06" (1/1) ... [2022-11-16 12:53:06,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:53:06,464 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:53:06,699 WARN L229 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_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/sv-benchmarks/c/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-11-16 12:53:06,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:53:06,870 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:53:06,895 WARN L229 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_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/sv-benchmarks/c/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-11-16 12:53:06,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:53:07,014 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:53:07,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:07 WrapperNode [2022-11-16 12:53:07,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:53:07,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:53:07,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:53:07,016 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:53:07,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:07" (1/1) ... [2022-11-16 12:53:07,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:07" (1/1) ... [2022-11-16 12:53:07,064 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 113 [2022-11-16 12:53:07,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:53:07,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:53:07,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:53:07,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:53:07,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:07" (1/1) ... [2022-11-16 12:53:07,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:07" (1/1) ... [2022-11-16 12:53:07,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:07" (1/1) ... [2022-11-16 12:53:07,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:07" (1/1) ... [2022-11-16 12:53:07,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:07" (1/1) ... [2022-11-16 12:53:07,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:07" (1/1) ... [2022-11-16 12:53:07,091 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:07" (1/1) ... [2022-11-16 12:53:07,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:07" (1/1) ... [2022-11-16 12:53:07,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:53:07,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:53:07,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:53:07,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:53:07,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:07" (1/1) ... [2022-11-16 12:53:07,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:53:07,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:53:07,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:53:07,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:53:07,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:53:07,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 12:53:07,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:53:07,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:53:07,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:53:07,186 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 12:53:07,186 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 12:53:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 12:53:07,187 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 12:53:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:53:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 12:53:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:53:07,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:53:07,190 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:53:07,419 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:53:07,421 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:53:07,899 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:53:08,112 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:53:08,112 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:53:08,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:53:08 BoogieIcfgContainer [2022-11-16 12:53:08,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:53:08,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:53:08,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:53:08,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:53:08,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:53:06" (1/3) ... [2022-11-16 12:53:08,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cdb8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:53:08, skipping insertion in model container [2022-11-16 12:53:08,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:07" (2/3) ... [2022-11-16 12:53:08,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cdb8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:53:08, skipping insertion in model container [2022-11-16 12:53:08,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:53:08" (3/3) ... [2022-11-16 12:53:08,127 INFO L112 eAbstractionObserver]: Analyzing ICFG safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 12:53:08,147 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:53:08,147 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-16 12:53:08,148 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:53:08,233 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 12:53:08,323 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 12:53:08,338 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 103 transitions, 216 flow [2022-11-16 12:53:08,340 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 103 transitions, 216 flow [2022-11-16 12:53:08,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 103 transitions, 216 flow [2022-11-16 12:53:08,433 INFO L130 PetriNetUnfolder]: 2/101 cut-off events. [2022-11-16 12:53:08,440 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:53:08,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2022-11-16 12:53:08,448 INFO L119 LiptonReduction]: Number of co-enabled transitions 1276 [2022-11-16 12:53:13,314 INFO L134 LiptonReduction]: Checked pairs total: 3222 [2022-11-16 12:53:13,314 INFO L136 LiptonReduction]: Total number of compositions: 108 [2022-11-16 12:53:13,322 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 26 transitions, 62 flow [2022-11-16 12:53:13,370 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 218 states, 207 states have (on average 2.632850241545894) internal successors, (545), 217 states have internal predecessors, (545), 0 states have call successors, (0), 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-16 12:53:13,401 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:53:13,408 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;@6dc648a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:53:13,409 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-16 12:53:13,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 218 states, 207 states have (on average 2.632850241545894) internal successors, (545), 217 states have internal predecessors, (545), 0 states have call successors, (0), 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-16 12:53:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 12:53:13,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:13,420 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 12:53:13,421 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:53:13,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:13,432 INFO L85 PathProgramCache]: Analyzing trace with hash 465, now seen corresponding path program 1 times [2022-11-16 12:53:13,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:53:13,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061683697] [2022-11-16 12:53:13,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:13,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:53:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:13,589 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-16 12:53:13,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:53:13,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061683697] [2022-11-16 12:53:13,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061683697] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:53:13,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:53:13,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 12:53:13,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393348340] [2022-11-16 12:53:13,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:53:13,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:53:13,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:53:13,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:53:13,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:53:13,632 INFO L87 Difference]: Start difference. First operand has 218 states, 207 states have (on average 2.632850241545894) internal successors, (545), 217 states have internal predecessors, (545), 0 states have call successors, (0), 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-16 12:53:13,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:13,714 INFO L93 Difference]: Finished difference Result 204 states and 491 transitions. [2022-11-16 12:53:13,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:53:13,717 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-16 12:53:13,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:13,733 INFO L225 Difference]: With dead ends: 204 [2022-11-16 12:53:13,733 INFO L226 Difference]: Without dead ends: 204 [2022-11-16 12:53:13,734 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-16 12:53:13,739 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:53:13,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:53:13,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-16 12:53:13,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2022-11-16 12:53:13,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 2.4673366834170856) internal successors, (491), 203 states have internal predecessors, (491), 0 states have call successors, (0), 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-16 12:53:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 491 transitions. [2022-11-16 12:53:13,837 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 491 transitions. Word has length 1 [2022-11-16 12:53:13,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:13,837 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 491 transitions. [2022-11-16 12:53:13,841 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-16 12:53:13,841 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 491 transitions. [2022-11-16 12:53:13,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 12:53:13,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:13,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 12:53:13,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:53:13,843 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:53:13,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:13,843 INFO L85 PathProgramCache]: Analyzing trace with hash 456404, now seen corresponding path program 1 times [2022-11-16 12:53:13,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:53:13,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133262126] [2022-11-16 12:53:13,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:13,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:53:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:14,158 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-16 12:53:14,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:53:14,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133262126] [2022-11-16 12:53:14,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133262126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:53:14,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:53:14,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:53:14,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783185808] [2022-11-16 12:53:14,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:53:14,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:53:14,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:53:14,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:53:14,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:53:14,162 INFO L87 Difference]: Start difference. First operand 204 states and 491 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-16 12:53:14,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:14,240 INFO L93 Difference]: Finished difference Result 167 states and 394 transitions. [2022-11-16 12:53:14,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:53:14,242 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-16 12:53:14,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:14,244 INFO L225 Difference]: With dead ends: 167 [2022-11-16 12:53:14,246 INFO L226 Difference]: Without dead ends: 162 [2022-11-16 12:53:14,247 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-16 12:53:14,249 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:53:14,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:53:14,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-16 12:53:14,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-11-16 12:53:14,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 160 states have (on average 2.40625) internal successors, (385), 161 states have internal predecessors, (385), 0 states have call successors, (0), 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-16 12:53:14,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 385 transitions. [2022-11-16 12:53:14,267 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 385 transitions. Word has length 3 [2022-11-16 12:53:14,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:14,267 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 385 transitions. [2022-11-16 12:53:14,268 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-16 12:53:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 385 transitions. [2022-11-16 12:53:14,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 12:53:14,269 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:14,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:53:14,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:53:14,270 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:53:14,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:14,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1411025385, now seen corresponding path program 1 times [2022-11-16 12:53:14,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:53:14,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753632197] [2022-11-16 12:53:14,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:14,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:53:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:14,627 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-16 12:53:14,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:53:14,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753632197] [2022-11-16 12:53:14,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753632197] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:53:14,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:53:14,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:53:14,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371231718] [2022-11-16 12:53:14,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:53:14,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:53:14,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:53:14,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:53:14,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:53:14,630 INFO L87 Difference]: Start difference. First operand 162 states and 385 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-16 12:53:14,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:14,751 INFO L93 Difference]: Finished difference Result 197 states and 453 transitions. [2022-11-16 12:53:14,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:53:14,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-16 12:53:14,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:14,754 INFO L225 Difference]: With dead ends: 197 [2022-11-16 12:53:14,754 INFO L226 Difference]: Without dead ends: 197 [2022-11-16 12:53:14,755 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-16 12:53:14,759 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:53:14,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 5 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:53:14,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-16 12:53:14,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 177. [2022-11-16 12:53:14,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 175 states have (on average 2.4114285714285715) internal successors, (422), 176 states have internal predecessors, (422), 0 states have call successors, (0), 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-16 12:53:14,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 422 transitions. [2022-11-16 12:53:14,773 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 422 transitions. Word has length 8 [2022-11-16 12:53:14,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:14,773 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 422 transitions. [2022-11-16 12:53:14,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-16 12:53:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 422 transitions. [2022-11-16 12:53:14,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 12:53:14,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:14,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:53:14,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:53:14,778 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:53:14,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:14,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1411025349, now seen corresponding path program 1 times [2022-11-16 12:53:14,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:53:14,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921740216] [2022-11-16 12:53:14,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:14,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:53:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:15,073 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-16 12:53:15,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:53:15,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921740216] [2022-11-16 12:53:15,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921740216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:53:15,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:53:15,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:53:15,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477835040] [2022-11-16 12:53:15,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:53:15,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:53:15,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:53:15,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:53:15,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:53:15,082 INFO L87 Difference]: Start difference. First operand 177 states and 422 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-16 12:53:15,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:15,176 INFO L93 Difference]: Finished difference Result 152 states and 337 transitions. [2022-11-16 12:53:15,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:53:15,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-16 12:53:15,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:15,178 INFO L225 Difference]: With dead ends: 152 [2022-11-16 12:53:15,178 INFO L226 Difference]: Without dead ends: 127 [2022-11-16 12:53:15,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:53:15,180 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:53:15,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 5 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:53:15,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-16 12:53:15,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-11-16 12:53:15,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 2.3174603174603177) internal successors, (292), 126 states have internal predecessors, (292), 0 states have call successors, (0), 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-16 12:53:15,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 292 transitions. [2022-11-16 12:53:15,191 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 292 transitions. Word has length 8 [2022-11-16 12:53:15,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:15,191 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 292 transitions. [2022-11-16 12:53:15,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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-16 12:53:15,192 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 292 transitions. [2022-11-16 12:53:15,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 12:53:15,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:15,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:53:15,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:53:15,194 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:53:15,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:15,195 INFO L85 PathProgramCache]: Analyzing trace with hash -792141697, now seen corresponding path program 1 times [2022-11-16 12:53:15,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:53:15,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258547953] [2022-11-16 12:53:15,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:15,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:53:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:15,364 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-16 12:53:15,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:53:15,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258547953] [2022-11-16 12:53:15,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258547953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:53:15,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:53:15,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:53:15,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405894827] [2022-11-16 12:53:15,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:53:15,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:53:15,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:53:15,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:53:15,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:53:15,367 INFO L87 Difference]: Start difference. First operand 127 states and 292 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:53:15,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:15,559 INFO L93 Difference]: Finished difference Result 152 states and 337 transitions. [2022-11-16 12:53:15,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:53:15,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-16 12:53:15,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:15,562 INFO L225 Difference]: With dead ends: 152 [2022-11-16 12:53:15,563 INFO L226 Difference]: Without dead ends: 132 [2022-11-16 12:53:15,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:53:15,564 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 38 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:53:15,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 5 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:53:15,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-16 12:53:15,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-11-16 12:53:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 2.2977099236641223) internal successors, (301), 131 states have internal predecessors, (301), 0 states have call successors, (0), 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-16 12:53:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 301 transitions. [2022-11-16 12:53:15,584 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 301 transitions. Word has length 9 [2022-11-16 12:53:15,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:15,585 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 301 transitions. [2022-11-16 12:53:15,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:53:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 301 transitions. [2022-11-16 12:53:15,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 12:53:15,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:15,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:53:15,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:53:15,588 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:53:15,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:15,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1213345968, now seen corresponding path program 1 times [2022-11-16 12:53:15,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:53:15,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660549120] [2022-11-16 12:53:15,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:15,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:53:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:15,829 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-16 12:53:15,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:53:15,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660549120] [2022-11-16 12:53:15,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660549120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:53:15,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:53:15,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:53:15,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600150064] [2022-11-16 12:53:15,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:53:15,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:53:15,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:53:15,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:53:15,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:53:15,831 INFO L87 Difference]: Start difference. First operand 132 states and 301 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-16 12:53:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:15,967 INFO L93 Difference]: Finished difference Result 162 states and 360 transitions. [2022-11-16 12:53:15,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:53:15,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-16 12:53:15,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:15,968 INFO L225 Difference]: With dead ends: 162 [2022-11-16 12:53:15,968 INFO L226 Difference]: Without dead ends: 87 [2022-11-16 12:53:15,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:53:15,969 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 35 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:53:15,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 3 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:53:15,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-16 12:53:15,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-11-16 12:53:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 2.13953488372093) internal successors, (184), 86 states have internal predecessors, (184), 0 states have call successors, (0), 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-16 12:53:15,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 184 transitions. [2022-11-16 12:53:15,974 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 184 transitions. Word has length 10 [2022-11-16 12:53:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:15,974 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 184 transitions. [2022-11-16 12:53:15,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 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-16 12:53:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 184 transitions. [2022-11-16 12:53:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 12:53:15,975 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:15,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:53:15,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:53:15,975 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:53:15,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:15,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1204854925, now seen corresponding path program 1 times [2022-11-16 12:53:15,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:53:15,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443404200] [2022-11-16 12:53:15,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:15,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:53:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:16,167 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-16 12:53:16,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:53:16,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443404200] [2022-11-16 12:53:16,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443404200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:53:16,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:53:16,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:53:16,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664419991] [2022-11-16 12:53:16,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:53:16,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:53:16,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:53:16,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:53:16,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:53:16,169 INFO L87 Difference]: Start difference. First operand 87 states and 184 transitions. Second operand has 4 states, 4 states have (on average 2.75) 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-16 12:53:16,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:16,261 INFO L93 Difference]: Finished difference Result 72 states and 126 transitions. [2022-11-16 12:53:16,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:53:16,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) 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-16 12:53:16,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:16,262 INFO L225 Difference]: With dead ends: 72 [2022-11-16 12:53:16,262 INFO L226 Difference]: Without dead ends: 55 [2022-11-16 12:53:16,262 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-16 12:53:16,263 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:53:16,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:53:16,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-16 12:53:16,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-16 12:53:16,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.7037037037037037) internal successors, (92), 54 states have internal predecessors, (92), 0 states have call successors, (0), 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-16 12:53:16,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 92 transitions. [2022-11-16 12:53:16,266 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 92 transitions. Word has length 11 [2022-11-16 12:53:16,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:16,267 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 92 transitions. [2022-11-16 12:53:16,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) 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-16 12:53:16,267 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 92 transitions. [2022-11-16 12:53:16,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:53:16,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:16,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:53:16,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:53:16,268 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:53:16,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:16,269 INFO L85 PathProgramCache]: Analyzing trace with hash -332231328, now seen corresponding path program 1 times [2022-11-16 12:53:16,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:53:16,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468162230] [2022-11-16 12:53:16,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:16,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:53:16,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:16,475 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-16 12:53:16,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:53:16,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468162230] [2022-11-16 12:53:16,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468162230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:53:16,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:53:16,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:53:16,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208619165] [2022-11-16 12:53:16,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:53:16,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:53:16,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:53:16,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:53:16,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:53:16,478 INFO L87 Difference]: Start difference. First operand 55 states and 92 transitions. Second operand has 5 states, 5 states have (on average 2.6) 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-16 12:53:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:16,576 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. [2022-11-16 12:53:16,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:53:16,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) 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-16 12:53:16,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:16,579 INFO L225 Difference]: With dead ends: 40 [2022-11-16 12:53:16,579 INFO L226 Difference]: Without dead ends: 33 [2022-11-16 12:53:16,579 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-16 12:53:16,580 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 23 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:53:16,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:53:16,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-16 12:53:16,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-16 12:53:16,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 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-16 12:53:16,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2022-11-16 12:53:16,582 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 13 [2022-11-16 12:53:16,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:16,583 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 48 transitions. [2022-11-16 12:53:16,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) 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-16 12:53:16,583 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 48 transitions. [2022-11-16 12:53:16,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:53:16,584 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:16,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:53:16,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:53:16,584 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:53:16,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:16,585 INFO L85 PathProgramCache]: Analyzing trace with hash -117177433, now seen corresponding path program 1 times [2022-11-16 12:53:16,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:53:16,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874019156] [2022-11-16 12:53:16,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:16,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:53:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:17,304 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-16 12:53:17,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:53:17,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874019156] [2022-11-16 12:53:17,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874019156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:53:17,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:53:17,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:53:17,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433372152] [2022-11-16 12:53:17,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:53:17,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:53:17,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:53:17,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:53:17,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:53:17,307 INFO L87 Difference]: Start difference. First operand 33 states and 48 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-16 12:53:17,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:17,478 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2022-11-16 12:53:17,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:53:17,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-16 12:53:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:17,479 INFO L225 Difference]: With dead ends: 42 [2022-11-16 12:53:17,479 INFO L226 Difference]: Without dead ends: 25 [2022-11-16 12:53:17,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-16 12:53:17,480 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 26 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:53:17,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 4 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:53:17,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-16 12:53:17,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-16 12:53:17,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 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-16 12:53:17,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-11-16 12:53:17,482 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2022-11-16 12:53:17,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:17,482 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-11-16 12:53:17,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-16 12:53:17,482 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-11-16 12:53:17,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:53:17,483 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:17,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:53:17,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:53:17,483 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:53:17,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:17,484 INFO L85 PathProgramCache]: Analyzing trace with hash -147890329, now seen corresponding path program 2 times [2022-11-16 12:53:17,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:53:17,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586850572] [2022-11-16 12:53:17,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:17,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:53:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:53:17,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:53:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:53:17,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:53:17,655 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:53:17,656 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-16 12:53:17,658 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-16 12:53:17,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-16 12:53:17,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-16 12:53:17,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-16 12:53:17,659 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-16 12:53:17,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-16 12:53:17,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-16 12:53:17,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-16 12:53:17,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-16 12:53:17,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:53:17,663 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:53:17,669 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 12:53:17,669 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:53:17,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:53:17 BasicIcfg [2022-11-16 12:53:17,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:53:17,749 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:53:17,749 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:53:17,749 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:53:17,750 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:53:08" (3/4) ... [2022-11-16 12:53:17,752 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 12:53:17,752 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:53:17,753 INFO L158 Benchmark]: Toolchain (without parser) took 11348.25ms. Allocated memory was 136.3MB in the beginning and 207.6MB in the end (delta: 71.3MB). Free memory was 101.8MB in the beginning and 142.2MB in the end (delta: -40.5MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2022-11-16 12:53:17,753 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 100.7MB. Free memory was 72.5MB in the beginning and 72.4MB in the end (delta: 29.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:53:17,754 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.74ms. Allocated memory is still 136.3MB. Free memory was 101.5MB in the beginning and 100.7MB in the end (delta: 775.8kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:53:17,754 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.34ms. Allocated memory is still 136.3MB. Free memory was 100.7MB in the beginning and 98.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:53:17,755 INFO L158 Benchmark]: Boogie Preprocessor took 30.54ms. Allocated memory is still 136.3MB. Free memory was 98.6MB in the beginning and 96.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:53:17,755 INFO L158 Benchmark]: RCFGBuilder took 1018.64ms. Allocated memory is still 136.3MB. Free memory was 96.5MB in the beginning and 63.7MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-16 12:53:17,755 INFO L158 Benchmark]: TraceAbstraction took 9627.95ms. Allocated memory was 136.3MB in the beginning and 207.6MB in the end (delta: 71.3MB). Free memory was 63.0MB in the beginning and 142.2MB in the end (delta: -79.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:53:17,756 INFO L158 Benchmark]: Witness Printer took 3.88ms. Allocated memory is still 207.6MB. Free memory is still 142.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:53:17,759 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.32ms. Allocated memory is still 100.7MB. Free memory was 72.5MB in the beginning and 72.4MB in the end (delta: 29.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 604.74ms. Allocated memory is still 136.3MB. Free memory was 101.5MB in the beginning and 100.7MB in the end (delta: 775.8kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.34ms. Allocated memory is still 136.3MB. Free memory was 100.7MB in the beginning and 98.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.54ms. Allocated memory is still 136.3MB. Free memory was 98.6MB in the beginning and 96.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1018.64ms. Allocated memory is still 136.3MB. Free memory was 96.5MB in the beginning and 63.7MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9627.95ms. Allocated memory was 136.3MB in the beginning and 207.6MB in the end (delta: 71.3MB). Free memory was 63.0MB in the beginning and 142.2MB in the end (delta: -79.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.88ms. Allocated memory is still 207.6MB. Free memory is still 142.2MB. 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: 5.0s, 108 PlacesBefore, 32 PlacesAfterwards, 103 TransitionsBefore, 26 TransitionsAfterwards, 1276 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 108 TotalNumberOfCompositions, 3222 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1669, independent: 1549, independent conditional: 0, independent unconditional: 1549, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 853, independent: 821, independent conditional: 0, independent unconditional: 821, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 853, independent: 809, independent conditional: 0, independent unconditional: 809, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 44, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 328, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 309, dependent conditional: 0, dependent unconditional: 309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1669, independent: 728, independent conditional: 0, independent unconditional: 728, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 853, unknown conditional: 0, unknown unconditional: 853] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 93, Positive conditional cache size: 0, Positive unconditional cache size: 93, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L729] 0 int y$w_buff0; [L731] 0 int y$w_buff1; [L723] 0 _Bool y$r_buff0_thd2; [L720] 0 int y$mem_tmp; [L710] 0 int __unbuffered_p1_EAX = 0; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$read_delayed; [L708] 0 int __unbuffered_cnt = 0; [L719] 0 _Bool y$flush_delayed; [L732] 0 _Bool y$w_buff1_used; [L714] 0 _Bool main$tmp_guard1; [L713] 0 _Bool main$tmp_guard0; [L712] 0 int __unbuffered_p1_EBX = 0; [L728] 0 int *y$read_delayed_var; [L730] 0 _Bool y$w_buff0_used; [L716] 0 int x = 0; [L724] 0 _Bool y$r_buff1_thd0; [L718] 0 int y = 0; [L726] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd1; [L807] 0 pthread_t t2305; [L808] FCALL, FORK 0 pthread_create(&t2305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2305, ((void *)0), P0, ((void *)0))=-1, t2305={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L809] 0 pthread_t t2306; [L810] FCALL, FORK 0 pthread_create(&t2306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2306, ((void *)0), P1, ((void *)0))=0, t2305={5:0}, t2306={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 y$flush_delayed = weak$$choice2 [L772] 2 y$mem_tmp = y [L773] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EBX = y [L781] 2 y = y$flush_delayed ? y$mem_tmp : y [L782] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L788] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L789] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 2 return 0; [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L814] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L814] RET 0 assume_abort_if_not(main$tmp_guard0) [L816] 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) [L817] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L818] 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 [L819] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L820] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2305={5:0}, t2306={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L823] 0 main$tmp_guard1 = !(__unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L825] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 805]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 808]: 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: 810]: 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 5 procedures, 121 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 198 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 198 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 518 IncrementalHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 14 mSDtfsCounter, 518 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=0, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 20 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 95 NumberOfCodeBlocks, 95 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 404 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 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-16 12:53:17,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8 --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 fdecd751bbf3d5ef761eacebee2616261a6cad4ae3645147e0ad096bd1775198 --- 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-e04fb08 [2022-11-16 12:53:20,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:53:20,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:53:20,228 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:53:20,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:53:20,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:53:20,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:53:20,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:53:20,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:53:20,255 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:53:20,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:53:20,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:53:20,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:53:20,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:53:20,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:53:20,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:53:20,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:53:20,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:53:20,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:53:20,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:53:20,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:53:20,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:53:20,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:53:20,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:53:20,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:53:20,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:53:20,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:53:20,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:53:20,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:53:20,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:53:20,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:53:20,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:53:20,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:53:20,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:53:20,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:53:20,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:53:20,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:53:20,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:53:20,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:53:20,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:53:20,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:53:20,290 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-16 12:53:20,348 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:53:20,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:53:20,355 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:53:20,355 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:53:20,356 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:53:20,356 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:53:20,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:53:20,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:53:20,358 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:53:20,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:53:20,360 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:53:20,360 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:53:20,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:53:20,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:53:20,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:53:20,361 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 12:53:20,362 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 12:53:20,362 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 12:53:20,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:53:20,362 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 12:53:20,363 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 12:53:20,363 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 12:53:20,363 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:53:20,363 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:53:20,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:53:20,364 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:53:20,364 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:53:20,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:53:20,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:53:20,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:53:20,365 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 12:53:20,366 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 12:53:20,366 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 12:53:20,366 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_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8 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 -> fdecd751bbf3d5ef761eacebee2616261a6cad4ae3645147e0ad096bd1775198 [2022-11-16 12:53:20,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:53:20,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:53:20,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:53:20,766 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:53:20,767 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:53:20,768 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 12:53:20,838 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/data/7c7dfb77d/ef580b871bec4ed291a010489e31814b/FLAG5df3e9351 [2022-11-16 12:53:21,437 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:53:21,441 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/sv-benchmarks/c/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 12:53:21,459 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/data/7c7dfb77d/ef580b871bec4ed291a010489e31814b/FLAG5df3e9351 [2022-11-16 12:53:21,722 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/data/7c7dfb77d/ef580b871bec4ed291a010489e31814b [2022-11-16 12:53:21,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:53:21,727 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:53:21,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:53:21,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:53:21,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:53:21,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:53:21" (1/1) ... [2022-11-16 12:53:21,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f3e68dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:21, skipping insertion in model container [2022-11-16 12:53:21,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:53:21" (1/1) ... [2022-11-16 12:53:21,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:53:21,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:53:22,063 WARN L229 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_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/sv-benchmarks/c/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-11-16 12:53:22,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:53:22,338 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:53:22,355 WARN L229 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_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/sv-benchmarks/c/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-11-16 12:53:22,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:53:22,490 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:53:22,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:22 WrapperNode [2022-11-16 12:53:22,491 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:53:22,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:53:22,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:53:22,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:53:22,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:22" (1/1) ... [2022-11-16 12:53:22,535 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:22" (1/1) ... [2022-11-16 12:53:22,588 INFO L138 Inliner]: procedures = 178, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2022-11-16 12:53:22,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:53:22,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:53:22,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:53:22,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:53:22,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:22" (1/1) ... [2022-11-16 12:53:22,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:22" (1/1) ... [2022-11-16 12:53:22,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:22" (1/1) ... [2022-11-16 12:53:22,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:22" (1/1) ... [2022-11-16 12:53:22,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:22" (1/1) ... [2022-11-16 12:53:22,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:22" (1/1) ... [2022-11-16 12:53:22,671 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:22" (1/1) ... [2022-11-16 12:53:22,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:22" (1/1) ... [2022-11-16 12:53:22,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:53:22,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:53:22,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:53:22,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:53:22,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:22" (1/1) ... [2022-11-16 12:53:22,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:53:22,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:53:22,723 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:53:22,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:53:22,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 12:53:22,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:53:22,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:53:22,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:53:22,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 12:53:22,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 12:53:22,775 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 12:53:22,775 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 12:53:22,775 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 12:53:22,776 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 12:53:22,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 12:53:22,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:53:22,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:53:22,778 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:53:22,945 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:53:22,948 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:53:23,389 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:53:23,633 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:53:23,633 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 12:53:23,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:53:23 BoogieIcfgContainer [2022-11-16 12:53:23,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:53:23,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:53:23,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:53:23,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:53:23,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:53:21" (1/3) ... [2022-11-16 12:53:23,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376c7eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:53:23, skipping insertion in model container [2022-11-16 12:53:23,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:53:22" (2/3) ... [2022-11-16 12:53:23,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376c7eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:53:23, skipping insertion in model container [2022-11-16 12:53:23,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:53:23" (3/3) ... [2022-11-16 12:53:23,645 INFO L112 eAbstractionObserver]: Analyzing ICFG safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-11-16 12:53:23,665 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:53:23,666 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-16 12:53:23,666 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:53:23,774 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 12:53:23,817 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 12:53:23,830 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 104 transitions, 218 flow [2022-11-16 12:53:23,833 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 104 transitions, 218 flow [2022-11-16 12:53:23,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 104 transitions, 218 flow [2022-11-16 12:53:23,886 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2022-11-16 12:53:23,887 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:53:23,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2022-11-16 12:53:23,893 INFO L119 LiptonReduction]: Number of co-enabled transitions 1276 [2022-11-16 12:53:31,866 INFO L134 LiptonReduction]: Checked pairs total: 3222 [2022-11-16 12:53:31,866 INFO L136 LiptonReduction]: Total number of compositions: 107 [2022-11-16 12:53:31,875 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 26 transitions, 62 flow [2022-11-16 12:53:31,907 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 218 states, 207 states have (on average 2.632850241545894) internal successors, (545), 217 states have internal predecessors, (545), 0 states have call successors, (0), 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-16 12:53:31,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:53:31,932 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;@6ade442d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:53:31,932 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-16 12:53:31,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 218 states, 207 states have (on average 2.632850241545894) internal successors, (545), 217 states have internal predecessors, (545), 0 states have call successors, (0), 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-16 12:53:31,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 12:53:31,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:31,941 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 12:53:31,941 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:53:31,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:31,947 INFO L85 PathProgramCache]: Analyzing trace with hash 466, now seen corresponding path program 1 times [2022-11-16 12:53:31,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:53:31,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135749316] [2022-11-16 12:53:31,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:31,960 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-16 12:53:31,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:53:31,961 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:31,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:32,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 12:53:32,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:53:32,039 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-16 12:53:32,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:53:32,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:53:32,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135749316] [2022-11-16 12:53:32,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135749316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:53:32,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:53:32,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 12:53:32,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309197635] [2022-11-16 12:53:32,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:53:32,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:53:32,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:53:32,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:53:32,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:53:32,075 INFO L87 Difference]: Start difference. First operand has 218 states, 207 states have (on average 2.632850241545894) internal successors, (545), 217 states have internal predecessors, (545), 0 states have call successors, (0), 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-16 12:53:32,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:32,191 INFO L93 Difference]: Finished difference Result 204 states and 491 transitions. [2022-11-16 12:53:32,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:53:32,194 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-16 12:53:32,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:32,205 INFO L225 Difference]: With dead ends: 204 [2022-11-16 12:53:32,205 INFO L226 Difference]: Without dead ends: 204 [2022-11-16 12:53:32,206 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-16 12:53:32,209 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:53:32,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:53:32,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-16 12:53:32,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2022-11-16 12:53:32,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 2.4673366834170856) internal successors, (491), 203 states have internal predecessors, (491), 0 states have call successors, (0), 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-16 12:53:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 491 transitions. [2022-11-16 12:53:32,266 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 491 transitions. Word has length 1 [2022-11-16 12:53:32,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:32,266 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 491 transitions. [2022-11-16 12:53:32,267 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-16 12:53:32,267 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 491 transitions. [2022-11-16 12:53:32,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 12:53:32,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:32,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 12:53:32,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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)] Forceful destruction successful, exit code 0 [2022-11-16 12:53:32,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:32,479 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:53:32,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:32,479 INFO L85 PathProgramCache]: Analyzing trace with hash 457429, now seen corresponding path program 1 times [2022-11-16 12:53:32,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:53:32,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143279625] [2022-11-16 12:53:32,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:32,480 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-16 12:53:32,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:53:32,482 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:32,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:32,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:53:32,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:53:32,582 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-16 12:53:32,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:53:32,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:53:32,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143279625] [2022-11-16 12:53:32,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143279625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:53:32,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:53:32,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 12:53:32,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406553784] [2022-11-16 12:53:32,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:53:32,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:53:32,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:53:32,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:53:32,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:53:32,591 INFO L87 Difference]: Start difference. First operand 204 states and 491 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-16 12:53:32,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:32,694 INFO L93 Difference]: Finished difference Result 167 states and 394 transitions. [2022-11-16 12:53:32,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:53:32,696 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-16 12:53:32,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:32,699 INFO L225 Difference]: With dead ends: 167 [2022-11-16 12:53:32,700 INFO L226 Difference]: Without dead ends: 162 [2022-11-16 12:53:32,701 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-16 12:53:32,703 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 9 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:53:32,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:53:32,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-16 12:53:32,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2022-11-16 12:53:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 160 states have (on average 2.40625) internal successors, (385), 161 states have internal predecessors, (385), 0 states have call successors, (0), 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-16 12:53:32,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 385 transitions. [2022-11-16 12:53:32,735 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 385 transitions. Word has length 3 [2022-11-16 12:53:32,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:32,735 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 385 transitions. [2022-11-16 12:53:32,735 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-16 12:53:32,735 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 385 transitions. [2022-11-16 12:53:32,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 12:53:32,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:32,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:53:32,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:32,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:32,948 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:53:32,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:32,948 INFO L85 PathProgramCache]: Analyzing trace with hash -2043147492, now seen corresponding path program 1 times [2022-11-16 12:53:32,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:53:32,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728025191] [2022-11-16 12:53:32,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:32,949 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-16 12:53:32,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:53:32,951 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:32,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:33,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 12:53:33,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:53:33,156 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-16 12:53:33,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:53:33,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:53:33,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728025191] [2022-11-16 12:53:33,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1728025191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:53:33,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:53:33,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:53:33,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384856116] [2022-11-16 12:53:33,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:53:33,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:53:33,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:53:33,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:53:33,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:53:33,163 INFO L87 Difference]: Start difference. First operand 162 states and 385 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-16 12:53:33,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:33,324 INFO L93 Difference]: Finished difference Result 107 states and 201 transitions. [2022-11-16 12:53:33,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:53:33,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-16 12:53:33,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:33,326 INFO L225 Difference]: With dead ends: 107 [2022-11-16 12:53:33,326 INFO L226 Difference]: Without dead ends: 82 [2022-11-16 12:53:33,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-16 12:53:33,327 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:53:33,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 5 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:53:33,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-16 12:53:33,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-16 12:53:33,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 80 states have (on average 1.8125) internal successors, (145), 81 states have internal predecessors, (145), 0 states have call successors, (0), 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-16 12:53:33,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 145 transitions. [2022-11-16 12:53:33,338 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 145 transitions. Word has length 8 [2022-11-16 12:53:33,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:33,338 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 145 transitions. [2022-11-16 12:53:33,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-16 12:53:33,339 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 145 transitions. [2022-11-16 12:53:33,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 12:53:33,339 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:33,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:53:33,359 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:33,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:33,559 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:53:33,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:33,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1361947637, now seen corresponding path program 1 times [2022-11-16 12:53:33,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:53:33,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759443380] [2022-11-16 12:53:33,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:33,561 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-16 12:53:33,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:53:33,562 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:33,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:33,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:53:33,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:53:33,717 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-16 12:53:33,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:53:33,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:53:33,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759443380] [2022-11-16 12:53:33,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759443380] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:53:33,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:53:33,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:53:33,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313176453] [2022-11-16 12:53:33,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:53:33,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:53:33,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:53:33,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:53:33,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:53:33,721 INFO L87 Difference]: Start difference. First operand 82 states and 145 transitions. Second operand has 5 states, 5 states have (on average 2.4) 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-16 12:53:33,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:33,882 INFO L93 Difference]: Finished difference Result 51 states and 81 transitions. [2022-11-16 12:53:33,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:53:33,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) 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-16 12:53:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:33,883 INFO L225 Difference]: With dead ends: 51 [2022-11-16 12:53:33,883 INFO L226 Difference]: Without dead ends: 42 [2022-11-16 12:53:33,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:53:33,885 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:53:33,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 8 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:53:33,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-16 12:53:33,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-16 12:53:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.625) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 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-16 12:53:33,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 65 transitions. [2022-11-16 12:53:33,889 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 65 transitions. Word has length 12 [2022-11-16 12:53:33,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:33,890 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 65 transitions. [2022-11-16 12:53:33,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) 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-16 12:53:33,890 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 65 transitions. [2022-11-16 12:53:33,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:53:33,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:33,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:53:33,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:34,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:34,103 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:53:34,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:34,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2001129906, now seen corresponding path program 1 times [2022-11-16 12:53:34,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:53:34,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196809011] [2022-11-16 12:53:34,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:34,105 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-16 12:53:34,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:53:34,106 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:34,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:34,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 12:53:34,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:53:34,491 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-16 12:53:34,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:53:34,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:53:34,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196809011] [2022-11-16 12:53:34,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196809011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:53:34,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:53:34,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:53:34,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688836211] [2022-11-16 12:53:34,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:53:34,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:53:34,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:53:34,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:53:34,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:53:34,495 INFO L87 Difference]: Start difference. First operand 42 states and 65 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:53:34,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:34,538 INFO L93 Difference]: Finished difference Result 41 states and 64 transitions. [2022-11-16 12:53:34,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 12:53:34,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 12:53:34,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:34,540 INFO L225 Difference]: With dead ends: 41 [2022-11-16 12:53:34,540 INFO L226 Difference]: Without dead ends: 41 [2022-11-16 12:53:34,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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-16 12:53:34,541 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:53:34,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 17 Unchecked, 0.0s Time] [2022-11-16 12:53:34,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-16 12:53:34,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-16 12:53:34,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.6) internal successors, (64), 40 states have internal predecessors, (64), 0 states have call successors, (0), 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-16 12:53:34,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2022-11-16 12:53:34,545 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 16 [2022-11-16 12:53:34,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:34,546 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2022-11-16 12:53:34,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:53:34,546 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2022-11-16 12:53:34,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:53:34,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:34,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:53:34,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:34,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:34,760 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:53:34,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:34,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2001129935, now seen corresponding path program 1 times [2022-11-16 12:53:34,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:53:34,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830353874] [2022-11-16 12:53:34,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:53:34,761 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-16 12:53:34,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:53:34,763 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:34,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:53:34,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:53:34,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:53:34,929 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-16 12:53:34,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:53:34,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 12:53:34,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830353874] [2022-11-16 12:53:34,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830353874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:53:34,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:53:34,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:53:34,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044583597] [2022-11-16 12:53:34,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:53:34,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 12:53:34,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 12:53:34,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:53:34,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:53:34,932 INFO L87 Difference]: Start difference. First operand 41 states and 64 transitions. Second operand has 5 states, 4 states have (on average 4.0) 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-16 12:53:35,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:53:35,041 INFO L93 Difference]: Finished difference Result 56 states and 84 transitions. [2022-11-16 12:53:35,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:53:35,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) 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-16 12:53:35,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:53:35,042 INFO L225 Difference]: With dead ends: 56 [2022-11-16 12:53:35,043 INFO L226 Difference]: Without dead ends: 33 [2022-11-16 12:53:35,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:53:35,044 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 11 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2 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-16 12:53:35,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 12:53:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-16 12:53:35,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-16 12:53:35,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 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-16 12:53:35,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2022-11-16 12:53:35,048 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 16 [2022-11-16 12:53:35,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:53:35,048 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 48 transitions. [2022-11-16 12:53:35,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) 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-16 12:53:35,048 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 48 transitions. [2022-11-16 12:53:35,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 12:53:35,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:53:35,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:53:35,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:35,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:35,250 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2022-11-16 12:53:35,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:53:35,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1893902351, now seen corresponding path program 2 times [2022-11-16 12:53:35,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 12:53:35,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189814712] [2022-11-16 12:53:35,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:53:35,251 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-16 12:53:35,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 12:53:35,252 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:35,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:35,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 12:53:35,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-16 12:53:35,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:53:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:53:35,485 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-16 12:53:35,485 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:53:35,486 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2022-11-16 12:53:35,488 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2022-11-16 12:53:35,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2022-11-16 12:53:35,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2022-11-16 12:53:35,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2022-11-16 12:53:35,489 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2022-11-16 12:53:35,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2022-11-16 12:53:35,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2022-11-16 12:53:35,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2022-11-16 12:53:35,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2022-11-16 12:53:35,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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)] Forceful destruction successful, exit code 0 [2022-11-16 12:53:35,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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-16 12:53:35,701 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-11-16 12:53:35,706 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 12:53:35,706 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:53:35,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:53:35 BasicIcfg [2022-11-16 12:53:35,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:53:35,778 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:53:35,779 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:53:35,779 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:53:35,779 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:53:23" (3/4) ... [2022-11-16 12:53:35,782 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 12:53:35,782 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:53:35,783 INFO L158 Benchmark]: Toolchain (without parser) took 14055.56ms. Allocated memory was 48.2MB in the beginning and 107.0MB in the end (delta: 58.7MB). Free memory was 24.3MB in the beginning and 44.0MB in the end (delta: -19.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-16 12:53:35,783 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 48.2MB. Free memory was 30.0MB in the beginning and 29.9MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:53:35,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 759.69ms. Allocated memory was 48.2MB in the beginning and 67.1MB in the end (delta: 18.9MB). Free memory was 24.1MB in the beginning and 38.4MB in the end (delta: -14.3MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2022-11-16 12:53:35,787 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.17ms. Allocated memory is still 67.1MB. Free memory was 38.4MB in the beginning and 35.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:53:35,788 INFO L158 Benchmark]: Boogie Preprocessor took 84.94ms. Allocated memory is still 67.1MB. Free memory was 35.8MB in the beginning and 49.6MB in the end (delta: -13.8MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2022-11-16 12:53:35,788 INFO L158 Benchmark]: RCFGBuilder took 959.37ms. Allocated memory is still 67.1MB. Free memory was 49.6MB in the beginning and 32.6MB in the end (delta: 17.0MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2022-11-16 12:53:35,790 INFO L158 Benchmark]: TraceAbstraction took 12139.72ms. Allocated memory was 67.1MB in the beginning and 107.0MB in the end (delta: 39.8MB). Free memory was 31.9MB in the beginning and 45.1MB in the end (delta: -13.2MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2022-11-16 12:53:35,791 INFO L158 Benchmark]: Witness Printer took 3.99ms. Allocated memory is still 107.0MB. Free memory was 45.1MB in the beginning and 44.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:53:35,793 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.32ms. Allocated memory is still 48.2MB. Free memory was 30.0MB in the beginning and 29.9MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 759.69ms. Allocated memory was 48.2MB in the beginning and 67.1MB in the end (delta: 18.9MB). Free memory was 24.1MB in the beginning and 38.4MB in the end (delta: -14.3MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.17ms. Allocated memory is still 67.1MB. Free memory was 38.4MB in the beginning and 35.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.94ms. Allocated memory is still 67.1MB. Free memory was 35.8MB in the beginning and 49.6MB in the end (delta: -13.8MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * RCFGBuilder took 959.37ms. Allocated memory is still 67.1MB. Free memory was 49.6MB in the beginning and 32.6MB in the end (delta: 17.0MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12139.72ms. Allocated memory was 67.1MB in the beginning and 107.0MB in the end (delta: 39.8MB). Free memory was 31.9MB in the beginning and 45.1MB in the end (delta: -13.2MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * Witness Printer took 3.99ms. Allocated memory is still 107.0MB. Free memory was 45.1MB in the beginning and 44.0MB 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: 8.0s, 109 PlacesBefore, 32 PlacesAfterwards, 104 TransitionsBefore, 26 TransitionsAfterwards, 1276 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 3222 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1663, independent: 1543, independent conditional: 0, independent unconditional: 1543, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 855, independent: 821, independent conditional: 0, independent unconditional: 821, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 855, independent: 809, independent conditional: 0, independent unconditional: 809, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 363, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 330, dependent conditional: 0, dependent unconditional: 330, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1663, independent: 722, independent conditional: 0, independent unconditional: 722, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 855, unknown conditional: 0, unknown unconditional: 855] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 90, Positive conditional cache size: 0, Positive unconditional cache size: 90, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L729] 0 int y$w_buff0; [L731] 0 int y$w_buff1; [L723] 0 _Bool y$r_buff0_thd2; [L720] 0 int y$mem_tmp; [L710] 0 int __unbuffered_p1_EAX = 0; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$read_delayed; [L708] 0 int __unbuffered_cnt = 0; [L719] 0 _Bool y$flush_delayed; [L732] 0 _Bool y$w_buff1_used; [L714] 0 _Bool main$tmp_guard1; [L713] 0 _Bool main$tmp_guard0; [L712] 0 int __unbuffered_p1_EBX = 0; [L728] 0 int *y$read_delayed_var; [L730] 0 _Bool y$w_buff0_used; [L716] 0 int x = 0; [L724] 0 _Bool y$r_buff1_thd0; [L718] 0 int y = 0; [L726] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd1; [L807] 0 pthread_t t2305; [L808] FCALL, FORK 0 pthread_create(&t2305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2305, ((void *)0), P0, ((void *)0))=-1, t2305={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] 0 pthread_t t2306; [L810] FCALL, FORK 0 pthread_create(&t2306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2306, ((void *)0), P1, ((void *)0))=0, t2305={3:0}, t2306={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 y$flush_delayed = weak$$choice2 [L772] 2 y$mem_tmp = y [L773] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EBX = y [L781] 2 y = y$flush_delayed ? y$mem_tmp : y [L782] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L788] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L789] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 2 return 0; [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L814] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L814] RET 0 assume_abort_if_not(main$tmp_guard0) [L816] 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) [L817] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L818] 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 [L819] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L820] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2305={3:0}, t2306={7:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L823] 0 main$tmp_guard1 = !(__unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L825] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 805]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 810]: 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: 808]: 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 5 procedures, 122 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 67 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 17 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 267 IncrementalHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 10 mSDtfsCounter, 267 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=0, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 50 ConstructedInterpolants, 13 QuantifiedInterpolants, 433 SizeOfPredicates, 11 NumberOfNonLiveVariables, 530 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-16 12:53:35,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d8595632-2be3-4dd6-bccf-7ce0eaf1bd49/bin/uautomizer-tPACEb0tL8/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