./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002.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_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 --- 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 11:36:46,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:36:46,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:36:46,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:36:46,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:36:46,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:36:46,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:36:46,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:36:46,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:36:46,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:36:46,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:36:46,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:36:46,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:36:46,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:36:46,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:36:46,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:36:46,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:36:46,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:36:46,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:36:46,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:36:46,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:36:46,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:36:46,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:36:46,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:36:46,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:36:46,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:36:46,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:36:46,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:36:46,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:36:46,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:36:46,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:36:46,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:36:46,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:36:46,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:36:46,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:36:46,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:36:46,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:36:46,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:36:46,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:36:46,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:36:46,549 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:36:46,551 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:36:46,582 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:36:46,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:36:46,583 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:36:46,583 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:36:46,584 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:36:46,585 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:36:46,586 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:36:46,586 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:36:46,586 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:36:46,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:36:46,587 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:36:46,588 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:36:46,588 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:36:46,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:36:46,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:36:46,589 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:36:46,590 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:36:46,590 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:36:46,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:36:46,591 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:36:46,591 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:36:46,591 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:36:46,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:36:46,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:36:46,593 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:36:46,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:36:46,593 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:36:46,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:36:46,594 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:36:46,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:36:46,595 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_4cc674ba-0321-445c-aff2-2d11ca9f9820/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_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 -> e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 [2022-11-16 11:36:46,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:36:46,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:36:46,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:36:46,957 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:36:46,963 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:36:46,964 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2022-11-16 11:36:47,050 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/data/b9db3ecb3/e0c3b76238684a28bf348610d1496f46/FLAGb0b17a475 [2022-11-16 11:36:47,746 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:36:47,747 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2022-11-16 11:36:47,769 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/data/b9db3ecb3/e0c3b76238684a28bf348610d1496f46/FLAGb0b17a475 [2022-11-16 11:36:48,029 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/data/b9db3ecb3/e0c3b76238684a28bf348610d1496f46 [2022-11-16 11:36:48,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:36:48,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:36:48,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:36:48,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:36:48,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:36:48,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:36:48" (1/1) ... [2022-11-16 11:36:48,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19e8885c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:48, skipping insertion in model container [2022-11-16 11:36:48,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:36:48" (1/1) ... [2022-11-16 11:36:48,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:36:48,136 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:36:48,393 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_4cc674ba-0321-445c-aff2-2d11ca9f9820/sv-benchmarks/c/pthread-wmm/mix002.oepc.i[945,958] [2022-11-16 11:36:48,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:36:48,646 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:36:48,666 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_4cc674ba-0321-445c-aff2-2d11ca9f9820/sv-benchmarks/c/pthread-wmm/mix002.oepc.i[945,958] [2022-11-16 11:36:48,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:36:48,841 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:36:48,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:48 WrapperNode [2022-11-16 11:36:48,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:36:48,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:36:48,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:36:48,847 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:36:48,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:48" (1/1) ... [2022-11-16 11:36:48,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:48" (1/1) ... [2022-11-16 11:36:48,944 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2022-11-16 11:36:48,950 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:36:48,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:36:48,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:36:48,952 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:36:48,962 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:48" (1/1) ... [2022-11-16 11:36:48,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:48" (1/1) ... [2022-11-16 11:36:48,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:48" (1/1) ... [2022-11-16 11:36:48,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:48" (1/1) ... [2022-11-16 11:36:48,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:48" (1/1) ... [2022-11-16 11:36:48,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:48" (1/1) ... [2022-11-16 11:36:48,985 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:48" (1/1) ... [2022-11-16 11:36:48,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:48" (1/1) ... [2022-11-16 11:36:48,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:36:48,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:36:48,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:36:48,993 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:36:49,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:48" (1/1) ... [2022-11-16 11:36:49,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:36:49,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:36:49,049 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:36:49,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:36:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:36:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:36:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:36:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:36:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:36:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:36:49,106 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:36:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:36:49,106 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:36:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:36:49,106 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:36:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:36:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:36:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:36:49,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:36:49,109 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 11:36:49,300 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:36:49,303 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:36:49,963 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:36:50,261 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:36:50,261 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:36:50,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:36:50 BoogieIcfgContainer [2022-11-16 11:36:50,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:36:50,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:36:50,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:36:50,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:36:50,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:36:48" (1/3) ... [2022-11-16 11:36:50,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22932599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:36:50, skipping insertion in model container [2022-11-16 11:36:50,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:36:48" (2/3) ... [2022-11-16 11:36:50,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22932599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:36:50, skipping insertion in model container [2022-11-16 11:36:50,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:36:50" (3/3) ... [2022-11-16 11:36:50,289 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.oepc.i [2022-11-16 11:36:50,319 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:36:50,320 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-16 11:36:50,320 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:36:50,426 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:36:50,498 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:36:50,523 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 134 transitions, 283 flow [2022-11-16 11:36:50,526 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 134 transitions, 283 flow [2022-11-16 11:36:50,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 134 transitions, 283 flow [2022-11-16 11:36:50,594 INFO L130 PetriNetUnfolder]: 2/131 cut-off events. [2022-11-16 11:36:50,594 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:36:50,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-11-16 11:36:50,604 INFO L119 LiptonReduction]: Number of co-enabled transitions 2824 [2022-11-16 11:36:57,810 INFO L134 LiptonReduction]: Checked pairs total: 8308 [2022-11-16 11:36:57,810 INFO L136 LiptonReduction]: Total number of compositions: 135 [2022-11-16 11:36:57,831 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 38 transitions, 91 flow [2022-11-16 11:36:58,004 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1784 states, 1769 states have (on average 3.427925381571509) internal successors, (6064), 1783 states have internal predecessors, (6064), 0 states have call successors, (0), 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 11:36:58,032 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:36:58,038 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;@3478750b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:36:58,039 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-16 11:36:58,047 INFO L276 IsEmpty]: Start isEmpty. Operand has 1784 states, 1769 states have (on average 3.427925381571509) internal successors, (6064), 1783 states have internal predecessors, (6064), 0 states have call successors, (0), 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 11:36:58,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 11:36:58,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:58,054 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 11:36:58,055 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:36:58,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:58,062 INFO L85 PathProgramCache]: Analyzing trace with hash 576, now seen corresponding path program 1 times [2022-11-16 11:36:58,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:58,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910188755] [2022-11-16 11:36:58,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:58,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:58,200 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 11:36:58,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:58,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910188755] [2022-11-16 11:36:58,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910188755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:58,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:58,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 11:36:58,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362072765] [2022-11-16 11:36:58,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:58,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:36:58,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:58,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:36:58,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:36:58,258 INFO L87 Difference]: Start difference. First operand has 1784 states, 1769 states have (on average 3.427925381571509) internal successors, (6064), 1783 states have internal predecessors, (6064), 0 states have call successors, (0), 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 11:36:58,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:58,433 INFO L93 Difference]: Finished difference Result 1684 states and 5558 transitions. [2022-11-16 11:36:58,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:36:58,436 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 11:36:58,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:36:58,481 INFO L225 Difference]: With dead ends: 1684 [2022-11-16 11:36:58,482 INFO L226 Difference]: Without dead ends: 1684 [2022-11-16 11:36:58,483 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 11:36:58,489 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:36:58,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:36:58,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2022-11-16 11:36:58,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2022-11-16 11:36:58,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1679 states have (on average 3.310303752233472) internal successors, (5558), 1683 states have internal predecessors, (5558), 0 states have call successors, (0), 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 11:36:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 5558 transitions. [2022-11-16 11:36:58,705 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 5558 transitions. Word has length 1 [2022-11-16 11:36:58,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:36:58,706 INFO L495 AbstractCegarLoop]: Abstraction has 1684 states and 5558 transitions. [2022-11-16 11:36:58,707 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 11:36:58,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 5558 transitions. [2022-11-16 11:36:58,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 11:36:58,708 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:58,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 11:36:58,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:36:58,709 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:36:58,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:58,710 INFO L85 PathProgramCache]: Analyzing trace with hash 565749, now seen corresponding path program 1 times [2022-11-16 11:36:58,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:58,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694759383] [2022-11-16 11:36:58,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:58,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:59,207 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 11:36:59,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:59,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694759383] [2022-11-16 11:36:59,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694759383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:59,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:59,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:36:59,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521771710] [2022-11-16 11:36:59,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:59,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:36:59,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:59,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:36:59,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:36:59,218 INFO L87 Difference]: Start difference. First operand 1684 states and 5558 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 11:36:59,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:36:59,401 INFO L93 Difference]: Finished difference Result 1418 states and 4632 transitions. [2022-11-16 11:36:59,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:36:59,402 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 11:36:59,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:36:59,415 INFO L225 Difference]: With dead ends: 1418 [2022-11-16 11:36:59,415 INFO L226 Difference]: Without dead ends: 1382 [2022-11-16 11:36:59,417 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 11:36:59,424 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:36:59,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 8 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:36:59,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2022-11-16 11:36:59,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1382. [2022-11-16 11:36:59,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 1380 states have (on average 3.2869565217391306) internal successors, (4536), 1381 states have internal predecessors, (4536), 0 states have call successors, (0), 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 11:36:59,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 4536 transitions. [2022-11-16 11:36:59,501 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 4536 transitions. Word has length 3 [2022-11-16 11:36:59,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:36:59,502 INFO L495 AbstractCegarLoop]: Abstraction has 1382 states and 4536 transitions. [2022-11-16 11:36:59,502 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 11:36:59,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 4536 transitions. [2022-11-16 11:36:59,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 11:36:59,506 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:36:59,506 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:59,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:36:59,507 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:36:59,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:59,508 INFO L85 PathProgramCache]: Analyzing trace with hash -556120754, now seen corresponding path program 1 times [2022-11-16 11:36:59,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:59,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585642275] [2022-11-16 11:36:59,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:59,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:59,840 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 11:36:59,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:59,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585642275] [2022-11-16 11:36:59,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585642275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:59,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:59,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:36:59,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082827884] [2022-11-16 11:36:59,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:59,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:36:59,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:59,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:36:59,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:36:59,844 INFO L87 Difference]: Start difference. First operand 1382 states and 4536 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:00,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:00,072 INFO L93 Difference]: Finished difference Result 1790 states and 5744 transitions. [2022-11-16 11:37:00,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:37:00,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-16 11:37:00,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:00,089 INFO L225 Difference]: With dead ends: 1790 [2022-11-16 11:37:00,089 INFO L226 Difference]: Without dead ends: 1790 [2022-11-16 11:37:00,090 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 11:37:00,094 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:00,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 12 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:37:00,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2022-11-16 11:37:00,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1582. [2022-11-16 11:37:00,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1580 states have (on average 3.3088607594936708) internal successors, (5228), 1581 states have internal predecessors, (5228), 0 states have call successors, (0), 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 11:37:00,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 5228 transitions. [2022-11-16 11:37:00,199 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 5228 transitions. Word has length 10 [2022-11-16 11:37:00,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:00,200 INFO L495 AbstractCegarLoop]: Abstraction has 1582 states and 5228 transitions. [2022-11-16 11:37:00,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 5228 transitions. [2022-11-16 11:37:00,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 11:37:00,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:00,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:00,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:37:00,207 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:00,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:00,207 INFO L85 PathProgramCache]: Analyzing trace with hash -556120690, now seen corresponding path program 1 times [2022-11-16 11:37:00,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:00,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558797973] [2022-11-16 11:37:00,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:00,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:00,848 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 11:37:00,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:00,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558797973] [2022-11-16 11:37:00,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558797973] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:00,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:00,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:37:00,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385390065] [2022-11-16 11:37:00,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:00,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:37:00,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:00,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:37:00,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:37:00,859 INFO L87 Difference]: Start difference. First operand 1582 states and 5228 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:01,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:01,202 INFO L93 Difference]: Finished difference Result 2254 states and 7134 transitions. [2022-11-16 11:37:01,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:37:01,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-16 11:37:01,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:01,221 INFO L225 Difference]: With dead ends: 2254 [2022-11-16 11:37:01,221 INFO L226 Difference]: Without dead ends: 2038 [2022-11-16 11:37:01,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:37:01,223 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 46 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:01,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 29 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:37:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2022-11-16 11:37:01,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 1894. [2022-11-16 11:37:01,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1892 states have (on average 3.2970401691331923) internal successors, (6238), 1893 states have internal predecessors, (6238), 0 states have call successors, (0), 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 11:37:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 6238 transitions. [2022-11-16 11:37:01,335 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 6238 transitions. Word has length 10 [2022-11-16 11:37:01,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:01,335 INFO L495 AbstractCegarLoop]: Abstraction has 1894 states and 6238 transitions. [2022-11-16 11:37:01,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:01,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 6238 transitions. [2022-11-16 11:37:01,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:37:01,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:01,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:01,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:37:01,342 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:01,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:01,342 INFO L85 PathProgramCache]: Analyzing trace with hash 523173245, now seen corresponding path program 1 times [2022-11-16 11:37:01,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:01,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774108081] [2022-11-16 11:37:01,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:01,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:01,613 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 11:37:01,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:01,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774108081] [2022-11-16 11:37:01,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774108081] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:01,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:01,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:37:01,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280133504] [2022-11-16 11:37:01,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:01,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:37:01,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:01,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:37:01,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:37:01,622 INFO L87 Difference]: Start difference. First operand 1894 states and 6238 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:01,881 INFO L93 Difference]: Finished difference Result 1958 states and 6310 transitions. [2022-11-16 11:37:01,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:37:01,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 11:37:01,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:01,899 INFO L225 Difference]: With dead ends: 1958 [2022-11-16 11:37:01,899 INFO L226 Difference]: Without dead ends: 1766 [2022-11-16 11:37:01,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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 11:37:01,900 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 44 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:01,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 18 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:37:01,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2022-11-16 11:37:01,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1766. [2022-11-16 11:37:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1764 states have (on average 3.2732426303854876) internal successors, (5774), 1765 states have internal predecessors, (5774), 0 states have call successors, (0), 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 11:37:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 5774 transitions. [2022-11-16 11:37:01,985 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 5774 transitions. Word has length 12 [2022-11-16 11:37:01,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:01,985 INFO L495 AbstractCegarLoop]: Abstraction has 1766 states and 5774 transitions. [2022-11-16 11:37:01,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:01,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 5774 transitions. [2022-11-16 11:37:01,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:37:01,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:02,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:02,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:37:02,010 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:02,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:02,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1856908857, now seen corresponding path program 1 times [2022-11-16 11:37:02,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:02,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116280356] [2022-11-16 11:37:02,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:02,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:02,235 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 11:37:02,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:02,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116280356] [2022-11-16 11:37:02,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116280356] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:02,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:02,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:37:02,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357864174] [2022-11-16 11:37:02,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:02,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:37:02,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:02,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:37:02,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:37:02,238 INFO L87 Difference]: Start difference. First operand 1766 states and 5774 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:02,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:02,454 INFO L93 Difference]: Finished difference Result 2006 states and 6322 transitions. [2022-11-16 11:37:02,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:37:02,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 11:37:02,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:02,468 INFO L225 Difference]: With dead ends: 2006 [2022-11-16 11:37:02,469 INFO L226 Difference]: Without dead ends: 1862 [2022-11-16 11:37:02,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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 11:37:02,470 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 43 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:02,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 16 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:37:02,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2022-11-16 11:37:02,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1766. [2022-11-16 11:37:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1764 states have (on average 3.2324263038548753) internal successors, (5702), 1765 states have internal predecessors, (5702), 0 states have call successors, (0), 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 11:37:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 5702 transitions. [2022-11-16 11:37:02,550 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 5702 transitions. Word has length 12 [2022-11-16 11:37:02,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:02,551 INFO L495 AbstractCegarLoop]: Abstraction has 1766 states and 5702 transitions. [2022-11-16 11:37:02,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 5702 transitions. [2022-11-16 11:37:02,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:37:02,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:02,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:02,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:37:02,554 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:02,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:02,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1886523143, now seen corresponding path program 1 times [2022-11-16 11:37:02,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:02,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104599511] [2022-11-16 11:37:02,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:02,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:03,112 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 11:37:03,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:03,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104599511] [2022-11-16 11:37:03,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104599511] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:03,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:03,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:37:03,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509854962] [2022-11-16 11:37:03,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:03,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:37:03,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:03,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:37:03,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:37:03,115 INFO L87 Difference]: Start difference. First operand 1766 states and 5702 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 11:37:03,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:03,329 INFO L93 Difference]: Finished difference Result 1622 states and 5114 transitions. [2022-11-16 11:37:03,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:37:03,330 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 11:37:03,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:03,341 INFO L225 Difference]: With dead ends: 1622 [2022-11-16 11:37:03,341 INFO L226 Difference]: Without dead ends: 1478 [2022-11-16 11:37:03,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:37:03,342 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 57 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:03,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 25 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:37:03,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2022-11-16 11:37:03,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 926. [2022-11-16 11:37:03,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 925 states have (on average 3.1437837837837836) internal successors, (2908), 925 states have internal predecessors, (2908), 0 states have call successors, (0), 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 11:37:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 2908 transitions. [2022-11-16 11:37:03,394 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 2908 transitions. Word has length 12 [2022-11-16 11:37:03,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:03,395 INFO L495 AbstractCegarLoop]: Abstraction has 926 states and 2908 transitions. [2022-11-16 11:37:03,395 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 11:37:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 2908 transitions. [2022-11-16 11:37:03,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:37:03,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:03,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:03,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:37:03,398 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:03,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:03,399 INFO L85 PathProgramCache]: Analyzing trace with hash 193432539, now seen corresponding path program 1 times [2022-11-16 11:37:03,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:03,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560848722] [2022-11-16 11:37:03,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:03,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:03,545 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 11:37:03,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:03,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560848722] [2022-11-16 11:37:03,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560848722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:03,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:03,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:37:03,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094146581] [2022-11-16 11:37:03,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:03,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:37:03,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:03,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:37:03,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:37:03,549 INFO L87 Difference]: Start difference. First operand 926 states and 2908 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 11:37:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:03,709 INFO L93 Difference]: Finished difference Result 958 states and 2940 transitions. [2022-11-16 11:37:03,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:37:03,710 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 11:37:03,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:03,717 INFO L225 Difference]: With dead ends: 958 [2022-11-16 11:37:03,717 INFO L226 Difference]: Without dead ends: 862 [2022-11-16 11:37:03,717 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 11:37:03,720 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 25 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:03,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 16 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:37:03,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2022-11-16 11:37:03,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 862. [2022-11-16 11:37:03,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 861 states have (on average 3.1173054587688735) internal successors, (2684), 861 states have internal predecessors, (2684), 0 states have call successors, (0), 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 11:37:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 2684 transitions. [2022-11-16 11:37:03,756 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 2684 transitions. Word has length 14 [2022-11-16 11:37:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:03,757 INFO L495 AbstractCegarLoop]: Abstraction has 862 states and 2684 transitions. [2022-11-16 11:37:03,757 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 11:37:03,757 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 2684 transitions. [2022-11-16 11:37:03,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:37:03,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:03,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:03,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:37:03,760 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:03,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:03,761 INFO L85 PathProgramCache]: Analyzing trace with hash 626431114, now seen corresponding path program 1 times [2022-11-16 11:37:03,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:03,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206708700] [2022-11-16 11:37:03,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:03,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:03,959 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 11:37:03,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:03,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206708700] [2022-11-16 11:37:03,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206708700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:03,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:03,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:37:03,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762008433] [2022-11-16 11:37:03,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:03,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:37:03,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:03,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:37:03,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:37:03,968 INFO L87 Difference]: Start difference. First operand 862 states and 2684 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 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 11:37:04,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:04,050 INFO L93 Difference]: Finished difference Result 558 states and 1468 transitions. [2022-11-16 11:37:04,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:37:04,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 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 11:37:04,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:04,054 INFO L225 Difference]: With dead ends: 558 [2022-11-16 11:37:04,054 INFO L226 Difference]: Without dead ends: 558 [2022-11-16 11:37:04,054 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 11:37:04,056 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:04,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 8 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:37:04,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-11-16 11:37:04,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2022-11-16 11:37:04,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 2.6355475763016156) internal successors, (1468), 557 states have internal predecessors, (1468), 0 states have call successors, (0), 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 11:37:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1468 transitions. [2022-11-16 11:37:04,076 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1468 transitions. Word has length 16 [2022-11-16 11:37:04,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:04,077 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 1468 transitions. [2022-11-16 11:37:04,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 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 11:37:04,077 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1468 transitions. [2022-11-16 11:37:04,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-16 11:37:04,079 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:04,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:04,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:37:04,079 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:04,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:04,080 INFO L85 PathProgramCache]: Analyzing trace with hash -226292600, now seen corresponding path program 1 times [2022-11-16 11:37:04,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:04,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640027072] [2022-11-16 11:37:04,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:04,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:04,331 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 11:37:04,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:04,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640027072] [2022-11-16 11:37:04,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640027072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:04,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:04,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:37:04,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345534940] [2022-11-16 11:37:04,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:04,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:37:04,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:04,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:37:04,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:37:04,334 INFO L87 Difference]: Start difference. First operand 558 states and 1468 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:04,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:04,446 INFO L93 Difference]: Finished difference Result 354 states and 856 transitions. [2022-11-16 11:37:04,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:37:04,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-16 11:37:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:04,449 INFO L225 Difference]: With dead ends: 354 [2022-11-16 11:37:04,449 INFO L226 Difference]: Without dead ends: 354 [2022-11-16 11:37:04,449 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 11:37:04,450 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:04,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 12 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:37:04,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-11-16 11:37:04,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2022-11-16 11:37:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 2.424929178470255) internal successors, (856), 353 states have internal predecessors, (856), 0 states have call successors, (0), 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 11:37:04,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 856 transitions. [2022-11-16 11:37:04,462 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 856 transitions. Word has length 19 [2022-11-16 11:37:04,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:04,463 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 856 transitions. [2022-11-16 11:37:04,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:04,463 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 856 transitions. [2022-11-16 11:37:04,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:37:04,465 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:04,465 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] [2022-11-16 11:37:04,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:37:04,466 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:04,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:04,466 INFO L85 PathProgramCache]: Analyzing trace with hash -847094901, now seen corresponding path program 1 times [2022-11-16 11:37:04,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:04,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57275918] [2022-11-16 11:37:04,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:04,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:05,015 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 11:37:05,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:05,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57275918] [2022-11-16 11:37:05,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57275918] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:05,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:05,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:37:05,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78158162] [2022-11-16 11:37:05,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:05,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:37:05,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:05,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:37:05,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:37:05,018 INFO L87 Difference]: Start difference. First operand 354 states and 856 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:05,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:05,620 INFO L93 Difference]: Finished difference Result 624 states and 1472 transitions. [2022-11-16 11:37:05,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:37:05,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 11:37:05,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:05,624 INFO L225 Difference]: With dead ends: 624 [2022-11-16 11:37:05,624 INFO L226 Difference]: Without dead ends: 454 [2022-11-16 11:37:05,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:37:05,625 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 84 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:05,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 36 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:37:05,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-11-16 11:37:05,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 354. [2022-11-16 11:37:05,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 2.3342776203966005) internal successors, (824), 353 states have internal predecessors, (824), 0 states have call successors, (0), 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 11:37:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 824 transitions. [2022-11-16 11:37:05,639 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 824 transitions. Word has length 22 [2022-11-16 11:37:05,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:05,639 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 824 transitions. [2022-11-16 11:37:05,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 824 transitions. [2022-11-16 11:37:05,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:37:05,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:05,641 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] [2022-11-16 11:37:05,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:37:05,642 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:05,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:05,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1850774645, now seen corresponding path program 1 times [2022-11-16 11:37:05,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:05,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703425680] [2022-11-16 11:37:05,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:05,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:06,359 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 11:37:06,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:06,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703425680] [2022-11-16 11:37:06,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703425680] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:06,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:06,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:37:06,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709942624] [2022-11-16 11:37:06,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:06,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:37:06,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:06,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:37:06,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:37:06,363 INFO L87 Difference]: Start difference. First operand 354 states and 824 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:06,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:06,796 INFO L93 Difference]: Finished difference Result 588 states and 1314 transitions. [2022-11-16 11:37:06,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:37:06,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 11:37:06,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:06,800 INFO L225 Difference]: With dead ends: 588 [2022-11-16 11:37:06,801 INFO L226 Difference]: Without dead ends: 510 [2022-11-16 11:37:06,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:37:06,802 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 52 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:06,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 60 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:37:06,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-11-16 11:37:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 395. [2022-11-16 11:37:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 394 states have (on average 2.2918781725888326) internal successors, (903), 394 states have internal predecessors, (903), 0 states have call successors, (0), 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 11:37:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 903 transitions. [2022-11-16 11:37:06,820 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 903 transitions. Word has length 22 [2022-11-16 11:37:06,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:06,821 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 903 transitions. [2022-11-16 11:37:06,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 903 transitions. [2022-11-16 11:37:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:37:06,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:06,824 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] [2022-11-16 11:37:06,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:37:06,824 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:06,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:06,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1850917631, now seen corresponding path program 2 times [2022-11-16 11:37:06,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:06,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425491459] [2022-11-16 11:37:06,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:06,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:07,079 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 11:37:07,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:07,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425491459] [2022-11-16 11:37:07,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425491459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:07,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:07,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:37:07,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702832328] [2022-11-16 11:37:07,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:07,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:37:07,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:07,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:37:07,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:37:07,083 INFO L87 Difference]: Start difference. First operand 395 states and 903 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:07,201 INFO L93 Difference]: Finished difference Result 344 states and 801 transitions. [2022-11-16 11:37:07,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:37:07,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-16 11:37:07,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:07,203 INFO L225 Difference]: With dead ends: 344 [2022-11-16 11:37:07,204 INFO L226 Difference]: Without dead ends: 246 [2022-11-16 11:37:07,204 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 11:37:07,205 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 70 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:07,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 11 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:37:07,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-11-16 11:37:07,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-11-16 11:37:07,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 2.3183673469387753) internal successors, (568), 245 states have internal predecessors, (568), 0 states have call successors, (0), 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 11:37:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 568 transitions. [2022-11-16 11:37:07,213 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 568 transitions. Word has length 22 [2022-11-16 11:37:07,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:07,213 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 568 transitions. [2022-11-16 11:37:07,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:07,213 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 568 transitions. [2022-11-16 11:37:07,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 11:37:07,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:07,214 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 11:37:07,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:37:07,215 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:07,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:07,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1737794188, now seen corresponding path program 1 times [2022-11-16 11:37:07,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:07,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492365615] [2022-11-16 11:37:07,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:07,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:37:08,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:37:08,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492365615] [2022-11-16 11:37:08,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492365615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:08,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:08,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:37:08,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313396064] [2022-11-16 11:37:08,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:08,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:37:08,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:37:08,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:37:08,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:37:08,669 INFO L87 Difference]: Start difference. First operand 246 states and 568 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 11:37:09,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:09,004 INFO L93 Difference]: Finished difference Result 261 states and 591 transitions. [2022-11-16 11:37:09,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:37:09,005 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 11:37:09,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:09,006 INFO L225 Difference]: With dead ends: 261 [2022-11-16 11:37:09,006 INFO L226 Difference]: Without dead ends: 194 [2022-11-16 11:37:09,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:37:09,007 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 39 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:09,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 57 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:37:09,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-16 11:37:09,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 164. [2022-11-16 11:37:09,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 2.263803680981595) internal successors, (369), 163 states have internal predecessors, (369), 0 states have call successors, (0), 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 11:37:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 369 transitions. [2022-11-16 11:37:09,019 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 369 transitions. Word has length 25 [2022-11-16 11:37:09,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:09,019 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 369 transitions. [2022-11-16 11:37:09,020 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 11:37:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 369 transitions. [2022-11-16 11:37:09,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 11:37:09,021 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:09,021 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 11:37:09,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:37:09,022 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:09,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:09,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1108436016, now seen corresponding path program 2 times [2022-11-16 11:37:09,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:37:09,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927179323] [2022-11-16 11:37:09,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:09,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:37:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:37:09,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:37:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:37:09,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:37:09,253 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:37:09,254 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-16 11:37:09,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-16 11:37:09,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-16 11:37:09,257 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-16 11:37:09,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-16 11:37:09,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-16 11:37:09,258 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-16 11:37:09,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-16 11:37:09,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-16 11:37:09,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-16 11:37:09,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-16 11:37:09,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-16 11:37:09,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-16 11:37:09,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:37:09,264 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:09,271 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:37:09,271 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:37:09,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:37:09 BasicIcfg [2022-11-16 11:37:09,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:37:09,413 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:37:09,413 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:37:09,413 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:37:09,414 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:36:50" (3/4) ... [2022-11-16 11:37:09,417 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:37:09,418 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:37:09,418 INFO L158 Benchmark]: Toolchain (without parser) took 21381.94ms. Allocated memory was 111.1MB in the beginning and 257.9MB in the end (delta: 146.8MB). Free memory was 80.1MB in the beginning and 195.1MB in the end (delta: -114.9MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2022-11-16 11:37:09,419 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 111.1MB. Free memory was 62.3MB in the beginning and 62.2MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:37:09,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 806.95ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 79.8MB in the beginning and 96.5MB in the end (delta: -16.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 11:37:09,420 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.71ms. Allocated memory is still 134.2MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:37:09,421 INFO L158 Benchmark]: Boogie Preprocessor took 40.26ms. Allocated memory is still 134.2MB. Free memory was 94.0MB in the beginning and 92.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:37:09,422 INFO L158 Benchmark]: RCFGBuilder took 1275.91ms. Allocated memory is still 134.2MB. Free memory was 92.3MB in the beginning and 99.5MB in the end (delta: -7.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-16 11:37:09,422 INFO L158 Benchmark]: TraceAbstraction took 19141.84ms. Allocated memory was 134.2MB in the beginning and 257.9MB in the end (delta: 123.7MB). Free memory was 98.9MB in the beginning and 195.1MB in the end (delta: -96.2MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2022-11-16 11:37:09,422 INFO L158 Benchmark]: Witness Printer took 4.90ms. Allocated memory is still 257.9MB. Free memory is still 195.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:37:09,431 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.35ms. Allocated memory is still 111.1MB. Free memory was 62.3MB in the beginning and 62.2MB in the end (delta: 117.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 806.95ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 79.8MB in the beginning and 96.5MB in the end (delta: -16.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.71ms. Allocated memory is still 134.2MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.26ms. Allocated memory is still 134.2MB. Free memory was 94.0MB in the beginning and 92.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1275.91ms. Allocated memory is still 134.2MB. Free memory was 92.3MB in the beginning and 99.5MB in the end (delta: -7.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19141.84ms. Allocated memory was 134.2MB in the beginning and 257.9MB in the end (delta: 123.7MB). Free memory was 98.9MB in the beginning and 195.1MB in the end (delta: -96.2MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * Witness Printer took 4.90ms. Allocated memory is still 257.9MB. Free memory is still 195.1MB. 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.3s, 142 PlacesBefore, 47 PlacesAfterwards, 134 TransitionsBefore, 38 TransitionsAfterwards, 2824 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 69 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 135 TotalNumberOfCompositions, 8308 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4409, independent: 4197, independent conditional: 0, independent unconditional: 4197, dependent: 212, dependent conditional: 0, dependent unconditional: 212, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1928, independent: 1873, independent conditional: 0, independent unconditional: 1873, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1928, independent: 1853, independent conditional: 0, independent unconditional: 1853, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 367, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 328, dependent conditional: 0, dependent unconditional: 328, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4409, independent: 2324, independent conditional: 0, independent unconditional: 2324, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 1928, unknown conditional: 0, unknown unconditional: 1928] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 239, Positive conditional cache size: 0, Positive unconditional cache size: 239, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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: [L721] 0 int __unbuffered_p2_EBX = 0; [L739] 0 _Bool a$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L711] 0 int __unbuffered_p0_EAX = 0; [L725] 0 int a$mem_tmp; [L734] 0 _Bool a$read_delayed; [L715] 0 int __unbuffered_p1_EAX = 0; [L723] 0 int a = 0; [L733] 0 _Bool a$r_buff1_thd3; [L719] 0 int __unbuffered_p2_EAX = 0; [L731] 0 _Bool a$r_buff1_thd1; [L736] 0 int a$w_buff0; [L732] 0 _Bool a$r_buff1_thd2; [L738] 0 int a$w_buff1; [L724] 0 _Bool a$flush_delayed; [L730] 0 _Bool a$r_buff1_thd0; [L709] 0 int __unbuffered_cnt = 0; [L735] 0 int *a$read_delayed_var; [L713] 0 int __unbuffered_p0_EBX = 0; [L741] 0 _Bool main$tmp_guard1; [L740] 0 _Bool main$tmp_guard0; [L737] 0 _Bool a$w_buff0_used; [L717] 0 int __unbuffered_p1_EBX = 0; [L727] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd0; [L729] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff0_thd2; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L855] 0 pthread_t t38; [L856] FCALL, FORK 0 pthread_create(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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(&t38, ((void *)0), P0, ((void *)0))=-3, t38={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 a$w_buff1 = a$w_buff0 [L754] 1 a$w_buff0 = 1 [L755] 1 a$w_buff1_used = a$w_buff0_used [L756] 1 a$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L765] 1 x = 1 [L768] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L771] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L857] 0 pthread_t t39; [L858] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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(&t39, ((void *)0), P1, ((void *)0))=-2, t38={5:0}, t39={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L859] 0 pthread_t t40; [L860] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, pthread_create(&t40, ((void *)0), P2, ((void *)0))=-1, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, z=0] [L791] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, z=0] [L794] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=1, z=1] [L797] 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) [L798] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L799] 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 [L800] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=1, z=1] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L814] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 a$flush_delayed = weak$$choice2 [L820] 3 a$mem_tmp = a [L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = a [L829] 3 a = a$flush_delayed ? a$mem_tmp : a [L830] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=49, weak$$choice2=0, x=1, y=1, z=1] [L833] 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) [L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L835] 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 [L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L837] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=49, weak$$choice2=0, x=1, y=1, z=1] [L774] 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) [L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L776] 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 [L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L778] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=1, z=1] [L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 1 return 0; [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L842] 3 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 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) [L867] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L868] 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 [L869] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L870] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1] - 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: 853]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 856]: 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: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 165 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 18.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 548 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 548 mSDsluCounter, 312 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 214 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1795 IncrementalHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 98 mSDtfsCounter, 1795 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1894occurred in iteration=4, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 1245 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 1886 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 11:37:09,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 --- 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 11:37:12,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:37:12,185 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:37:12,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:37:12,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:37:12,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:37:12,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:37:12,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:37:12,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:37:12,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:37:12,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:37:12,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:37:12,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:37:12,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:37:12,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:37:12,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:37:12,251 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:37:12,258 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:37:12,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:37:12,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:37:12,272 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:37:12,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:37:12,277 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:37:12,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:37:12,284 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:37:12,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:37:12,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:37:12,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:37:12,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:37:12,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:37:12,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:37:12,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:37:12,302 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:37:12,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:37:12,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:37:12,309 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:37:12,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:37:12,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:37:12,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:37:12,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:37:12,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:37:12,317 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-16 11:37:12,361 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:37:12,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:37:12,363 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:37:12,363 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:37:12,365 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:37:12,365 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:37:12,367 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:37:12,367 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:37:12,367 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:37:12,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:37:12,369 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:37:12,370 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:37:12,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:37:12,370 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:37:12,370 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:37:12,371 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:37:12,371 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:37:12,371 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:37:12,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:37:12,372 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:37:12,372 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 11:37:12,372 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 11:37:12,372 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:37:12,373 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:37:12,373 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:37:12,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:37:12,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:37:12,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:37:12,374 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:37:12,374 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:37:12,375 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 11:37:12,375 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 11:37:12,375 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 11:37:12,376 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_4cc674ba-0321-445c-aff2-2d11ca9f9820/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_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 -> e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 [2022-11-16 11:37:12,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:37:12,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:37:12,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:37:12,922 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:37:12,925 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:37:12,927 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2022-11-16 11:37:13,019 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/data/3767f270d/3b4fbdcc894442f8a02cb456aab9a023/FLAG98ee46d04 [2022-11-16 11:37:13,826 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:37:13,830 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2022-11-16 11:37:13,852 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/data/3767f270d/3b4fbdcc894442f8a02cb456aab9a023/FLAG98ee46d04 [2022-11-16 11:37:13,993 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/data/3767f270d/3b4fbdcc894442f8a02cb456aab9a023 [2022-11-16 11:37:13,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:37:13,998 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:37:13,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:37:14,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:37:14,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:37:14,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:37:13" (1/1) ... [2022-11-16 11:37:14,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3972c3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:14, skipping insertion in model container [2022-11-16 11:37:14,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:37:13" (1/1) ... [2022-11-16 11:37:14,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:37:14,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:37:14,265 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_4cc674ba-0321-445c-aff2-2d11ca9f9820/sv-benchmarks/c/pthread-wmm/mix002.oepc.i[945,958] [2022-11-16 11:37:14,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:37:14,603 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:37:14,636 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_4cc674ba-0321-445c-aff2-2d11ca9f9820/sv-benchmarks/c/pthread-wmm/mix002.oepc.i[945,958] [2022-11-16 11:37:14,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:37:14,808 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:37:14,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:14 WrapperNode [2022-11-16 11:37:14,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:37:14,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:37:14,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:37:14,812 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:37:14,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:14" (1/1) ... [2022-11-16 11:37:14,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:14" (1/1) ... [2022-11-16 11:37:14,940 INFO L138 Inliner]: procedures = 179, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2022-11-16 11:37:14,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:37:14,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:37:14,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:37:14,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:37:14,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:14" (1/1) ... [2022-11-16 11:37:14,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:14" (1/1) ... [2022-11-16 11:37:14,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:14" (1/1) ... [2022-11-16 11:37:14,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:14" (1/1) ... [2022-11-16 11:37:14,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:14" (1/1) ... [2022-11-16 11:37:15,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:14" (1/1) ... [2022-11-16 11:37:15,014 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:14" (1/1) ... [2022-11-16 11:37:15,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:14" (1/1) ... [2022-11-16 11:37:15,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:37:15,022 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:37:15,022 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:37:15,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:37:15,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:14" (1/1) ... [2022-11-16 11:37:15,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:37:15,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:37:15,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:37:15,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:37:15,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:37:15,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:37:15,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:37:15,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:37:15,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-16 11:37:15,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 11:37:15,136 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:37:15,136 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:37:15,136 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:37:15,136 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:37:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:37:15,137 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:37:15,137 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:37:15,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:37:15,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:37:15,140 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 11:37:15,415 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:37:15,418 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:37:15,970 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:37:16,196 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:37:16,197 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:37:16,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:37:16 BoogieIcfgContainer [2022-11-16 11:37:16,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:37:16,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:37:16,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:37:16,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:37:16,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:37:13" (1/3) ... [2022-11-16 11:37:16,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a56493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:37:16, skipping insertion in model container [2022-11-16 11:37:16,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:37:14" (2/3) ... [2022-11-16 11:37:16,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a56493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:37:16, skipping insertion in model container [2022-11-16 11:37:16,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:37:16" (3/3) ... [2022-11-16 11:37:16,214 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.oepc.i [2022-11-16 11:37:16,240 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:37:16,241 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-16 11:37:16,241 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:37:16,389 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:37:16,442 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-16 11:37:16,465 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 135 transitions, 285 flow [2022-11-16 11:37:16,478 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 135 transitions, 285 flow [2022-11-16 11:37:16,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 135 transitions, 285 flow [2022-11-16 11:37:16,580 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-11-16 11:37:16,581 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:37:16,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-11-16 11:37:16,596 INFO L119 LiptonReduction]: Number of co-enabled transitions 2824 [2022-11-16 11:37:28,804 INFO L134 LiptonReduction]: Checked pairs total: 8023 [2022-11-16 11:37:28,804 INFO L136 LiptonReduction]: Total number of compositions: 133 [2022-11-16 11:37:28,818 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 38 transitions, 91 flow [2022-11-16 11:37:28,995 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1784 states, 1769 states have (on average 3.427925381571509) internal successors, (6064), 1783 states have internal predecessors, (6064), 0 states have call successors, (0), 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 11:37:29,018 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:37:29,026 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;@26dee719, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:37:29,027 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-16 11:37:29,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 1784 states, 1769 states have (on average 3.427925381571509) internal successors, (6064), 1783 states have internal predecessors, (6064), 0 states have call successors, (0), 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 11:37:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-16 11:37:29,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:29,043 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-16 11:37:29,044 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:29,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:29,051 INFO L85 PathProgramCache]: Analyzing trace with hash 575, now seen corresponding path program 1 times [2022-11-16 11:37:29,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:37:29,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664486549] [2022-11-16 11:37:29,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:29,067 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 11:37:29,067 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:37:29,073 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:29,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:29,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 11:37:29,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:29,200 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 11:37:29,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:37:29,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:37:29,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664486549] [2022-11-16 11:37:29,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664486549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:29,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:29,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-16 11:37:29,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448399424] [2022-11-16 11:37:29,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:29,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:37:29,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:37:29,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:37:29,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:37:29,255 INFO L87 Difference]: Start difference. First operand has 1784 states, 1769 states have (on average 3.427925381571509) internal successors, (6064), 1783 states have internal predecessors, (6064), 0 states have call successors, (0), 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 11:37:29,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:29,517 INFO L93 Difference]: Finished difference Result 1684 states and 5558 transitions. [2022-11-16 11:37:29,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:37:29,521 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 11:37:29,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:29,564 INFO L225 Difference]: With dead ends: 1684 [2022-11-16 11:37:29,565 INFO L226 Difference]: Without dead ends: 1684 [2022-11-16 11:37:29,566 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 11:37:29,571 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:29,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:37:29,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2022-11-16 11:37:29,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2022-11-16 11:37:29,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1679 states have (on average 3.310303752233472) internal successors, (5558), 1683 states have internal predecessors, (5558), 0 states have call successors, (0), 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 11:37:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 5558 transitions. [2022-11-16 11:37:29,769 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 5558 transitions. Word has length 1 [2022-11-16 11:37:29,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:29,770 INFO L495 AbstractCegarLoop]: Abstraction has 1684 states and 5558 transitions. [2022-11-16 11:37:29,771 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 11:37:29,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 5558 transitions. [2022-11-16 11:37:29,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-16 11:37:29,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:29,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-16 11:37:29,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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)] Ended with exit code 0 [2022-11-16 11:37:29,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:29,988 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:29,989 INFO L85 PathProgramCache]: Analyzing trace with hash 566646, now seen corresponding path program 1 times [2022-11-16 11:37:29,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:37:29,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055642087] [2022-11-16 11:37:29,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:29,991 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 11:37:29,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:37:29,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:30,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:30,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:37:30,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:37:30,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:37:30,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:37:30,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055642087] [2022-11-16 11:37:30,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055642087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:30,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:30,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-16 11:37:30,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800084999] [2022-11-16 11:37:30,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:30,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:37:30,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:37:30,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:37:30,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:37:30,176 INFO L87 Difference]: Start difference. First operand 1684 states and 5558 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 11:37:30,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:30,399 INFO L93 Difference]: Finished difference Result 1418 states and 4632 transitions. [2022-11-16 11:37:30,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:37:30,401 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 11:37:30,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:30,414 INFO L225 Difference]: With dead ends: 1418 [2022-11-16 11:37:30,415 INFO L226 Difference]: Without dead ends: 1382 [2022-11-16 11:37:30,416 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 11:37:30,419 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:30,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 8 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:37:30,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2022-11-16 11:37:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1382. [2022-11-16 11:37:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 1380 states have (on average 3.2869565217391306) internal successors, (4536), 1381 states have internal predecessors, (4536), 0 states have call successors, (0), 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 11:37:30,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 4536 transitions. [2022-11-16 11:37:30,506 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 4536 transitions. Word has length 3 [2022-11-16 11:37:30,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:30,507 INFO L495 AbstractCegarLoop]: Abstraction has 1382 states and 4536 transitions. [2022-11-16 11:37:30,507 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 11:37:30,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 4536 transitions. [2022-11-16 11:37:30,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 11:37:30,510 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:30,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:30,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:30,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:30,734 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:30,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:30,735 INFO L85 PathProgramCache]: Analyzing trace with hash 549892495, now seen corresponding path program 1 times [2022-11-16 11:37:30,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:37:30,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010127547] [2022-11-16 11:37:30,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:30,737 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 11:37:30,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:37:30,738 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:30,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:30,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:37:30,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:30,963 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 11:37:30,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:37:30,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:37:30,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010127547] [2022-11-16 11:37:30,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010127547] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:30,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:30,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:37:30,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607398235] [2022-11-16 11:37:30,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:30,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:37:30,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:37:30,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:37:30,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:37:30,971 INFO L87 Difference]: Start difference. First operand 1382 states and 4536 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:31,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:31,109 INFO L93 Difference]: Finished difference Result 757 states and 2036 transitions. [2022-11-16 11:37:31,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:37:31,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-16 11:37:31,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:31,119 INFO L225 Difference]: With dead ends: 757 [2022-11-16 11:37:31,119 INFO L226 Difference]: Without dead ends: 757 [2022-11-16 11:37:31,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:37:31,123 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:31,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 8 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:37:31,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2022-11-16 11:37:31,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2022-11-16 11:37:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 755 states have (on average 2.696688741721854) internal successors, (2036), 756 states have internal predecessors, (2036), 0 states have call successors, (0), 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 11:37:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 2036 transitions. [2022-11-16 11:37:31,155 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 2036 transitions. Word has length 10 [2022-11-16 11:37:31,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:31,155 INFO L495 AbstractCegarLoop]: Abstraction has 757 states and 2036 transitions. [2022-11-16 11:37:31,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:37:31,156 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 2036 transitions. [2022-11-16 11:37:31,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 11:37:31,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:31,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:31,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:31,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:31,383 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:31,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:31,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1589609721, now seen corresponding path program 1 times [2022-11-16 11:37:31,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:37:31,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51118283] [2022-11-16 11:37:31,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:31,384 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 11:37:31,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:37:31,388 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:31,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:31,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:37:31,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:31,643 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 11:37:31,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:37:31,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:37:31,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51118283] [2022-11-16 11:37:31,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51118283] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:31,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:31,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:37:31,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625369304] [2022-11-16 11:37:31,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:31,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:37:31,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:37:31,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:37:31,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:37:31,647 INFO L87 Difference]: Start difference. First operand 757 states and 2036 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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 11:37:31,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:31,827 INFO L93 Difference]: Finished difference Result 382 states and 911 transitions. [2022-11-16 11:37:31,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:37:31,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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 11:37:31,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:31,830 INFO L225 Difference]: With dead ends: 382 [2022-11-16 11:37:31,831 INFO L226 Difference]: Without dead ends: 382 [2022-11-16 11:37:31,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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 11:37:31,832 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 24 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:31,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 16 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:37:31,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-11-16 11:37:31,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2022-11-16 11:37:31,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 380 states have (on average 2.3973684210526316) internal successors, (911), 381 states have internal predecessors, (911), 0 states have call successors, (0), 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 11:37:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 911 transitions. [2022-11-16 11:37:31,847 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 911 transitions. Word has length 15 [2022-11-16 11:37:31,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:31,848 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 911 transitions. [2022-11-16 11:37:31,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 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 11:37:31,848 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 911 transitions. [2022-11-16 11:37:31,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-16 11:37:31,850 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:31,850 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 11:37:31,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:32,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:32,077 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:32,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:32,078 INFO L85 PathProgramCache]: Analyzing trace with hash -658120982, now seen corresponding path program 1 times [2022-11-16 11:37:32,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:37:32,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128913552] [2022-11-16 11:37:32,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:32,079 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 11:37:32,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:37:32,080 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:32,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:32,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:37:32,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:32,320 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 11:37:32,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:37:32,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:37:32,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128913552] [2022-11-16 11:37:32,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128913552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:32,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:32,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:37:32,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487661323] [2022-11-16 11:37:32,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:32,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:37:32,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:37:32,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:37:32,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:37:32,324 INFO L87 Difference]: Start difference. First operand 382 states and 911 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 11:37:32,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:32,590 INFO L93 Difference]: Finished difference Result 307 states and 761 transitions. [2022-11-16 11:37:32,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:37:32,591 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 11:37:32,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:32,592 INFO L225 Difference]: With dead ends: 307 [2022-11-16 11:37:32,593 INFO L226 Difference]: Without dead ends: 307 [2022-11-16 11:37:32,593 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 11:37:32,594 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:32,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 36 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:37:32,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-11-16 11:37:32,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2022-11-16 11:37:32,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 305 states have (on average 2.495081967213115) internal successors, (761), 306 states have internal predecessors, (761), 0 states have call successors, (0), 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 11:37:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 761 transitions. [2022-11-16 11:37:32,606 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 761 transitions. Word has length 20 [2022-11-16 11:37:32,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:32,606 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 761 transitions. [2022-11-16 11:37:32,606 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 11:37:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 761 transitions. [2022-11-16 11:37:32,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 11:37:32,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:32,608 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 11:37:32,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:32,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:32,822 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:32,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:32,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1603277080, now seen corresponding path program 1 times [2022-11-16 11:37:32,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:37:32,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093088528] [2022-11-16 11:37:32,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:32,823 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 11:37:32,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:37:32,824 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:32,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:33,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 11:37:33,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:33,795 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 11:37:33,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:37:33,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:37:33,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2093088528] [2022-11-16 11:37:33,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2093088528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:33,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:33,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:37:33,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366911466] [2022-11-16 11:37:33,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:33,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:37:33,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:37:33,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:37:33,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:37:33,798 INFO L87 Difference]: Start difference. First operand 307 states and 761 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 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 11:37:33,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:33,891 INFO L93 Difference]: Finished difference Result 306 states and 760 transitions. [2022-11-16 11:37:33,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:37:33,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 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 11:37:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:33,894 INFO L225 Difference]: With dead ends: 306 [2022-11-16 11:37:33,894 INFO L226 Difference]: Without dead ends: 306 [2022-11-16 11:37:33,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:37:33,895 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:33,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 31 Unchecked, 0.1s Time] [2022-11-16 11:37:33,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-16 11:37:33,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2022-11-16 11:37:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 2.4918032786885247) internal successors, (760), 305 states have internal predecessors, (760), 0 states have call successors, (0), 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 11:37:33,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 760 transitions. [2022-11-16 11:37:33,907 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 760 transitions. Word has length 25 [2022-11-16 11:37:33,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:33,908 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 760 transitions. [2022-11-16 11:37:33,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 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 11:37:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 760 transitions. [2022-11-16 11:37:33,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 11:37:33,910 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:33,910 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 11:37:33,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:34,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:34,126 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:34,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:34,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1603277141, now seen corresponding path program 1 times [2022-11-16 11:37:34,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:37:34,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597640319] [2022-11-16 11:37:34,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:37:34,128 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 11:37:34,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:37:34,130 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:34,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:37:34,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:37:34,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:34,410 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 11:37:34,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:37:34,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:37:34,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597640319] [2022-11-16 11:37:34,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597640319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:34,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:34,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:37:34,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461901542] [2022-11-16 11:37:34,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:34,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:37:34,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:37:34,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:37:34,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:37:34,417 INFO L87 Difference]: Start difference. First operand 306 states and 760 transitions. Second operand has 5 states, 4 states have (on average 6.25) 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 11:37:34,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:34,686 INFO L93 Difference]: Finished difference Result 429 states and 1044 transitions. [2022-11-16 11:37:34,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:37:34,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) 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 11:37:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:34,688 INFO L225 Difference]: With dead ends: 429 [2022-11-16 11:37:34,688 INFO L226 Difference]: Without dead ends: 186 [2022-11-16 11:37:34,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 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 11:37:34,689 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 25 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:34,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 16 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:37:34,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-11-16 11:37:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-11-16 11:37:34,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 2.2432432432432434) internal successors, (415), 185 states have internal predecessors, (415), 0 states have call successors, (0), 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 11:37:34,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 415 transitions. [2022-11-16 11:37:34,710 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 415 transitions. Word has length 25 [2022-11-16 11:37:34,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:34,711 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 415 transitions. [2022-11-16 11:37:34,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) 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 11:37:34,711 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 415 transitions. [2022-11-16 11:37:34,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 11:37:34,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:34,713 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 11:37:34,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:34,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:34,929 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:34,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:34,929 INFO L85 PathProgramCache]: Analyzing trace with hash -206539191, now seen corresponding path program 2 times [2022-11-16 11:37:34,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:37:34,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365901889] [2022-11-16 11:37:34,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:37:34,930 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 11:37:34,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:37:34,932 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:34,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:35,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 11:37:35,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:37:35,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 11:37:35,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:35,211 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 11:37:35,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:37:35,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:37:35,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365901889] [2022-11-16 11:37:35,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1365901889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:35,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:35,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:37:35,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981515227] [2022-11-16 11:37:35,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:35,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:37:35,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:37:35,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:37:35,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:37:35,215 INFO L87 Difference]: Start difference. First operand 186 states and 415 transitions. Second operand has 5 states, 4 states have (on average 6.25) 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 11:37:35,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:35,453 INFO L93 Difference]: Finished difference Result 234 states and 514 transitions. [2022-11-16 11:37:35,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:37:35,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) 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 11:37:35,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:35,455 INFO L225 Difference]: With dead ends: 234 [2022-11-16 11:37:35,455 INFO L226 Difference]: Without dead ends: 126 [2022-11-16 11:37:35,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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 11:37:35,456 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 19 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:35,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 16 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:37:35,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-16 11:37:35,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-11-16 11:37:35,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.12) internal successors, (265), 125 states have internal predecessors, (265), 0 states have call successors, (0), 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 11:37:35,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 265 transitions. [2022-11-16 11:37:35,462 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 265 transitions. Word has length 25 [2022-11-16 11:37:35,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:35,462 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 265 transitions. [2022-11-16 11:37:35,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) 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 11:37:35,462 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 265 transitions. [2022-11-16 11:37:35,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 11:37:35,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:35,463 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 11:37:35,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:35,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:35,664 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:35,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:35,665 INFO L85 PathProgramCache]: Analyzing trace with hash 615654307, now seen corresponding path program 3 times [2022-11-16 11:37:35,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:37:35,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129883396] [2022-11-16 11:37:35,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:37:35,666 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 11:37:35,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:37:35,668 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:35,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:35,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-16 11:37:35,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:37:35,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 11:37:35,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:36,132 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 11:37:36,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:37:36,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:37:36,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129883396] [2022-11-16 11:37:36,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129883396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:36,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:36,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:37:36,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631015670] [2022-11-16 11:37:36,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:36,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:37:36,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:37:36,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:37:36,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:37:36,136 INFO L87 Difference]: Start difference. First operand 126 states and 265 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 11:37:36,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:36,485 INFO L93 Difference]: Finished difference Result 147 states and 301 transitions. [2022-11-16 11:37:36,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:37:36,485 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 11:37:36,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:36,486 INFO L225 Difference]: With dead ends: 147 [2022-11-16 11:37:36,487 INFO L226 Difference]: Without dead ends: 126 [2022-11-16 11:37:36,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 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 11:37:36,488 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 46 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:36,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 28 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:37:36,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-16 11:37:36,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-11-16 11:37:36,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 2.104) internal successors, (263), 125 states have internal predecessors, (263), 0 states have call successors, (0), 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 11:37:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 263 transitions. [2022-11-16 11:37:36,493 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 263 transitions. Word has length 25 [2022-11-16 11:37:36,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:36,494 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 263 transitions. [2022-11-16 11:37:36,494 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 11:37:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 263 transitions. [2022-11-16 11:37:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 11:37:36,495 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:36,496 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 11:37:36,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:36,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:36,707 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:36,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:36,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1119545193, now seen corresponding path program 4 times [2022-11-16 11:37:36,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:37:36,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009145965] [2022-11-16 11:37:36,708 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:37:36,708 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 11:37:36,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:37:36,709 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:36,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:36,891 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:37:36,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:37:36,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 11:37:36,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:37:37,290 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 11:37:37,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:37:37,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:37:37,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009145965] [2022-11-16 11:37:37,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009145965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:37:37,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:37:37,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:37:37,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077977420] [2022-11-16 11:37:37,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:37:37,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:37:37,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:37:37,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:37:37,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:37:37,294 INFO L87 Difference]: Start difference. First operand 126 states and 263 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 11:37:37,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:37:37,658 INFO L93 Difference]: Finished difference Result 141 states and 286 transitions. [2022-11-16 11:37:37,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:37:37,659 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 11:37:37,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:37:37,660 INFO L225 Difference]: With dead ends: 141 [2022-11-16 11:37:37,660 INFO L226 Difference]: Without dead ends: 74 [2022-11-16 11:37:37,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 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 11:37:37,661 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 61 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:37:37,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 28 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:37:37,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-16 11:37:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-16 11:37:37,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.7671232876712328) internal successors, (129), 73 states have internal predecessors, (129), 0 states have call successors, (0), 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 11:37:37,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 129 transitions. [2022-11-16 11:37:37,669 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 129 transitions. Word has length 25 [2022-11-16 11:37:37,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:37:37,670 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 129 transitions. [2022-11-16 11:37:37,670 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 11:37:37,670 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 129 transitions. [2022-11-16 11:37:37,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 11:37:37,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:37:37,671 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 11:37:37,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:37,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:37,884 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-16 11:37:37,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:37:37,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1089860771, now seen corresponding path program 5 times [2022-11-16 11:37:37,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:37:37,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147081716] [2022-11-16 11:37:37,885 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:37:37,885 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 11:37:37,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:37:37,887 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:37,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:38,136 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 11:37:38,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-16 11:37:38,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:37:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:37:38,347 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-16 11:37:38,348 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:37:38,349 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-16 11:37:38,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-16 11:37:38,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-16 11:37:38,352 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-16 11:37:38,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-16 11:37:38,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-16 11:37:38,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-16 11:37:38,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-16 11:37:38,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-16 11:37:38,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-16 11:37:38,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-16 11:37:38,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-16 11:37:38,355 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-16 11:37:38,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:38,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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 11:37:38,573 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2022-11-16 11:37:38,579 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:37:38,579 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:37:38,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:37:38 BasicIcfg [2022-11-16 11:37:38,690 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:37:38,690 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:37:38,690 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:37:38,691 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:37:38,691 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:37:16" (3/4) ... [2022-11-16 11:37:38,695 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:37:38,695 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:37:38,696 INFO L158 Benchmark]: Toolchain (without parser) took 24698.16ms. Allocated memory was 71.3MB in the beginning and 130.0MB in the end (delta: 58.7MB). Free memory was 51.4MB in the beginning and 70.0MB in the end (delta: -18.5MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2022-11-16 11:37:38,696 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 71.3MB. Free memory is still 52.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:37:38,697 INFO L158 Benchmark]: CACSL2BoogieTranslator took 811.07ms. Allocated memory is still 71.3MB. Free memory was 51.3MB in the beginning and 27.6MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-16 11:37:38,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 130.12ms. Allocated memory is still 71.3MB. Free memory was 27.6MB in the beginning and 52.0MB in the end (delta: -24.4MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2022-11-16 11:37:38,697 INFO L158 Benchmark]: Boogie Preprocessor took 78.48ms. Allocated memory is still 71.3MB. Free memory was 52.0MB in the beginning and 49.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:37:38,698 INFO L158 Benchmark]: RCFGBuilder took 1178.19ms. Allocated memory is still 71.3MB. Free memory was 49.9MB in the beginning and 32.7MB in the end (delta: 17.2MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2022-11-16 11:37:38,698 INFO L158 Benchmark]: TraceAbstraction took 22484.17ms. Allocated memory was 71.3MB in the beginning and 130.0MB in the end (delta: 58.7MB). Free memory was 32.0MB in the beginning and 71.0MB in the end (delta: -39.0MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2022-11-16 11:37:38,699 INFO L158 Benchmark]: Witness Printer took 4.88ms. Allocated memory is still 130.0MB. Free memory was 71.0MB in the beginning and 70.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:37:38,701 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.35ms. Allocated memory is still 71.3MB. Free memory is still 52.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 811.07ms. Allocated memory is still 71.3MB. Free memory was 51.3MB in the beginning and 27.6MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 130.12ms. Allocated memory is still 71.3MB. Free memory was 27.6MB in the beginning and 52.0MB in the end (delta: -24.4MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.48ms. Allocated memory is still 71.3MB. Free memory was 52.0MB in the beginning and 49.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1178.19ms. Allocated memory is still 71.3MB. Free memory was 49.9MB in the beginning and 32.7MB in the end (delta: 17.2MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * TraceAbstraction took 22484.17ms. Allocated memory was 71.3MB in the beginning and 130.0MB in the end (delta: 58.7MB). Free memory was 32.0MB in the beginning and 71.0MB in the end (delta: -39.0MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Witness Printer took 4.88ms. Allocated memory is still 130.0MB. Free memory was 71.0MB in the beginning and 70.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.3s, 143 PlacesBefore, 47 PlacesAfterwards, 135 TransitionsBefore, 38 TransitionsAfterwards, 2824 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 133 TotalNumberOfCompositions, 8023 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4454, independent: 4248, independent conditional: 0, independent unconditional: 4248, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1948, independent: 1898, independent conditional: 0, independent unconditional: 1898, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1948, independent: 1877, independent conditional: 0, independent unconditional: 1877, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 71, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 468, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 397, dependent conditional: 0, dependent unconditional: 397, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4454, independent: 2350, independent conditional: 0, independent unconditional: 2350, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 1948, unknown conditional: 0, unknown unconditional: 1948] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 250, Positive conditional cache size: 0, Positive unconditional cache size: 250, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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: [L721] 0 int __unbuffered_p2_EBX = 0; [L739] 0 _Bool a$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L711] 0 int __unbuffered_p0_EAX = 0; [L725] 0 int a$mem_tmp; [L734] 0 _Bool a$read_delayed; [L715] 0 int __unbuffered_p1_EAX = 0; [L723] 0 int a = 0; [L733] 0 _Bool a$r_buff1_thd3; [L719] 0 int __unbuffered_p2_EAX = 0; [L731] 0 _Bool a$r_buff1_thd1; [L736] 0 int a$w_buff0; [L732] 0 _Bool a$r_buff1_thd2; [L738] 0 int a$w_buff1; [L724] 0 _Bool a$flush_delayed; [L730] 0 _Bool a$r_buff1_thd0; [L709] 0 int __unbuffered_cnt = 0; [L735] 0 int *a$read_delayed_var; [L713] 0 int __unbuffered_p0_EBX = 0; [L741] 0 _Bool main$tmp_guard1; [L740] 0 _Bool main$tmp_guard0; [L737] 0 _Bool a$w_buff0_used; [L717] 0 int __unbuffered_p1_EBX = 0; [L727] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd0; [L729] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff0_thd2; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L855] 0 pthread_t t38; [L856] FCALL, FORK 0 pthread_create(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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(&t38, ((void *)0), P0, ((void *)0))=0, t38={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t39; [L858] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t39, ((void *)0), P1, ((void *)0))=1, t38={-6:0}, t39={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t40; [L860] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t40, ((void *)0), P2, ((void *)0))=2, t38={-6:0}, t39={-10:0}, t40={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 a$w_buff1 = a$w_buff0 [L754] 1 a$w_buff0 = 1 [L755] 1 a$w_buff1_used = a$w_buff0_used [L756] 1 a$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=0, y=0, z=0] [L765] 1 x = 1 [L768] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=0, z=0] [L771] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, z=0] [L791] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, z=0] [L794] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=1, z=1] [L814] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 a$flush_delayed = weak$$choice2 [L820] 3 a$mem_tmp = a [L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = a [L829] 3 a = a$flush_delayed ? a$mem_tmp : a [L830] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=2, weak$$choice2=0, x=1, y=1, z=1] [L833] 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) [L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L835] 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 [L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L837] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=2, weak$$choice2=0, x=1, y=1, z=1] [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L842] 3 return 0; [L774] 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) [L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L776] 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 [L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L778] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, y=1, z=1] [L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 1 return 0; [L797] 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) [L798] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L799] 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 [L800] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 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) [L867] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L868] 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 [L869] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L870] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, t38={-6:0}, t39={-10:0}, t40={-2:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] - 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: 853]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 856]: 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: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 166 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 22.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 252 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 184 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 31 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 962 IncrementalHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 65 mSDtfsCounter, 962 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1784occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 164 ConstructedInterpolants, 20 QuantifiedInterpolants, 1522 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1355 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 11:37:38,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cc674ba-0321-445c-aff2-2d11ca9f9820/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