./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.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_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20 --- 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 10:56:00,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 10:56:00,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 10:56:01,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 10:56:01,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 10:56:01,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 10:56:01,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 10:56:01,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 10:56:01,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 10:56:01,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 10:56:01,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 10:56:01,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 10:56:01,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 10:56:01,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 10:56:01,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 10:56:01,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 10:56:01,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 10:56:01,045 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 10:56:01,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 10:56:01,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 10:56:01,051 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 10:56:01,053 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 10:56:01,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 10:56:01,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 10:56:01,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 10:56:01,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 10:56:01,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 10:56:01,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 10:56:01,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 10:56:01,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 10:56:01,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 10:56:01,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 10:56:01,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 10:56:01,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 10:56:01,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 10:56:01,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 10:56:01,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 10:56:01,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 10:56:01,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 10:56:01,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 10:56:01,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 10:56:01,079 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 10:56:01,132 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 10:56:01,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 10:56:01,134 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 10:56:01,134 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 10:56:01,136 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 10:56:01,136 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 10:56:01,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 10:56:01,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 10:56:01,137 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 10:56:01,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 10:56:01,139 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 10:56:01,139 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 10:56:01,139 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 10:56:01,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 10:56:01,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 10:56:01,140 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 10:56:01,140 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 10:56:01,141 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 10:56:01,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 10:56:01,141 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 10:56:01,141 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 10:56:01,142 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 10:56:01,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 10:56:01,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 10:56:01,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 10:56:01,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:56:01,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 10:56:01,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 10:56:01,145 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 10:56:01,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 10:56:01,146 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_6d4f24d9-a9ec-42e7-b707-754c5303307d/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_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 -> d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20 [2022-11-16 10:56:01,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 10:56:01,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 10:56:01,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 10:56:01,540 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 10:56:01,541 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 10:56:01,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i [2022-11-16 10:56:01,642 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/data/c1a4b336a/8d0367c8861146c0b08a4bb63db0873e/FLAGa9032eb1a [2022-11-16 10:56:02,296 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 10:56:02,301 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i [2022-11-16 10:56:02,318 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/data/c1a4b336a/8d0367c8861146c0b08a4bb63db0873e/FLAGa9032eb1a [2022-11-16 10:56:02,506 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/data/c1a4b336a/8d0367c8861146c0b08a4bb63db0873e [2022-11-16 10:56:02,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 10:56:02,513 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 10:56:02,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 10:56:02,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 10:56:02,520 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 10:56:02,521 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:56:02" (1/1) ... [2022-11-16 10:56:02,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e384cd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:02, skipping insertion in model container [2022-11-16 10:56:02,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:56:02" (1/1) ... [2022-11-16 10:56:02,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 10:56:02,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 10:56:02,960 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_6d4f24d9-a9ec-42e7-b707-754c5303307d/sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-16 10:56:03,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:56:03,276 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 10:56:03,293 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_6d4f24d9-a9ec-42e7-b707-754c5303307d/sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-16 10:56:03,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:56:03,418 INFO L208 MainTranslator]: Completed translation [2022-11-16 10:56:03,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:03 WrapperNode [2022-11-16 10:56:03,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 10:56:03,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 10:56:03,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 10:56:03,420 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 10:56:03,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:03" (1/1) ... [2022-11-16 10:56:03,476 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:03" (1/1) ... [2022-11-16 10:56:03,536 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-11-16 10:56:03,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 10:56:03,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 10:56:03,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 10:56:03,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 10:56:03,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:03" (1/1) ... [2022-11-16 10:56:03,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:03" (1/1) ... [2022-11-16 10:56:03,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:03" (1/1) ... [2022-11-16 10:56:03,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:03" (1/1) ... [2022-11-16 10:56:03,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:03" (1/1) ... [2022-11-16 10:56:03,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:03" (1/1) ... [2022-11-16 10:56:03,611 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:03" (1/1) ... [2022-11-16 10:56:03,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:03" (1/1) ... [2022-11-16 10:56:03,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 10:56:03,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 10:56:03,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 10:56:03,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 10:56:03,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:03" (1/1) ... [2022-11-16 10:56:03,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:56:03,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:56:03,692 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 10:56:03,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 10:56:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 10:56:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 10:56:03,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 10:56:03,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 10:56:03,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 10:56:03,753 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 10:56:03,753 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 10:56:03,753 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 10:56:03,753 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 10:56:03,754 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 10:56:03,754 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 10:56:03,755 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-16 10:56:03,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-16 10:56:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 10:56:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 10:56:03,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 10:56:03,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 10:56:03,758 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 10:56:03,980 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 10:56:03,983 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 10:56:04,616 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 10:56:04,798 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 10:56:04,798 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 10:56:04,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:56:04 BoogieIcfgContainer [2022-11-16 10:56:04,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 10:56:04,805 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 10:56:04,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 10:56:04,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 10:56:04,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:56:02" (1/3) ... [2022-11-16 10:56:04,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e24513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:56:04, skipping insertion in model container [2022-11-16 10:56:04,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:03" (2/3) ... [2022-11-16 10:56:04,813 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e24513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:56:04, skipping insertion in model container [2022-11-16 10:56:04,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:56:04" (3/3) ... [2022-11-16 10:56:04,815 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_power.oepc_pso.oepc_rmo.oepc.i [2022-11-16 10:56:04,839 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 10:56:04,840 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-16 10:56:04,840 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 10:56:04,963 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 10:56:05,009 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 10:56:05,027 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 149 transitions, 318 flow [2022-11-16 10:56:05,031 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 149 transitions, 318 flow [2022-11-16 10:56:05,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 318 flow [2022-11-16 10:56:05,147 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2022-11-16 10:56:05,147 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 10:56:05,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-16 10:56:05,160 INFO L119 LiptonReduction]: Number of co-enabled transitions 3764 [2022-11-16 10:56:12,798 INFO L134 LiptonReduction]: Checked pairs total: 10866 [2022-11-16 10:56:12,798 INFO L136 LiptonReduction]: Total number of compositions: 145 [2022-11-16 10:56:12,812 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 45 transitions, 110 flow [2022-11-16 10:56:13,277 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 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 10:56:13,309 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 10:56:13,321 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;@69e04fc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 10:56:13,322 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-16 10:56:13,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 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 10:56:13,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 10:56:13,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:13,376 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 10:56:13,377 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:13,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:13,383 INFO L85 PathProgramCache]: Analyzing trace with hash 628, now seen corresponding path program 1 times [2022-11-16 10:56:13,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:13,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168633005] [2022-11-16 10:56:13,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:13,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:13,533 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 10:56:13,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:13,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168633005] [2022-11-16 10:56:13,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168633005] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:13,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:13,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 10:56:13,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246373525] [2022-11-16 10:56:13,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:13,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 10:56:13,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:13,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 10:56:13,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 10:56:13,597 INFO L87 Difference]: Start difference. First operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 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 10:56:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:13,935 INFO L93 Difference]: Finished difference Result 6074 states and 24532 transitions. [2022-11-16 10:56:13,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 10:56:13,938 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 10:56:13,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:14,034 INFO L225 Difference]: With dead ends: 6074 [2022-11-16 10:56:14,035 INFO L226 Difference]: Without dead ends: 6074 [2022-11-16 10:56:14,036 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 10:56:14,039 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:14,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:56:14,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2022-11-16 10:56:14,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 6074. [2022-11-16 10:56:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6074 states, 6069 states have (on average 4.042181578513758) internal successors, (24532), 6073 states have internal predecessors, (24532), 0 states have call successors, (0), 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 10:56:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6074 states to 6074 states and 24532 transitions. [2022-11-16 10:56:14,606 INFO L78 Accepts]: Start accepts. Automaton has 6074 states and 24532 transitions. Word has length 1 [2022-11-16 10:56:14,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:14,607 INFO L495 AbstractCegarLoop]: Abstraction has 6074 states and 24532 transitions. [2022-11-16 10:56:14,613 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 10:56:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 6074 states and 24532 transitions. [2022-11-16 10:56:14,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 10:56:14,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:14,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 10:56:14,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 10:56:14,617 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:14,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:14,619 INFO L85 PathProgramCache]: Analyzing trace with hash 618993, now seen corresponding path program 1 times [2022-11-16 10:56:14,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:14,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46872410] [2022-11-16 10:56:14,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:14,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:15,071 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 10:56:15,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:15,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46872410] [2022-11-16 10:56:15,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46872410] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:15,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:15,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 10:56:15,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369795578] [2022-11-16 10:56:15,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:15,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:56:15,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:15,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:56:15,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:56:15,077 INFO L87 Difference]: Start difference. First operand 6074 states and 24532 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 10:56:15,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:15,387 INFO L93 Difference]: Finished difference Result 4962 states and 19815 transitions. [2022-11-16 10:56:15,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:56:15,388 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 10:56:15,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:15,436 INFO L225 Difference]: With dead ends: 4962 [2022-11-16 10:56:15,437 INFO L226 Difference]: Without dead ends: 4812 [2022-11-16 10:56:15,437 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 10:56:15,439 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:15,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 8 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:56:15,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4812 states. [2022-11-16 10:56:15,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4812 to 4812. [2022-11-16 10:56:15,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4812 states, 4810 states have (on average 4.012474012474012) internal successors, (19300), 4811 states have internal predecessors, (19300), 0 states have call successors, (0), 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 10:56:16,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 19300 transitions. [2022-11-16 10:56:16,030 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 19300 transitions. Word has length 3 [2022-11-16 10:56:16,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:16,030 INFO L495 AbstractCegarLoop]: Abstraction has 4812 states and 19300 transitions. [2022-11-16 10:56:16,031 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 10:56:16,031 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 19300 transitions. [2022-11-16 10:56:16,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 10:56:16,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:16,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:16,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 10:56:16,050 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:16,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:16,066 INFO L85 PathProgramCache]: Analyzing trace with hash -909781735, now seen corresponding path program 1 times [2022-11-16 10:56:16,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:16,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835163734] [2022-11-16 10:56:16,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:16,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:17,333 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 10:56:17,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:17,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835163734] [2022-11-16 10:56:17,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835163734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:17,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:17,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:56:17,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728620366] [2022-11-16 10:56:17,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:17,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:56:17,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:17,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:56:17,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:56:17,337 INFO L87 Difference]: Start difference. First operand 4812 states and 19300 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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 10:56:17,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:17,739 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions. [2022-11-16 10:56:17,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:56:17,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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 10:56:17,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:17,789 INFO L225 Difference]: With dead ends: 4062 [2022-11-16 10:56:17,789 INFO L226 Difference]: Without dead ends: 4062 [2022-11-16 10:56:17,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:56:17,791 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 42 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:17,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 40 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 10:56:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2022-11-16 10:56:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2022-11-16 10:56:17,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 4061 states have (on average 3.9706968726914553) internal successors, (16125), 4061 states have internal predecessors, (16125), 0 states have call successors, (0), 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 10:56:18,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 16125 transitions. [2022-11-16 10:56:18,051 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 16125 transitions. Word has length 12 [2022-11-16 10:56:18,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:18,052 INFO L495 AbstractCegarLoop]: Abstraction has 4062 states and 16125 transitions. [2022-11-16 10:56:18,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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 10:56:18,053 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 16125 transitions. [2022-11-16 10:56:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 10:56:18,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:18,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:18,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 10:56:18,057 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:18,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:18,067 INFO L85 PathProgramCache]: Analyzing trace with hash -909781754, now seen corresponding path program 1 times [2022-11-16 10:56:18,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:18,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609861987] [2022-11-16 10:56:18,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:18,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:18,440 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 10:56:18,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:18,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609861987] [2022-11-16 10:56:18,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609861987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:18,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:18,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:56:18,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895156998] [2022-11-16 10:56:18,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:18,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:56:18,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:18,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:56:18,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:56:18,455 INFO L87 Difference]: Start difference. First operand 4062 states and 16125 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:18,895 INFO L93 Difference]: Finished difference Result 8608 states and 32879 transitions. [2022-11-16 10:56:18,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:56:18,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 10:56:18,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:18,953 INFO L225 Difference]: With dead ends: 8608 [2022-11-16 10:56:18,953 INFO L226 Difference]: Without dead ends: 6682 [2022-11-16 10:56:18,954 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 10:56:18,957 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 39 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:18,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 15 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 10:56:19,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6682 states. [2022-11-16 10:56:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6682 to 5464. [2022-11-16 10:56:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5464 states, 5463 states have (on average 3.8802855573860517) internal successors, (21198), 5463 states have internal predecessors, (21198), 0 states have call successors, (0), 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 10:56:19,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5464 states to 5464 states and 21198 transitions. [2022-11-16 10:56:19,313 INFO L78 Accepts]: Start accepts. Automaton has 5464 states and 21198 transitions. Word has length 12 [2022-11-16 10:56:19,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:19,313 INFO L495 AbstractCegarLoop]: Abstraction has 5464 states and 21198 transitions. [2022-11-16 10:56:19,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:19,314 INFO L276 IsEmpty]: Start isEmpty. Operand 5464 states and 21198 transitions. [2022-11-16 10:56:19,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 10:56:19,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:19,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:19,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 10:56:19,323 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:19,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:19,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2089510771, now seen corresponding path program 1 times [2022-11-16 10:56:19,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:19,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116570683] [2022-11-16 10:56:19,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:19,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:19,670 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 10:56:19,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:19,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116570683] [2022-11-16 10:56:19,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116570683] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:19,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:19,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:56:19,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658227002] [2022-11-16 10:56:19,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:19,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 10:56:19,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:19,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 10:56:19,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:56:19,677 INFO L87 Difference]: Start difference. First operand 5464 states and 21198 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:20,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:20,116 INFO L93 Difference]: Finished difference Result 7571 states and 28279 transitions. [2022-11-16 10:56:20,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 10:56:20,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-16 10:56:20,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:20,167 INFO L225 Difference]: With dead ends: 7571 [2022-11-16 10:56:20,167 INFO L226 Difference]: Without dead ends: 6506 [2022-11-16 10:56:20,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:56:20,169 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 59 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:20,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 18 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 10:56:20,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6506 states. [2022-11-16 10:56:20,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6506 to 5240. [2022-11-16 10:56:20,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5240 states, 5239 states have (on average 3.878221034548578) internal successors, (20318), 5239 states have internal predecessors, (20318), 0 states have call successors, (0), 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 10:56:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5240 states to 5240 states and 20318 transitions. [2022-11-16 10:56:20,490 INFO L78 Accepts]: Start accepts. Automaton has 5240 states and 20318 transitions. Word has length 13 [2022-11-16 10:56:20,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:20,491 INFO L495 AbstractCegarLoop]: Abstraction has 5240 states and 20318 transitions. [2022-11-16 10:56:20,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:20,491 INFO L276 IsEmpty]: Start isEmpty. Operand 5240 states and 20318 transitions. [2022-11-16 10:56:20,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 10:56:20,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:20,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:20,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 10:56:20,495 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:20,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:20,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1864058067, now seen corresponding path program 1 times [2022-11-16 10:56:20,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:20,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949870238] [2022-11-16 10:56:20,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:20,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:20,744 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 10:56:20,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:20,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949870238] [2022-11-16 10:56:20,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949870238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:20,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:20,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:56:20,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80848603] [2022-11-16 10:56:20,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:20,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 10:56:20,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:20,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 10:56:20,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:56:20,748 INFO L87 Difference]: Start difference. First operand 5240 states and 20318 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:21,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:21,232 INFO L93 Difference]: Finished difference Result 6815 states and 25383 transitions. [2022-11-16 10:56:21,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 10:56:21,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-16 10:56:21,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:21,275 INFO L225 Difference]: With dead ends: 6815 [2022-11-16 10:56:21,276 INFO L226 Difference]: Without dead ends: 5710 [2022-11-16 10:56:21,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:56:21,277 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 64 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:21,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 24 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 10:56:21,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5710 states. [2022-11-16 10:56:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5710 to 4255. [2022-11-16 10:56:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4255 states, 4254 states have (on average 3.848142924306535) internal successors, (16370), 4254 states have internal predecessors, (16370), 0 states have call successors, (0), 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 10:56:21,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 16370 transitions. [2022-11-16 10:56:21,542 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 16370 transitions. Word has length 13 [2022-11-16 10:56:21,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:21,543 INFO L495 AbstractCegarLoop]: Abstraction has 4255 states and 16370 transitions. [2022-11-16 10:56:21,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:21,544 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 16370 transitions. [2022-11-16 10:56:21,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 10:56:21,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:21,549 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:21,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 10:56:21,550 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:21,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:21,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1952912450, now seen corresponding path program 1 times [2022-11-16 10:56:21,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:21,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517380244] [2022-11-16 10:56:21,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:21,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:21,814 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 10:56:21,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:21,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517380244] [2022-11-16 10:56:21,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517380244] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:21,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:21,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:56:21,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043610463] [2022-11-16 10:56:21,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:21,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:56:21,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:21,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:56:21,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:56:21,818 INFO L87 Difference]: Start difference. First operand 4255 states and 16370 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:22,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:22,059 INFO L93 Difference]: Finished difference Result 4675 states and 17621 transitions. [2022-11-16 10:56:22,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:56:22,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 10:56:22,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:22,090 INFO L225 Difference]: With dead ends: 4675 [2022-11-16 10:56:22,091 INFO L226 Difference]: Without dead ends: 4175 [2022-11-16 10:56:22,092 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 10:56:22,093 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 34 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:22,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 16 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:56:22,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4175 states. [2022-11-16 10:56:22,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4175 to 4103. [2022-11-16 10:56:22,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4103 states, 4102 states have (on average 3.8303266699171137) internal successors, (15712), 4102 states have internal predecessors, (15712), 0 states have call successors, (0), 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 10:56:22,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4103 states to 4103 states and 15712 transitions. [2022-11-16 10:56:22,329 INFO L78 Accepts]: Start accepts. Automaton has 4103 states and 15712 transitions. Word has length 14 [2022-11-16 10:56:22,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:22,330 INFO L495 AbstractCegarLoop]: Abstraction has 4103 states and 15712 transitions. [2022-11-16 10:56:22,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:22,330 INFO L276 IsEmpty]: Start isEmpty. Operand 4103 states and 15712 transitions. [2022-11-16 10:56:22,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 10:56:22,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:22,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:22,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 10:56:22,336 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:22,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:22,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1944993937, now seen corresponding path program 1 times [2022-11-16 10:56:22,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:22,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316380069] [2022-11-16 10:56:22,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:22,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:22,585 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 10:56:22,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:22,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316380069] [2022-11-16 10:56:22,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316380069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:22,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:22,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:56:22,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960564971] [2022-11-16 10:56:22,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:22,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:56:22,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:22,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:56:22,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:56:22,593 INFO L87 Difference]: Start difference. First operand 4103 states and 15712 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:22,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:22,716 INFO L93 Difference]: Finished difference Result 2959 states and 10056 transitions. [2022-11-16 10:56:22,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:56:22,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-16 10:56:22,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:22,732 INFO L225 Difference]: With dead ends: 2959 [2022-11-16 10:56:22,733 INFO L226 Difference]: Without dead ends: 2959 [2022-11-16 10:56:22,733 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 10:56:22,735 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:22,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:56:22,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2022-11-16 10:56:22,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 2959. [2022-11-16 10:56:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2959 states, 2958 states have (on average 3.3995943204868153) internal successors, (10056), 2958 states have internal predecessors, (10056), 0 states have call successors, (0), 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 10:56:22,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2959 states to 2959 states and 10056 transitions. [2022-11-16 10:56:22,832 INFO L78 Accepts]: Start accepts. Automaton has 2959 states and 10056 transitions. Word has length 15 [2022-11-16 10:56:22,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:22,832 INFO L495 AbstractCegarLoop]: Abstraction has 2959 states and 10056 transitions. [2022-11-16 10:56:22,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:22,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2959 states and 10056 transitions. [2022-11-16 10:56:22,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 10:56:22,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:22,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:22,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 10:56:22,841 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:22,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:22,842 INFO L85 PathProgramCache]: Analyzing trace with hash -405016358, now seen corresponding path program 1 times [2022-11-16 10:56:22,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:22,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875618122] [2022-11-16 10:56:22,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:22,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:23,127 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 10:56:23,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:23,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875618122] [2022-11-16 10:56:23,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875618122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:23,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:23,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:56:23,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701374591] [2022-11-16 10:56:23,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:23,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 10:56:23,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:23,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 10:56:23,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:56:23,132 INFO L87 Difference]: Start difference. First operand 2959 states and 10056 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:23,569 INFO L93 Difference]: Finished difference Result 5410 states and 17768 transitions. [2022-11-16 10:56:23,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 10:56:23,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 10:56:23,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:23,590 INFO L225 Difference]: With dead ends: 5410 [2022-11-16 10:56:23,591 INFO L226 Difference]: Without dead ends: 3771 [2022-11-16 10:56:23,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:56:23,592 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 69 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:23,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 19 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 10:56:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3771 states. [2022-11-16 10:56:23,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3771 to 2669. [2022-11-16 10:56:23,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2669 states, 2668 states have (on average 3.295727136431784) internal successors, (8793), 2668 states have internal predecessors, (8793), 0 states have call successors, (0), 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 10:56:23,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2669 states to 2669 states and 8793 transitions. [2022-11-16 10:56:23,688 INFO L78 Accepts]: Start accepts. Automaton has 2669 states and 8793 transitions. Word has length 18 [2022-11-16 10:56:23,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:23,688 INFO L495 AbstractCegarLoop]: Abstraction has 2669 states and 8793 transitions. [2022-11-16 10:56:23,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:23,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2669 states and 8793 transitions. [2022-11-16 10:56:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 10:56:23,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:23,694 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:23,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 10:56:23,694 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:23,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:23,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1352921562, now seen corresponding path program 1 times [2022-11-16 10:56:23,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:23,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163982441] [2022-11-16 10:56:23,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:23,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:23,921 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 10:56:23,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:23,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163982441] [2022-11-16 10:56:23,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163982441] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:23,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:23,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:56:23,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267332455] [2022-11-16 10:56:23,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:23,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:56:23,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:23,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:56:23,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:56:23,924 INFO L87 Difference]: Start difference. First operand 2669 states and 8793 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:24,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:24,058 INFO L93 Difference]: Finished difference Result 1633 states and 4801 transitions. [2022-11-16 10:56:24,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 10:56:24,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-16 10:56:24,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:24,065 INFO L225 Difference]: With dead ends: 1633 [2022-11-16 10:56:24,065 INFO L226 Difference]: Without dead ends: 1633 [2022-11-16 10:56:24,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:56:24,067 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 47 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:24,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 12 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:56:24,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-11-16 10:56:24,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1627. [2022-11-16 10:56:24,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1626 states have (on average 2.940959409594096) internal successors, (4782), 1626 states have internal predecessors, (4782), 0 states have call successors, (0), 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 10:56:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 4782 transitions. [2022-11-16 10:56:24,108 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 4782 transitions. Word has length 18 [2022-11-16 10:56:24,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:24,109 INFO L495 AbstractCegarLoop]: Abstraction has 1627 states and 4782 transitions. [2022-11-16 10:56:24,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:24,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 4782 transitions. [2022-11-16 10:56:24,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-16 10:56:24,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:24,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:24,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 10:56:24,114 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:24,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:24,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1091976193, now seen corresponding path program 1 times [2022-11-16 10:56:24,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:24,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633048480] [2022-11-16 10:56:24,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:24,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:24,392 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 10:56:24,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:24,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633048480] [2022-11-16 10:56:24,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633048480] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:24,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:24,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:56:24,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284416325] [2022-11-16 10:56:24,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:24,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 10:56:24,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:24,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 10:56:24,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:56:24,395 INFO L87 Difference]: Start difference. First operand 1627 states and 4782 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:24,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:24,559 INFO L93 Difference]: Finished difference Result 1231 states and 3638 transitions. [2022-11-16 10:56:24,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:56:24,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-16 10:56:24,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:24,564 INFO L225 Difference]: With dead ends: 1231 [2022-11-16 10:56:24,564 INFO L226 Difference]: Without dead ends: 1195 [2022-11-16 10:56:24,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:56:24,565 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 64 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:24,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 16 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:56:24,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2022-11-16 10:56:24,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1150. [2022-11-16 10:56:24,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1149 states have (on average 2.957354221061793) internal successors, (3398), 1149 states have internal predecessors, (3398), 0 states have call successors, (0), 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 10:56:24,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 3398 transitions. [2022-11-16 10:56:24,600 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 3398 transitions. Word has length 21 [2022-11-16 10:56:24,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:24,601 INFO L495 AbstractCegarLoop]: Abstraction has 1150 states and 3398 transitions. [2022-11-16 10:56:24,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:24,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 3398 transitions. [2022-11-16 10:56:24,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 10:56:24,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:24,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:24,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 10:56:24,606 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:24,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:24,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1899498599, now seen corresponding path program 1 times [2022-11-16 10:56:24,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:24,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225463229] [2022-11-16 10:56:24,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:24,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:25,476 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 10:56:25,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:25,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225463229] [2022-11-16 10:56:25,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225463229] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:25,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:25,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 10:56:25,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241947387] [2022-11-16 10:56:25,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:25,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 10:56:25,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:25,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 10:56:25,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:56:25,480 INFO L87 Difference]: Start difference. First operand 1150 states and 3398 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 10:56:26,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:26,015 INFO L93 Difference]: Finished difference Result 1671 states and 4760 transitions. [2022-11-16 10:56:26,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 10:56:26,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-16 10:56:26,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:26,021 INFO L225 Difference]: With dead ends: 1671 [2022-11-16 10:56:26,022 INFO L226 Difference]: Without dead ends: 1427 [2022-11-16 10:56:26,022 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 10:56:26,023 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 77 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:26,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 57 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 10:56:26,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2022-11-16 10:56:26,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1250. [2022-11-16 10:56:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 2.9511609287429943) internal successors, (3686), 1249 states have internal predecessors, (3686), 0 states have call successors, (0), 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 10:56:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 3686 transitions. [2022-11-16 10:56:26,081 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 3686 transitions. Word has length 25 [2022-11-16 10:56:26,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:26,081 INFO L495 AbstractCegarLoop]: Abstraction has 1250 states and 3686 transitions. [2022-11-16 10:56:26,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 10:56:26,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 3686 transitions. [2022-11-16 10:56:26,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 10:56:26,086 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:26,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:26,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 10:56:26,087 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:26,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:26,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1314856137, now seen corresponding path program 2 times [2022-11-16 10:56:26,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:26,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875721629] [2022-11-16 10:56:26,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:26,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:27,180 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 10:56:27,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:27,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875721629] [2022-11-16 10:56:27,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875721629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:27,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:27,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 10:56:27,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106670465] [2022-11-16 10:56:27,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:27,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 10:56:27,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:27,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 10:56:27,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 10:56:27,183 INFO L87 Difference]: Start difference. First operand 1250 states and 3686 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 10:56:27,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:27,949 INFO L93 Difference]: Finished difference Result 1763 states and 5003 transitions. [2022-11-16 10:56:27,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 10:56:27,950 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-16 10:56:27,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:27,955 INFO L225 Difference]: With dead ends: 1763 [2022-11-16 10:56:27,955 INFO L226 Difference]: Without dead ends: 1667 [2022-11-16 10:56:27,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-11-16 10:56:27,956 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 83 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:27,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 55 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 10:56:27,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2022-11-16 10:56:27,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1313. [2022-11-16 10:56:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1313 states, 1312 states have (on average 2.919207317073171) internal successors, (3830), 1312 states have internal predecessors, (3830), 0 states have call successors, (0), 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 10:56:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 3830 transitions. [2022-11-16 10:56:27,997 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 3830 transitions. Word has length 25 [2022-11-16 10:56:27,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:27,997 INFO L495 AbstractCegarLoop]: Abstraction has 1313 states and 3830 transitions. [2022-11-16 10:56:27,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 10:56:27,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 3830 transitions. [2022-11-16 10:56:28,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 10:56:28,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:28,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:28,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 10:56:28,003 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:28,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:28,004 INFO L85 PathProgramCache]: Analyzing trace with hash 643386599, now seen corresponding path program 3 times [2022-11-16 10:56:28,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:28,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343774454] [2022-11-16 10:56:28,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:28,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:28,456 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 10:56:28,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:28,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343774454] [2022-11-16 10:56:28,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343774454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:28,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:28,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 10:56:28,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218535184] [2022-11-16 10:56:28,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:28,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:56:28,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:28,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:56:28,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:56:28,459 INFO L87 Difference]: Start difference. First operand 1313 states and 3830 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 10:56:28,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:28,660 INFO L93 Difference]: Finished difference Result 1244 states and 3694 transitions. [2022-11-16 10:56:28,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:56:28,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-16 10:56:28,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:28,663 INFO L225 Difference]: With dead ends: 1244 [2022-11-16 10:56:28,663 INFO L226 Difference]: Without dead ends: 790 [2022-11-16 10:56:28,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:56:28,664 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 75 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:28,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 14 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:56:28,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2022-11-16 10:56:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 736. [2022-11-16 10:56:28,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 735 states have (on average 2.896598639455782) internal successors, (2129), 735 states have internal predecessors, (2129), 0 states have call successors, (0), 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 10:56:28,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 2129 transitions. [2022-11-16 10:56:28,686 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 2129 transitions. Word has length 25 [2022-11-16 10:56:28,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:28,686 INFO L495 AbstractCegarLoop]: Abstraction has 736 states and 2129 transitions. [2022-11-16 10:56:28,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 10:56:28,687 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 2129 transitions. [2022-11-16 10:56:28,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 10:56:28,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:28,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:28,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 10:56:28,690 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:28,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:28,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1256090467, now seen corresponding path program 1 times [2022-11-16 10:56:28,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:28,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998247896] [2022-11-16 10:56:28,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:28,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:29,035 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 10:56:29,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:29,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998247896] [2022-11-16 10:56:29,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998247896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:29,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:29,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:56:29,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519810285] [2022-11-16 10:56:29,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:29,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 10:56:29,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:29,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 10:56:29,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:56:29,039 INFO L87 Difference]: Start difference. First operand 736 states and 2129 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:56:29,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:29,284 INFO L93 Difference]: Finished difference Result 1097 states and 3161 transitions. [2022-11-16 10:56:29,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:56:29,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-11-16 10:56:29,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:29,288 INFO L225 Difference]: With dead ends: 1097 [2022-11-16 10:56:29,288 INFO L226 Difference]: Without dead ends: 669 [2022-11-16 10:56:29,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:56:29,289 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:29,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 14 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:56:29,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-11-16 10:56:29,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 620. [2022-11-16 10:56:29,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 619 states have (on average 2.8352180936995155) internal successors, (1755), 619 states have internal predecessors, (1755), 0 states have call successors, (0), 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 10:56:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1755 transitions. [2022-11-16 10:56:29,312 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1755 transitions. Word has length 29 [2022-11-16 10:56:29,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:29,312 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 1755 transitions. [2022-11-16 10:56:29,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:56:29,313 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1755 transitions. [2022-11-16 10:56:29,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 10:56:29,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:29,316 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:29,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 10:56:29,316 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:29,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:29,317 INFO L85 PathProgramCache]: Analyzing trace with hash 483919581, now seen corresponding path program 2 times [2022-11-16 10:56:29,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:29,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504195067] [2022-11-16 10:56:29,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:29,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:31,950 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 10:56:31,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:31,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504195067] [2022-11-16 10:56:31,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504195067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:31,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:31,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 10:56:31,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374834034] [2022-11-16 10:56:31,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:31,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 10:56:31,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:31,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 10:56:31,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-16 10:56:31,953 INFO L87 Difference]: Start difference. First operand 620 states and 1755 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:56:32,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:32,702 INFO L93 Difference]: Finished difference Result 996 states and 2776 transitions. [2022-11-16 10:56:32,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 10:56:32,703 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-11-16 10:56:32,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:32,705 INFO L225 Difference]: With dead ends: 996 [2022-11-16 10:56:32,705 INFO L226 Difference]: Without dead ends: 765 [2022-11-16 10:56:32,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-11-16 10:56:32,706 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 120 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:32,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 51 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 10:56:32,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2022-11-16 10:56:32,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 574. [2022-11-16 10:56:32,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 2.696335078534031) internal successors, (1545), 573 states have internal predecessors, (1545), 0 states have call successors, (0), 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 10:56:32,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 1545 transitions. [2022-11-16 10:56:32,723 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 1545 transitions. Word has length 29 [2022-11-16 10:56:32,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:32,724 INFO L495 AbstractCegarLoop]: Abstraction has 574 states and 1545 transitions. [2022-11-16 10:56:32,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:56:32,724 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 1545 transitions. [2022-11-16 10:56:32,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 10:56:32,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:32,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:32,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 10:56:32,727 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:32,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:32,728 INFO L85 PathProgramCache]: Analyzing trace with hash 317827519, now seen corresponding path program 3 times [2022-11-16 10:56:32,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:32,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483573248] [2022-11-16 10:56:32,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:32,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:32,998 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 10:56:32,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:32,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483573248] [2022-11-16 10:56:32,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483573248] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:32,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:32,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:56:32,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068345399] [2022-11-16 10:56:32,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:33,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 10:56:33,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:33,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 10:56:33,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:56:33,001 INFO L87 Difference]: Start difference. First operand 574 states and 1545 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:56:33,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:33,194 INFO L93 Difference]: Finished difference Result 784 states and 2114 transitions. [2022-11-16 10:56:33,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:56:33,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-11-16 10:56:33,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:33,196 INFO L225 Difference]: With dead ends: 784 [2022-11-16 10:56:33,196 INFO L226 Difference]: Without dead ends: 274 [2022-11-16 10:56:33,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:56:33,197 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:33,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 19 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:56:33,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-11-16 10:56:33,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2022-11-16 10:56:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 2.58974358974359) internal successors, (707), 273 states have internal predecessors, (707), 0 states have call successors, (0), 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 10:56:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 707 transitions. [2022-11-16 10:56:33,205 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 707 transitions. Word has length 29 [2022-11-16 10:56:33,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:33,205 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 707 transitions. [2022-11-16 10:56:33,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:56:33,206 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 707 transitions. [2022-11-16 10:56:33,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 10:56:33,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:33,207 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:33,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 10:56:33,208 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:33,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:33,208 INFO L85 PathProgramCache]: Analyzing trace with hash -49466137, now seen corresponding path program 4 times [2022-11-16 10:56:33,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:33,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551872767] [2022-11-16 10:56:33,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:33,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:34,549 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 10:56:34,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:34,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551872767] [2022-11-16 10:56:34,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551872767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:34,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:34,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 10:56:34,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058767575] [2022-11-16 10:56:34,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:34,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 10:56:34,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:34,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 10:56:34,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-16 10:56:34,552 INFO L87 Difference]: Start difference. First operand 274 states and 707 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:56:34,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:34,923 INFO L93 Difference]: Finished difference Result 338 states and 848 transitions. [2022-11-16 10:56:34,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 10:56:34,924 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-11-16 10:56:34,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:34,924 INFO L225 Difference]: With dead ends: 338 [2022-11-16 10:56:34,924 INFO L226 Difference]: Without dead ends: 219 [2022-11-16 10:56:34,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-16 10:56:34,925 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:34,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 34 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 10:56:34,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-11-16 10:56:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 182. [2022-11-16 10:56:34,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 2.3480662983425415) internal successors, (425), 181 states have internal predecessors, (425), 0 states have call successors, (0), 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 10:56:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 425 transitions. [2022-11-16 10:56:34,931 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 425 transitions. Word has length 29 [2022-11-16 10:56:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:34,931 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 425 transitions. [2022-11-16 10:56:34,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:56:34,931 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 425 transitions. [2022-11-16 10:56:34,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 10:56:34,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:34,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:34,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 10:56:34,932 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:34,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:34,933 INFO L85 PathProgramCache]: Analyzing trace with hash -235128099, now seen corresponding path program 5 times [2022-11-16 10:56:34,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:34,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846110689] [2022-11-16 10:56:34,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:34,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 10:56:35,009 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 10:56:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 10:56:35,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 10:56:35,097 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 10:56:35,098 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-16 10:56:35,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-16 10:56:35,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-16 10:56:35,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-16 10:56:35,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-16 10:56:35,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-16 10:56:35,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-16 10:56:35,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-16 10:56:35,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-16 10:56:35,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-16 10:56:35,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-16 10:56:35,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-16 10:56:35,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-16 10:56:35,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-16 10:56:35,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-16 10:56:35,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-16 10:56:35,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 10:56:35,107 INFO L444 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:35,113 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 10:56:35,113 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 10:56:35,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 10:56:35 BasicIcfg [2022-11-16 10:56:35,235 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 10:56:35,236 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 10:56:35,236 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 10:56:35,236 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 10:56:35,237 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:56:04" (3/4) ... [2022-11-16 10:56:35,240 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 10:56:35,240 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 10:56:35,241 INFO L158 Benchmark]: Toolchain (without parser) took 32728.33ms. Allocated memory was 86.0MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 49.8MB in the beginning and 902.3MB in the end (delta: -852.4MB). Peak memory consumption was 452.7MB. Max. memory is 16.1GB. [2022-11-16 10:56:35,242 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 86.0MB. Free memory was 58.4MB in the beginning and 58.3MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 10:56:35,243 INFO L158 Benchmark]: CACSL2BoogieTranslator took 903.59ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 49.7MB in the beginning and 72.5MB in the end (delta: -22.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-16 10:56:35,243 INFO L158 Benchmark]: Boogie Procedure Inliner took 117.34ms. Allocated memory is still 111.1MB. Free memory was 72.5MB in the beginning and 70.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 10:56:35,244 INFO L158 Benchmark]: Boogie Preprocessor took 89.55ms. Allocated memory is still 111.1MB. Free memory was 70.1MB in the beginning and 68.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 10:56:35,244 INFO L158 Benchmark]: RCFGBuilder took 1174.17ms. Allocated memory is still 111.1MB. Free memory was 68.0MB in the beginning and 64.9MB in the end (delta: 3.1MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2022-11-16 10:56:35,245 INFO L158 Benchmark]: TraceAbstraction took 30430.13ms. Allocated memory was 111.1MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 64.3MB in the beginning and 903.3MB in the end (delta: -839.0MB). Peak memory consumption was 443.3MB. Max. memory is 16.1GB. [2022-11-16 10:56:35,246 INFO L158 Benchmark]: Witness Printer took 4.58ms. Allocated memory is still 1.4GB. Free memory was 903.3MB in the beginning and 902.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 10:56:35,251 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.36ms. Allocated memory is still 86.0MB. Free memory was 58.4MB in the beginning and 58.3MB in the end (delta: 27.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 903.59ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 49.7MB in the beginning and 72.5MB in the end (delta: -22.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 117.34ms. Allocated memory is still 111.1MB. Free memory was 72.5MB in the beginning and 70.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.55ms. Allocated memory is still 111.1MB. Free memory was 70.1MB in the beginning and 68.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1174.17ms. Allocated memory is still 111.1MB. Free memory was 68.0MB in the beginning and 64.9MB in the end (delta: 3.1MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * TraceAbstraction took 30430.13ms. Allocated memory was 111.1MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 64.3MB in the beginning and 903.3MB in the end (delta: -839.0MB). Peak memory consumption was 443.3MB. Max. memory is 16.1GB. * Witness Printer took 4.58ms. Allocated memory is still 1.4GB. Free memory was 903.3MB in the beginning and 902.3MB 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: 7.8s, 160 PlacesBefore, 57 PlacesAfterwards, 149 TransitionsBefore, 45 TransitionsAfterwards, 3764 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 145 TotalNumberOfCompositions, 10866 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6409, independent: 6179, independent conditional: 0, independent unconditional: 6179, dependent: 230, dependent conditional: 0, dependent unconditional: 230, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2839, independent: 2780, independent conditional: 0, independent unconditional: 2780, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2839, independent: 2752, independent conditional: 0, independent unconditional: 2752, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 87, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 542, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 494, dependent conditional: 0, dependent unconditional: 494, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6409, independent: 3399, independent conditional: 0, independent unconditional: 3399, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 2839, unknown conditional: 0, unknown unconditional: 2839] , Statistics on independence cache: Total cache size (in pairs): 385, Positive cache size: 357, Positive conditional cache size: 0, Positive unconditional cache size: 357, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, 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: [L736] 0 _Bool a$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L720] 0 int a$mem_tmp; [L731] 0 _Bool a$read_delayed; [L712] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L727] 0 _Bool a$r_buff1_thd1; [L733] 0 int a$w_buff0; [L728] 0 _Bool a$r_buff1_thd2; [L735] 0 int a$w_buff1; [L719] 0 _Bool a$flush_delayed; [L726] 0 _Bool a$r_buff1_thd0; [L710] 0 int __unbuffered_cnt = 0; [L732] 0 int *a$read_delayed_var; [L738] 0 _Bool main$tmp_guard1; [L737] 0 _Bool main$tmp_guard0; [L734] 0 _Bool a$w_buff0_used; [L722] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd0; [L714] 0 int __unbuffered_p3_EAX = 0; [L724] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd4; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L864] 0 pthread_t t713; [L865] FCALL, FORK 0 pthread_create(&t713, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t713, ((void *)0), P0, ((void *)0))=-4, t713={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=0] [L866] 0 pthread_t t714; [L867] FCALL, FORK 0 pthread_create(&t714, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t714, ((void *)0), P1, ((void *)0))=-3, t713={5:0}, t714={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L868] 0 pthread_t t715; [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L869] FCALL, FORK 0 pthread_create(&t715, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t715, ((void *)0), P2, ((void *)0))=-2, t713={5:0}, t714={6:0}, t715={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L870] 0 pthread_t t716; [L871] FCALL, FORK 0 pthread_create(&t716, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t716, ((void *)0), P3, ((void *)0))=-1, t713={5:0}, t714={6:0}, t715={7:0}, t716={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L800] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L803] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L820] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t713={5:0}, t714={6:0}, t715={7:0}, t716={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] [L884] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L886] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2] - 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: -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: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 869]: 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: 871]: 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: 867]: 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 9 procedures, 186 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 30.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 912 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 912 mSDsluCounter, 424 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 292 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2972 IncrementalHoareTripleChecker+Invalid, 3080 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 132 mSDtfsCounter, 2972 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6448occurred in iteration=0, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 6026 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 313 ConstructedInterpolants, 0 QuantifiedInterpolants, 3626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-16 10:56:35,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 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_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20 --- 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 10:56:38,012 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 10:56:38,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 10:56:38,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 10:56:38,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 10:56:38,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 10:56:38,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 10:56:38,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 10:56:38,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 10:56:38,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 10:56:38,050 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 10:56:38,052 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 10:56:38,052 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 10:56:38,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 10:56:38,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 10:56:38,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 10:56:38,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 10:56:38,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 10:56:38,062 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 10:56:38,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 10:56:38,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 10:56:38,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 10:56:38,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 10:56:38,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 10:56:38,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 10:56:38,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 10:56:38,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 10:56:38,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 10:56:38,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 10:56:38,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 10:56:38,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 10:56:38,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 10:56:38,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 10:56:38,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 10:56:38,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 10:56:38,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 10:56:38,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 10:56:38,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 10:56:38,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 10:56:38,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 10:56:38,108 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 10:56:38,109 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-16 10:56:38,157 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 10:56:38,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 10:56:38,159 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 10:56:38,160 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 10:56:38,161 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 10:56:38,161 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 10:56:38,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 10:56:38,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 10:56:38,163 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 10:56:38,164 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 10:56:38,165 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 10:56:38,165 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 10:56:38,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 10:56:38,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 10:56:38,166 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 10:56:38,166 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 10:56:38,167 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 10:56:38,167 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 10:56:38,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 10:56:38,167 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 10:56:38,167 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 10:56:38,168 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 10:56:38,168 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 10:56:38,168 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 10:56:38,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 10:56:38,169 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 10:56:38,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 10:56:38,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:56:38,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 10:56:38,170 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 10:56:38,170 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 10:56:38,170 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 10:56:38,171 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 10:56:38,171 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_6d4f24d9-a9ec-42e7-b707-754c5303307d/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_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 -> d8f535cb798ce58a79ec2e9a728d4e5d884025e215c7cfd9880fc53267dd5a20 [2022-11-16 10:56:38,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 10:56:38,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 10:56:38,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 10:56:38,625 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 10:56:38,626 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 10:56:38,628 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i [2022-11-16 10:56:38,722 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/data/9744ccbce/6591b6b5540a492b952b02043fdd2a1a/FLAGf51d48bdd [2022-11-16 10:56:39,374 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 10:56:39,379 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i [2022-11-16 10:56:39,400 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/data/9744ccbce/6591b6b5540a492b952b02043fdd2a1a/FLAGf51d48bdd [2022-11-16 10:56:39,619 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/data/9744ccbce/6591b6b5540a492b952b02043fdd2a1a [2022-11-16 10:56:39,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 10:56:39,624 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 10:56:39,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 10:56:39,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 10:56:39,634 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 10:56:39,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:56:39" (1/1) ... [2022-11-16 10:56:39,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70e8942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:39, skipping insertion in model container [2022-11-16 10:56:39,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:56:39" (1/1) ... [2022-11-16 10:56:39,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 10:56:39,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 10:56:39,920 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_6d4f24d9-a9ec-42e7-b707-754c5303307d/sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-16 10:56:40,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:56:40,314 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 10:56:40,334 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_6d4f24d9-a9ec-42e7-b707-754c5303307d/sv-benchmarks/c/pthread-wmm/mix027_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-11-16 10:56:40,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:56:40,504 INFO L208 MainTranslator]: Completed translation [2022-11-16 10:56:40,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:40 WrapperNode [2022-11-16 10:56:40,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 10:56:40,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 10:56:40,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 10:56:40,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 10:56:40,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:40" (1/1) ... [2022-11-16 10:56:40,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:40" (1/1) ... [2022-11-16 10:56:40,618 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-11-16 10:56:40,619 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 10:56:40,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 10:56:40,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 10:56:40,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 10:56:40,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:40" (1/1) ... [2022-11-16 10:56:40,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:40" (1/1) ... [2022-11-16 10:56:40,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:40" (1/1) ... [2022-11-16 10:56:40,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:40" (1/1) ... [2022-11-16 10:56:40,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:40" (1/1) ... [2022-11-16 10:56:40,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:40" (1/1) ... [2022-11-16 10:56:40,689 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:40" (1/1) ... [2022-11-16 10:56:40,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:40" (1/1) ... [2022-11-16 10:56:40,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 10:56:40,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 10:56:40,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 10:56:40,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 10:56:40,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:40" (1/1) ... [2022-11-16 10:56:40,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:56:40,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:56:40,742 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 10:56:40,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 10:56:40,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 10:56:40,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 10:56:40,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 10:56:40,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 10:56:40,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 10:56:40,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 10:56:40,803 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 10:56:40,803 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 10:56:40,804 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 10:56:40,804 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 10:56:40,805 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 10:56:40,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 10:56:40,805 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-16 10:56:40,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-16 10:56:40,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 10:56:40,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 10:56:40,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 10:56:40,808 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 10:56:41,004 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 10:56:41,007 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 10:56:41,691 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 10:56:41,930 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 10:56:41,931 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 10:56:41,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:56:41 BoogieIcfgContainer [2022-11-16 10:56:41,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 10:56:41,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 10:56:41,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 10:56:41,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 10:56:41,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:56:39" (1/3) ... [2022-11-16 10:56:41,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ea9d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:56:41, skipping insertion in model container [2022-11-16 10:56:41,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:56:40" (2/3) ... [2022-11-16 10:56:41,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ea9d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:56:41, skipping insertion in model container [2022-11-16 10:56:41,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:56:41" (3/3) ... [2022-11-16 10:56:41,951 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_power.oepc_pso.oepc_rmo.oepc.i [2022-11-16 10:56:41,976 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 10:56:41,977 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-16 10:56:41,977 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 10:56:42,123 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 10:56:42,185 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 10:56:42,206 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 150 transitions, 320 flow [2022-11-16 10:56:42,212 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 150 transitions, 320 flow [2022-11-16 10:56:42,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 150 transitions, 320 flow [2022-11-16 10:56:42,312 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2022-11-16 10:56:42,313 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 10:56:42,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-11-16 10:56:42,328 INFO L119 LiptonReduction]: Number of co-enabled transitions 3764 [2022-11-16 10:56:54,197 INFO L134 LiptonReduction]: Checked pairs total: 10992 [2022-11-16 10:56:54,197 INFO L136 LiptonReduction]: Total number of compositions: 138 [2022-11-16 10:56:54,206 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 45 transitions, 110 flow [2022-11-16 10:56:54,573 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 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 10:56:54,599 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 10:56:54,609 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;@174becc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 10:56:54,609 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-16 10:56:54,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 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 10:56:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 10:56:54,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:54,657 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 10:56:54,659 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:54,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:54,669 INFO L85 PathProgramCache]: Analyzing trace with hash 624, now seen corresponding path program 1 times [2022-11-16 10:56:54,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:56:54,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772131549] [2022-11-16 10:56:54,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:54,684 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 10:56:54,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:56:54,694 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:56:54,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:56:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:54,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 10:56:54,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:54,852 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 10:56:54,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:56:54,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:56:54,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772131549] [2022-11-16 10:56:54,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772131549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:54,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:54,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 10:56:54,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757745629] [2022-11-16 10:56:54,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:54,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 10:56:54,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:56:54,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 10:56:54,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 10:56:54,907 INFO L87 Difference]: Start difference. First operand has 6448 states, 6429 states have (on average 4.14434593249339) internal successors, (26644), 6447 states have internal predecessors, (26644), 0 states have call successors, (0), 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 10:56:55,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:55,331 INFO L93 Difference]: Finished difference Result 6074 states and 24532 transitions. [2022-11-16 10:56:55,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 10:56:55,334 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 10:56:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:55,470 INFO L225 Difference]: With dead ends: 6074 [2022-11-16 10:56:55,471 INFO L226 Difference]: Without dead ends: 6074 [2022-11-16 10:56:55,472 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 10:56:55,476 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:55,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:56:55,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6074 states. [2022-11-16 10:56:55,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6074 to 6074. [2022-11-16 10:56:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6074 states, 6069 states have (on average 4.042181578513758) internal successors, (24532), 6073 states have internal predecessors, (24532), 0 states have call successors, (0), 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 10:56:56,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6074 states to 6074 states and 24532 transitions. [2022-11-16 10:56:56,064 INFO L78 Accepts]: Start accepts. Automaton has 6074 states and 24532 transitions. Word has length 1 [2022-11-16 10:56:56,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:56,064 INFO L495 AbstractCegarLoop]: Abstraction has 6074 states and 24532 transitions. [2022-11-16 10:56:56,066 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 10:56:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 6074 states and 24532 transitions. [2022-11-16 10:56:56,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 10:56:56,167 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:56,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 10:56:56,189 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:56:56,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:56:56,368 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:56,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:56,369 INFO L85 PathProgramCache]: Analyzing trace with hash 613290, now seen corresponding path program 1 times [2022-11-16 10:56:56,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:56:56,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310516970] [2022-11-16 10:56:56,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:56,370 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 10:56:56,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:56:56,377 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:56:56,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:56:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:56,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 10:56:56,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:56,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 10:56:56,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:56:56,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:56:56,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310516970] [2022-11-16 10:56:56,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310516970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:56,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:56,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 10:56:56,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279413111] [2022-11-16 10:56:56,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:56,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:56:56,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:56:56,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:56:56,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:56:56,595 INFO L87 Difference]: Start difference. First operand 6074 states and 24532 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 10:56:56,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:56,944 INFO L93 Difference]: Finished difference Result 4962 states and 19815 transitions. [2022-11-16 10:56:56,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:56:56,945 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 10:56:56,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:57,054 INFO L225 Difference]: With dead ends: 4962 [2022-11-16 10:56:57,070 INFO L226 Difference]: Without dead ends: 4812 [2022-11-16 10:56:57,071 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 10:56:57,073 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:57,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 8 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:56:57,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4812 states. [2022-11-16 10:56:57,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4812 to 4812. [2022-11-16 10:56:57,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4812 states, 4810 states have (on average 4.012474012474012) internal successors, (19300), 4811 states have internal predecessors, (19300), 0 states have call successors, (0), 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 10:56:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 19300 transitions. [2022-11-16 10:56:57,630 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 19300 transitions. Word has length 3 [2022-11-16 10:56:57,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:57,632 INFO L495 AbstractCegarLoop]: Abstraction has 4812 states and 19300 transitions. [2022-11-16 10:56:57,632 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 10:56:57,632 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 19300 transitions. [2022-11-16 10:56:57,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 10:56:57,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:57,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:57,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:56:57,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:56:57,861 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:57,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:57,862 INFO L85 PathProgramCache]: Analyzing trace with hash 328809383, now seen corresponding path program 1 times [2022-11-16 10:56:57,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:56:57,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281115523] [2022-11-16 10:56:57,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:57,863 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 10:56:57,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:56:57,868 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:56:57,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:56:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:58,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 10:56:58,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:58,110 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 10:56:58,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:56:58,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:56:58,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281115523] [2022-11-16 10:56:58,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281115523] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:58,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:58,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 10:56:58,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43302433] [2022-11-16 10:56:58,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:58,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 10:56:58,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:56:58,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 10:56:58,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 10:56:58,116 INFO L87 Difference]: Start difference. First operand 4812 states and 19300 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:58,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:58,317 INFO L93 Difference]: Finished difference Result 3212 states and 11300 transitions. [2022-11-16 10:56:58,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 10:56:58,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 10:56:58,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:58,344 INFO L225 Difference]: With dead ends: 3212 [2022-11-16 10:56:58,344 INFO L226 Difference]: Without dead ends: 3212 [2022-11-16 10:56:58,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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 10:56:58,346 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:58,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:56:58,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2022-11-16 10:56:58,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 3212. [2022-11-16 10:56:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 3210 states have (on average 3.520249221183801) internal successors, (11300), 3211 states have internal predecessors, (11300), 0 states have call successors, (0), 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 10:56:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 11300 transitions. [2022-11-16 10:56:58,533 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 11300 transitions. Word has length 12 [2022-11-16 10:56:58,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:58,534 INFO L495 AbstractCegarLoop]: Abstraction has 3212 states and 11300 transitions. [2022-11-16 10:56:58,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:58,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 11300 transitions. [2022-11-16 10:56:58,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 10:56:58,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:58,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:58,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:56:58,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:56:58,752 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:58,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:58,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1489575092, now seen corresponding path program 1 times [2022-11-16 10:56:58,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:56:58,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113698100] [2022-11-16 10:56:58,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:58,754 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 10:56:58,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:56:58,756 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:56:58,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:56:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:58,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 10:56:58,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:58,989 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 10:56:58,990 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:56:58,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:56:58,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113698100] [2022-11-16 10:56:58,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113698100] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:58,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:58,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:56:58,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444942734] [2022-11-16 10:56:58,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:58,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:56:58,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:56:58,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:56:58,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:56:58,995 INFO L87 Difference]: Start difference. First operand 3212 states and 11300 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:59,304 INFO L93 Difference]: Finished difference Result 1692 states and 5220 transitions. [2022-11-16 10:56:59,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 10:56:59,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-16 10:56:59,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:59,317 INFO L225 Difference]: With dead ends: 1692 [2022-11-16 10:56:59,318 INFO L226 Difference]: Without dead ends: 1692 [2022-11-16 10:56:59,322 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 10:56:59,326 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 29 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:59,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 16 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 10:56:59,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2022-11-16 10:56:59,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1692. [2022-11-16 10:56:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1692 states, 1690 states have (on average 3.088757396449704) internal successors, (5220), 1691 states have internal predecessors, (5220), 0 states have call successors, (0), 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 10:56:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1692 states to 1692 states and 5220 transitions. [2022-11-16 10:56:59,389 INFO L78 Accepts]: Start accepts. Automaton has 1692 states and 5220 transitions. Word has length 16 [2022-11-16 10:56:59,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:59,396 INFO L495 AbstractCegarLoop]: Abstraction has 1692 states and 5220 transitions. [2022-11-16 10:56:59,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:56:59,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1692 states and 5220 transitions. [2022-11-16 10:56:59,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 10:56:59,403 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:59,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:59,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:56:59,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:56:59,622 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:56:59,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:59,623 INFO L85 PathProgramCache]: Analyzing trace with hash 568493933, now seen corresponding path program 1 times [2022-11-16 10:56:59,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:56:59,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773378735] [2022-11-16 10:56:59,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:59,623 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 10:56:59,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:56:59,625 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:56:59,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:56:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:56:59,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 10:56:59,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:59,881 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 10:56:59,882 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:56:59,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:56:59,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773378735] [2022-11-16 10:56:59,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773378735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:56:59,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:56:59,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:56:59,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098083399] [2022-11-16 10:56:59,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:56:59,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 10:56:59,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:56:59,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 10:56:59,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:56:59,886 INFO L87 Difference]: Start difference. First operand 1692 states and 5220 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:57:00,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:57:00,235 INFO L93 Difference]: Finished difference Result 1152 states and 3600 transitions. [2022-11-16 10:57:00,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:57:00,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-16 10:57:00,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:57:00,242 INFO L225 Difference]: With dead ends: 1152 [2022-11-16 10:57:00,242 INFO L226 Difference]: Without dead ends: 1152 [2022-11-16 10:57:00,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:57:00,243 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 10:57:00,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 36 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 10:57:00,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2022-11-16 10:57:00,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1152. [2022-11-16 10:57:00,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1150 states have (on average 3.130434782608696) internal successors, (3600), 1151 states have internal predecessors, (3600), 0 states have call successors, (0), 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 10:57:00,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 3600 transitions. [2022-11-16 10:57:00,335 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 3600 transitions. Word has length 20 [2022-11-16 10:57:00,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:57:00,335 INFO L495 AbstractCegarLoop]: Abstraction has 1152 states and 3600 transitions. [2022-11-16 10:57:00,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 10:57:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 3600 transitions. [2022-11-16 10:57:00,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 10:57:00,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:57:00,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:57:00,360 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:00,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:00,555 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:57:00,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:57:00,556 INFO L85 PathProgramCache]: Analyzing trace with hash -391101796, now seen corresponding path program 1 times [2022-11-16 10:57:00,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:57:00,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240114531] [2022-11-16 10:57:00,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:57:00,557 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 10:57:00,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:57:00,558 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:00,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:57:00,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 10:57:00,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:00,864 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 10:57:00,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:57:00,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:57:00,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240114531] [2022-11-16 10:57:00,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240114531] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:57:00,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:57:00,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 10:57:00,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745387741] [2022-11-16 10:57:00,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:57:00,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:57:00,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:57:00,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:57:00,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:57:00,873 INFO L87 Difference]: Start difference. First operand 1152 states and 3600 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 10:57:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:57:01,369 INFO L93 Difference]: Finished difference Result 1067 states and 3430 transitions. [2022-11-16 10:57:01,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:57:01,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-16 10:57:01,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:57:01,376 INFO L225 Difference]: With dead ends: 1067 [2022-11-16 10:57:01,376 INFO L226 Difference]: Without dead ends: 1067 [2022-11-16 10:57:01,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:57:01,377 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 55 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 10:57:01,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 64 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 10:57:01,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2022-11-16 10:57:01,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1067. [2022-11-16 10:57:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 1065 states have (on average 3.220657276995305) internal successors, (3430), 1066 states have internal predecessors, (3430), 0 states have call successors, (0), 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 10:57:01,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 3430 transitions. [2022-11-16 10:57:01,426 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 3430 transitions. Word has length 24 [2022-11-16 10:57:01,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:57:01,427 INFO L495 AbstractCegarLoop]: Abstraction has 1067 states and 3430 transitions. [2022-11-16 10:57:01,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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 10:57:01,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 3430 transitions. [2022-11-16 10:57:01,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 10:57:01,446 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:57:01,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:57:01,480 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:01,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:01,661 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:57:01,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:57:01,662 INFO L85 PathProgramCache]: Analyzing trace with hash 187790763, now seen corresponding path program 1 times [2022-11-16 10:57:01,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:57:01,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1431581833] [2022-11-16 10:57:01,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:57:01,663 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 10:57:01,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:57:01,671 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:01,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:57:01,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 10:57:01,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:01,982 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 10:57:01,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:57:01,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:57:01,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1431581833] [2022-11-16 10:57:01,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1431581833] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:57:01,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:57:01,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:57:01,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240740222] [2022-11-16 10:57:01,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:57:01,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:57:01,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:57:01,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:57:01,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:57:01,989 INFO L87 Difference]: Start difference. First operand 1067 states and 3430 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:57:02,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:57:02,245 INFO L93 Difference]: Finished difference Result 1575 states and 4976 transitions. [2022-11-16 10:57:02,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 10:57:02,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-11-16 10:57:02,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:57:02,256 INFO L225 Difference]: With dead ends: 1575 [2022-11-16 10:57:02,256 INFO L226 Difference]: Without dead ends: 1575 [2022-11-16 10:57:02,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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 10:57:02,258 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:57:02,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 17 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:57:02,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2022-11-16 10:57:02,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1574. [2022-11-16 10:57:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1572 states have (on average 3.1653944020356235) internal successors, (4976), 1573 states have internal predecessors, (4976), 0 states have call successors, (0), 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 10:57:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 4976 transitions. [2022-11-16 10:57:02,370 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 4976 transitions. Word has length 29 [2022-11-16 10:57:02,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:57:02,371 INFO L495 AbstractCegarLoop]: Abstraction has 1574 states and 4976 transitions. [2022-11-16 10:57:02,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:57:02,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 4976 transitions. [2022-11-16 10:57:02,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 10:57:02,377 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:57:02,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:57:02,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:02,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:02,592 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:57:02,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:57:02,593 INFO L85 PathProgramCache]: Analyzing trace with hash 187790796, now seen corresponding path program 1 times [2022-11-16 10:57:02,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:57:02,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933351020] [2022-11-16 10:57:02,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:57:02,594 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 10:57:02,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:57:02,596 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:02,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 (9)] Waiting until timeout for monitored process [2022-11-16 10:57:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:57:02,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-16 10:57:02,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:03,806 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 10:57:03,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:57:03,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:57:03,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933351020] [2022-11-16 10:57:03,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933351020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:57:03,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:57:03,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:57:03,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147076822] [2022-11-16 10:57:03,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:57:03,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:57:03,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:57:03,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:57:03,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:57:03,808 INFO L87 Difference]: Start difference. First operand 1574 states and 4976 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:57:04,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:57:04,100 INFO L93 Difference]: Finished difference Result 2840 states and 8996 transitions. [2022-11-16 10:57:04,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:57:04,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-11-16 10:57:04,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:57:04,113 INFO L225 Difference]: With dead ends: 2840 [2022-11-16 10:57:04,113 INFO L226 Difference]: Without dead ends: 2501 [2022-11-16 10:57:04,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:57:04,115 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 10:57:04,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 41 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 43 Unchecked, 0.3s Time] [2022-11-16 10:57:04,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2501 states. [2022-11-16 10:57:04,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2501 to 1801. [2022-11-16 10:57:04,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1799 states have (on average 3.1172873818788216) internal successors, (5608), 1800 states have internal predecessors, (5608), 0 states have call successors, (0), 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 10:57:04,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 5608 transitions. [2022-11-16 10:57:04,199 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 5608 transitions. Word has length 29 [2022-11-16 10:57:04,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:57:04,200 INFO L495 AbstractCegarLoop]: Abstraction has 1801 states and 5608 transitions. [2022-11-16 10:57:04,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:57:04,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 5608 transitions. [2022-11-16 10:57:04,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 10:57:04,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:57:04,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:57:04,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 (9)] Forceful destruction successful, exit code 0 [2022-11-16 10:57:04,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:04,431 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:57:04,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:57:04,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1538760950, now seen corresponding path program 2 times [2022-11-16 10:57:04,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:57:04,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926002311] [2022-11-16 10:57:04,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 10:57:04,433 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 10:57:04,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:57:04,435 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:04,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 (10)] Waiting until timeout for monitored process [2022-11-16 10:57:04,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 10:57:04,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:57:04,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 10:57:04,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:05,702 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 10:57:05,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:57:05,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:57:05,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926002311] [2022-11-16 10:57:05,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926002311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:57:05,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:57:05,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:57:05,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000575439] [2022-11-16 10:57:05,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:57:05,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:57:05,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:57:05,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:57:05,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:57:05,706 INFO L87 Difference]: Start difference. First operand 1801 states and 5608 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:57:05,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:57:05,859 INFO L93 Difference]: Finished difference Result 3434 states and 10713 transitions. [2022-11-16 10:57:05,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:57:05,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-11-16 10:57:05,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:57:05,875 INFO L225 Difference]: With dead ends: 3434 [2022-11-16 10:57:05,876 INFO L226 Difference]: Without dead ends: 2871 [2022-11-16 10:57:05,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:57:05,878 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:57:05,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 42 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 61 Unchecked, 0.1s Time] [2022-11-16 10:57:05,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2022-11-16 10:57:05,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 1965. [2022-11-16 10:57:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1963 states have (on average 3.1314314824248597) internal successors, (6147), 1964 states have internal predecessors, (6147), 0 states have call successors, (0), 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 10:57:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 6147 transitions. [2022-11-16 10:57:05,981 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 6147 transitions. Word has length 29 [2022-11-16 10:57:05,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:57:05,982 INFO L495 AbstractCegarLoop]: Abstraction has 1965 states and 6147 transitions. [2022-11-16 10:57:05,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:57:05,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 6147 transitions. [2022-11-16 10:57:05,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 10:57:05,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:57:05,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:57:06,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 (10)] Forceful destruction successful, exit code 0 [2022-11-16 10:57:06,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:06,208 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:57:06,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:57:06,209 INFO L85 PathProgramCache]: Analyzing trace with hash -875758376, now seen corresponding path program 3 times [2022-11-16 10:57:06,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:57:06,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500653666] [2022-11-16 10:57:06,210 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 10:57:06,210 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 10:57:06,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:57:06,211 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:06,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 (11)] Waiting until timeout for monitored process [2022-11-16 10:57:06,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-16 10:57:06,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:57:06,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-16 10:57:06,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:07,361 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 10:57:07,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:57:07,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:57:07,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500653666] [2022-11-16 10:57:07,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500653666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:57:07,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:57:07,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:57:07,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122324462] [2022-11-16 10:57:07,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:57:07,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:57:07,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:57:07,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:57:07,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:57:07,365 INFO L87 Difference]: Start difference. First operand 1965 states and 6147 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:57:07,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:57:07,646 INFO L93 Difference]: Finished difference Result 3445 states and 10764 transitions. [2022-11-16 10:57:07,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:57:07,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-11-16 10:57:07,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:57:07,662 INFO L225 Difference]: With dead ends: 3445 [2022-11-16 10:57:07,663 INFO L226 Difference]: Without dead ends: 3126 [2022-11-16 10:57:07,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:57:07,664 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:57:07,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 41 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 56 Unchecked, 0.2s Time] [2022-11-16 10:57:07,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3126 states. [2022-11-16 10:57:07,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3126 to 1925. [2022-11-16 10:57:07,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1923 states have (on average 3.12792511700468) internal successors, (6015), 1924 states have internal predecessors, (6015), 0 states have call successors, (0), 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 10:57:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 6015 transitions. [2022-11-16 10:57:07,745 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 6015 transitions. Word has length 29 [2022-11-16 10:57:07,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:57:07,746 INFO L495 AbstractCegarLoop]: Abstraction has 1925 states and 6015 transitions. [2022-11-16 10:57:07,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:57:07,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 6015 transitions. [2022-11-16 10:57:07,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 10:57:07,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:57:07,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:57:07,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 (11)] Forceful destruction successful, exit code 0 [2022-11-16 10:57:07,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:07,970 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:57:07,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:57:07,971 INFO L85 PathProgramCache]: Analyzing trace with hash -185934460, now seen corresponding path program 4 times [2022-11-16 10:57:07,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:57:07,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858354276] [2022-11-16 10:57:07,971 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 10:57:07,972 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 10:57:07,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:57:07,974 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:07,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 (12)] Waiting until timeout for monitored process [2022-11-16 10:57:08,300 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 10:57:08,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:57:08,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-16 10:57:08,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:09,020 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 10:57:09,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:57:09,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:57:09,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858354276] [2022-11-16 10:57:09,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858354276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:57:09,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:57:09,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:57:09,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707003651] [2022-11-16 10:57:09,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:57:09,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:57:09,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:57:09,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:57:09,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:57:09,023 INFO L87 Difference]: Start difference. First operand 1925 states and 6015 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:57:09,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:57:09,294 INFO L93 Difference]: Finished difference Result 3502 states and 10954 transitions. [2022-11-16 10:57:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:57:09,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-11-16 10:57:09,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:57:09,307 INFO L225 Difference]: With dead ends: 3502 [2022-11-16 10:57:09,307 INFO L226 Difference]: Without dead ends: 3023 [2022-11-16 10:57:09,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:57:09,308 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:57:09,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 42 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2022-11-16 10:57:09,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2022-11-16 10:57:09,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 1897. [2022-11-16 10:57:09,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1895 states have (on average 3.1282321899736147) internal successors, (5928), 1896 states have internal predecessors, (5928), 0 states have call successors, (0), 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 10:57:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 5928 transitions. [2022-11-16 10:57:09,380 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 5928 transitions. Word has length 29 [2022-11-16 10:57:09,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:57:09,381 INFO L495 AbstractCegarLoop]: Abstraction has 1897 states and 5928 transitions. [2022-11-16 10:57:09,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:57:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 5928 transitions. [2022-11-16 10:57:09,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 10:57:09,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:57:09,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:57:09,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 (12)] Forceful destruction successful, exit code 0 [2022-11-16 10:57:09,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:09,602 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:57:09,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:57:09,603 INFO L85 PathProgramCache]: Analyzing trace with hash 861205426, now seen corresponding path program 5 times [2022-11-16 10:57:09,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:57:09,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377043184] [2022-11-16 10:57:09,603 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 10:57:09,603 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 10:57:09,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:57:09,605 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:09,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 (13)] Waiting until timeout for monitored process [2022-11-16 10:57:09,865 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 10:57:09,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:57:09,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 10:57:09,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:10,665 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 10:57:10,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:57:10,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:57:10,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377043184] [2022-11-16 10:57:10,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377043184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:57:10,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:57:10,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:57:10,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514206262] [2022-11-16 10:57:10,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:57:10,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 10:57:10,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:57:10,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 10:57:10,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:57:10,670 INFO L87 Difference]: Start difference. First operand 1897 states and 5928 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:57:10,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:57:10,804 INFO L93 Difference]: Finished difference Result 3644 states and 11410 transitions. [2022-11-16 10:57:10,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 10:57:10,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-11-16 10:57:10,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:57:10,819 INFO L225 Difference]: With dead ends: 3644 [2022-11-16 10:57:10,819 INFO L226 Difference]: Without dead ends: 3073 [2022-11-16 10:57:10,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 10:57:10,820 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:57:10,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 42 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 63 Unchecked, 0.1s Time] [2022-11-16 10:57:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073 states. [2022-11-16 10:57:10,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073 to 1901. [2022-11-16 10:57:10,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1899 states have (on average 3.1279620853080567) internal successors, (5940), 1900 states have internal predecessors, (5940), 0 states have call successors, (0), 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 10:57:10,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 5940 transitions. [2022-11-16 10:57:10,929 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 5940 transitions. Word has length 29 [2022-11-16 10:57:10,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:57:10,930 INFO L495 AbstractCegarLoop]: Abstraction has 1901 states and 5940 transitions. [2022-11-16 10:57:10,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:57:10,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 5940 transitions. [2022-11-16 10:57:10,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 10:57:10,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:57:10,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:57:10,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 (13)] Forceful destruction successful, exit code 0 [2022-11-16 10:57:11,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:11,151 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:57:11,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:57:11,152 INFO L85 PathProgramCache]: Analyzing trace with hash 136106413, now seen corresponding path program 2 times [2022-11-16 10:57:11,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:57:11,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347881839] [2022-11-16 10:57:11,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 10:57:11,153 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 10:57:11,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:57:11,155 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:11,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 (14)] Waiting until timeout for monitored process [2022-11-16 10:57:11,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 10:57:11,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:57:11,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 10:57:11,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:11,626 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 10:57:11,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:57:11,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:57:11,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347881839] [2022-11-16 10:57:11,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347881839] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:57:11,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:57:11,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 10:57:11,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982066150] [2022-11-16 10:57:11,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:57:11,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 10:57:11,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:57:11,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 10:57:11,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 10:57:11,628 INFO L87 Difference]: Start difference. First operand 1901 states and 5940 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:57:12,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:57:12,197 INFO L93 Difference]: Finished difference Result 3083 states and 9300 transitions. [2022-11-16 10:57:12,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 10:57:12,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-11-16 10:57:12,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:57:12,208 INFO L225 Difference]: With dead ends: 3083 [2022-11-16 10:57:12,208 INFO L226 Difference]: Without dead ends: 2936 [2022-11-16 10:57:12,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 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 10:57:12,209 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 63 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 10:57:12,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 52 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 10:57:12,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2022-11-16 10:57:12,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 2079. [2022-11-16 10:57:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 2077 states have (on average 3.1194029850746268) internal successors, (6479), 2078 states have internal predecessors, (6479), 0 states have call successors, (0), 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 10:57:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 6479 transitions. [2022-11-16 10:57:12,288 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 6479 transitions. Word has length 29 [2022-11-16 10:57:12,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:57:12,288 INFO L495 AbstractCegarLoop]: Abstraction has 2079 states and 6479 transitions. [2022-11-16 10:57:12,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:57:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 6479 transitions. [2022-11-16 10:57:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 10:57:12,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:57:12,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:57:12,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 (14)] Forceful destruction successful, exit code 0 [2022-11-16 10:57:12,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:12,511 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:57:12,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:57:12,511 INFO L85 PathProgramCache]: Analyzing trace with hash -526327537, now seen corresponding path program 3 times [2022-11-16 10:57:12,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:57:12,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495624729] [2022-11-16 10:57:12,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 10:57:12,512 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 10:57:12,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:57:12,514 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:12,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 (15)] Waiting until timeout for monitored process [2022-11-16 10:57:12,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-16 10:57:12,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:57:12,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 10:57:12,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:13,157 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 10:57:13,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:57:13,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:57:13,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495624729] [2022-11-16 10:57:13,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495624729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:57:13,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:57:13,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 10:57:13,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775931150] [2022-11-16 10:57:13,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:57:13,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 10:57:13,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:57:13,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 10:57:13,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 10:57:13,159 INFO L87 Difference]: Start difference. First operand 2079 states and 6479 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:57:13,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:57:13,739 INFO L93 Difference]: Finished difference Result 2943 states and 8746 transitions. [2022-11-16 10:57:13,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 10:57:13,740 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-11-16 10:57:13,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:57:13,748 INFO L225 Difference]: With dead ends: 2943 [2022-11-16 10:57:13,748 INFO L226 Difference]: Without dead ends: 2775 [2022-11-16 10:57:13,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-16 10:57:13,749 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 83 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 10:57:13,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 51 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 10:57:13,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2775 states. [2022-11-16 10:57:13,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2775 to 2043. [2022-11-16 10:57:13,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2043 states, 2041 states have (on average 3.0979911807937284) internal successors, (6323), 2042 states have internal predecessors, (6323), 0 states have call successors, (0), 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 10:57:13,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 6323 transitions. [2022-11-16 10:57:13,816 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 6323 transitions. Word has length 29 [2022-11-16 10:57:13,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:57:13,816 INFO L495 AbstractCegarLoop]: Abstraction has 2043 states and 6323 transitions. [2022-11-16 10:57:13,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:57:13,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 6323 transitions. [2022-11-16 10:57:13,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 10:57:13,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:57:13,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:57:13,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 (15)] Forceful destruction successful, exit code 0 [2022-11-16 10:57:14,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:14,038 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:57:14,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:57:14,039 INFO L85 PathProgramCache]: Analyzing trace with hash 796330449, now seen corresponding path program 4 times [2022-11-16 10:57:14,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:57:14,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579909385] [2022-11-16 10:57:14,039 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 10:57:14,039 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 10:57:14,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:57:14,040 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:14,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 (16)] Waiting until timeout for monitored process [2022-11-16 10:57:14,197 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 10:57:14,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:57:14,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 10:57:14,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:14,237 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 10:57:14,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:57:14,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:57:14,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579909385] [2022-11-16 10:57:14,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579909385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:57:14,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:57:14,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 10:57:14,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456467036] [2022-11-16 10:57:14,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:57:14,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:57:14,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:57:14,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:57:14,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:57:14,240 INFO L87 Difference]: Start difference. First operand 2043 states and 6323 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:57:14,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:57:14,445 INFO L93 Difference]: Finished difference Result 2838 states and 8669 transitions. [2022-11-16 10:57:14,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 10:57:14,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-11-16 10:57:14,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:57:14,451 INFO L225 Difference]: With dead ends: 2838 [2022-11-16 10:57:14,451 INFO L226 Difference]: Without dead ends: 2535 [2022-11-16 10:57:14,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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 10:57:14,452 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 10:57:14,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 14 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 10:57:14,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2022-11-16 10:57:14,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 1840. [2022-11-16 10:57:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1838 states have (on average 3.08759521218716) internal successors, (5675), 1839 states have internal predecessors, (5675), 0 states have call successors, (0), 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 10:57:14,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 5675 transitions. [2022-11-16 10:57:14,506 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 5675 transitions. Word has length 29 [2022-11-16 10:57:14,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:57:14,507 INFO L495 AbstractCegarLoop]: Abstraction has 1840 states and 5675 transitions. [2022-11-16 10:57:14,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:57:14,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 5675 transitions. [2022-11-16 10:57:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 10:57:14,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:57:14,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:57:14,531 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 (16)] Ended with exit code 0 [2022-11-16 10:57:14,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:14,726 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:57:14,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:57:14,727 INFO L85 PathProgramCache]: Analyzing trace with hash -607954633, now seen corresponding path program 5 times [2022-11-16 10:57:14,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:57:14,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739651348] [2022-11-16 10:57:14,727 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 10:57:14,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 10:57:14,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:57:14,730 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:14,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 (17)] Waiting until timeout for monitored process [2022-11-16 10:57:14,876 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 10:57:14,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:57:14,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 10:57:14,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:57:15,567 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 10:57:15,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 10:57:15,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 10:57:15,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739651348] [2022-11-16 10:57:15,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739651348] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:57:15,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:57:15,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 10:57:15,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249257790] [2022-11-16 10:57:15,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:57:15,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 10:57:15,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 10:57:15,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 10:57:15,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-16 10:57:15,571 INFO L87 Difference]: Start difference. First operand 1840 states and 5675 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:57:16,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:57:16,210 INFO L93 Difference]: Finished difference Result 2108 states and 6365 transitions. [2022-11-16 10:57:16,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 10:57:16,211 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-11-16 10:57:16,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:57:16,215 INFO L225 Difference]: With dead ends: 2108 [2022-11-16 10:57:16,216 INFO L226 Difference]: Without dead ends: 1873 [2022-11-16 10:57:16,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-11-16 10:57:16,216 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 67 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 10:57:16,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 63 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 10:57:16,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2022-11-16 10:57:16,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1412. [2022-11-16 10:57:16,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1410 states have (on average 3.071631205673759) internal successors, (4331), 1411 states have internal predecessors, (4331), 0 states have call successors, (0), 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 10:57:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 4331 transitions. [2022-11-16 10:57:16,283 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 4331 transitions. Word has length 29 [2022-11-16 10:57:16,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:57:16,283 INFO L495 AbstractCegarLoop]: Abstraction has 1412 states and 4331 transitions. [2022-11-16 10:57:16,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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 10:57:16,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 4331 transitions. [2022-11-16 10:57:16,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 10:57:16,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:57:16,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:57:16,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 (17)] Forceful destruction successful, exit code 0 [2022-11-16 10:57:16,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:16,495 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-16 10:57:16,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:57:16,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1295912411, now seen corresponding path program 6 times [2022-11-16 10:57:16,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 10:57:16,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238249477] [2022-11-16 10:57:16,496 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 10:57:16,496 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 10:57:16,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 10:57:16,497 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:16,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 (18)] Waiting until timeout for monitored process [2022-11-16 10:57:16,713 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-11-16 10:57:16,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-16 10:57:16,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 10:57:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 10:57:16,918 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-16 10:57:16,919 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 10:57:16,920 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-16 10:57:16,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-16 10:57:16,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-16 10:57:16,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-16 10:57:16,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-16 10:57:16,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-16 10:57:16,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-16 10:57:16,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-16 10:57:16,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-16 10:57:16,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-16 10:57:16,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-16 10:57:16,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-16 10:57:16,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-16 10:57:16,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-16 10:57:16,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-16 10:57:16,926 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-16 10:57:16,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 (18)] Forceful destruction successful, exit code 0 [2022-11-16 10:57:17,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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 10:57:17,150 INFO L444 BasicCegarLoop]: Path program histogram: [6, 5, 1, 1, 1, 1, 1, 1] [2022-11-16 10:57:17,155 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 10:57:17,155 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 10:57:17,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 10:57:17 BasicIcfg [2022-11-16 10:57:17,286 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 10:57:17,287 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 10:57:17,287 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 10:57:17,287 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 10:57:17,288 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:56:41" (3/4) ... [2022-11-16 10:57:17,291 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 10:57:17,291 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 10:57:17,292 INFO L158 Benchmark]: Toolchain (without parser) took 37667.92ms. Allocated memory was 75.5MB in the beginning and 775.9MB in the end (delta: 700.4MB). Free memory was 57.5MB in the beginning and 483.8MB in the end (delta: -426.3MB). Peak memory consumption was 273.3MB. Max. memory is 16.1GB. [2022-11-16 10:57:17,293 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 75.5MB. Free memory is still 56.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 10:57:17,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 877.15ms. Allocated memory is still 75.5MB. Free memory was 57.2MB in the beginning and 44.5MB in the end (delta: 12.8MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2022-11-16 10:57:17,294 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.68ms. Allocated memory is still 75.5MB. Free memory was 44.5MB in the beginning and 41.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 10:57:17,295 INFO L158 Benchmark]: Boogie Preprocessor took 83.42ms. Allocated memory is still 75.5MB. Free memory was 41.9MB in the beginning and 39.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 10:57:17,295 INFO L158 Benchmark]: RCFGBuilder took 1230.77ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 39.5MB in the beginning and 65.9MB in the end (delta: -26.4MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2022-11-16 10:57:17,296 INFO L158 Benchmark]: TraceAbstraction took 35345.52ms. Allocated memory was 92.3MB in the beginning and 775.9MB in the end (delta: 683.7MB). Free memory was 65.4MB in the beginning and 483.8MB in the end (delta: -418.4MB). Peak memory consumption was 264.2MB. Max. memory is 16.1GB. [2022-11-16 10:57:17,296 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 775.9MB. Free memory is still 483.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 10:57:17,302 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.37ms. Allocated memory is still 75.5MB. Free memory is still 56.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 877.15ms. Allocated memory is still 75.5MB. Free memory was 57.2MB in the beginning and 44.5MB in the end (delta: 12.8MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.68ms. Allocated memory is still 75.5MB. Free memory was 44.5MB in the beginning and 41.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.42ms. Allocated memory is still 75.5MB. Free memory was 41.9MB in the beginning and 39.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1230.77ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 39.5MB in the beginning and 65.9MB in the end (delta: -26.4MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * TraceAbstraction took 35345.52ms. Allocated memory was 92.3MB in the beginning and 775.9MB in the end (delta: 683.7MB). Free memory was 65.4MB in the beginning and 483.8MB in the end (delta: -418.4MB). Peak memory consumption was 264.2MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 775.9MB. Free memory is still 483.8MB. 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: 12.0s, 161 PlacesBefore, 57 PlacesAfterwards, 150 TransitionsBefore, 45 TransitionsAfterwards, 3764 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 138 TotalNumberOfCompositions, 10992 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6305, independent: 6075, independent conditional: 0, independent unconditional: 6075, dependent: 230, dependent conditional: 0, dependent unconditional: 230, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2816, independent: 2757, independent conditional: 0, independent unconditional: 2757, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2816, independent: 2729, independent conditional: 0, independent unconditional: 2729, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 87, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 521, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 459, dependent conditional: 0, dependent unconditional: 459, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6305, independent: 3318, independent conditional: 0, independent unconditional: 3318, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 2816, unknown conditional: 0, unknown unconditional: 2816] , Statistics on independence cache: Total cache size (in pairs): 371, Positive cache size: 343, Positive conditional cache size: 0, Positive unconditional cache size: 343, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, 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: [L736] 0 _Bool a$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L720] 0 int a$mem_tmp; [L731] 0 _Bool a$read_delayed; [L712] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L727] 0 _Bool a$r_buff1_thd1; [L733] 0 int a$w_buff0; [L728] 0 _Bool a$r_buff1_thd2; [L735] 0 int a$w_buff1; [L719] 0 _Bool a$flush_delayed; [L726] 0 _Bool a$r_buff1_thd0; [L710] 0 int __unbuffered_cnt = 0; [L732] 0 int *a$read_delayed_var; [L738] 0 _Bool main$tmp_guard1; [L737] 0 _Bool main$tmp_guard0; [L734] 0 _Bool a$w_buff0_used; [L722] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd0; [L714] 0 int __unbuffered_p3_EAX = 0; [L724] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd4; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L864] 0 pthread_t t713; [L865] FCALL, FORK 0 pthread_create(&t713, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t713, ((void *)0), P0, ((void *)0))=0, t713={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=0] [L866] 0 pthread_t t714; [L867] FCALL, FORK 0 pthread_create(&t714, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t714, ((void *)0), P1, ((void *)0))=1, t713={3:0}, t714={-2147483641:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t715; [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L869] FCALL, FORK 0 pthread_create(&t715, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t715, ((void *)0), P2, ((void *)0))=2, t713={3:0}, t714={-2147483641:0}, t715={-2147483645:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L870] 0 pthread_t t716; [L871] FCALL, FORK 0 pthread_create(&t716, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t716, ((void *)0), P3, ((void *)0))=3, t713={3:0}, t714={-2147483641:0}, t715={-2147483645:0}, t716={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L820] 4 z = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=2] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=2] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t713={3:0}, t714={-2147483641:0}, t715={-2147483645:0}, t716={7:0}, weak$$choice0=2, weak$$choice2=0, x=2, y=1, z=2] [L884] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L886] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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=2, y=1, z=2] - 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: -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: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 869]: 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: 871]: 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: 867]: 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 9 procedures, 187 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 35.0s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.2s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 481 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 481 mSDsluCounter, 541 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 269 IncrementalHoareTripleChecker+Unchecked, 394 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2269 IncrementalHoareTripleChecker+Invalid, 2596 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 147 mSDtfsCounter, 2269 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6448occurred in iteration=0, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 7851 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 395 NumberOfCodeBlocks, 395 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 350 ConstructedInterpolants, 97 QuantifiedInterpolants, 7622 SizeOfPredicates, 21 NumberOfNonLiveVariables, 2771 ConjunctsInSsa, 172 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 10:57:17,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d4f24d9-a9ec-42e7-b707-754c5303307d/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