./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix040_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix040_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a72b3b3683b5d2b2d35965fc1a3189152678e29fe154c9fbeb2d06d1447980e3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 02:42:23,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 02:42:23,844 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 02:42:23,850 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 02:42:23,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 02:42:23,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 02:42:23,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 02:42:23,885 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 02:42:23,885 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 02:42:23,885 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 02:42:23,885 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 02:42:23,886 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 02:42:23,886 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 02:42:23,886 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 02:42:23,886 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 02:42:23,886 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 02:42:23,886 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 02:42:23,886 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 02:42:23,886 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 02:42:23,887 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 02:42:23,887 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 02:42:23,887 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 02:42:23,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 02:42:23,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 02:42:23,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 02:42:23,889 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 02:42:23,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 02:42:23,889 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 02:42:23,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 02:42:23,890 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 02:42:23,890 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 02:42:23,890 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 02:42:23,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 02:42:23,890 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 02:42:23,890 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 02:42:23,890 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 02:42:23,891 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 02:42:23,891 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 02:42:23,891 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 02:42:23,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 02:42:23,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 02:42:23,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:42:23,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 02:42:23,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 02:42:23,891 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 02:42:23,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 02:42:23,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 02:42:23,892 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 02:42:23,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 02:42:23,892 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan 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 -> a72b3b3683b5d2b2d35965fc1a3189152678e29fe154c9fbeb2d06d1447980e3 [2024-11-14 02:42:24,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 02:42:24,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 02:42:24,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 02:42:24,221 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 02:42:24,221 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 02:42:24,222 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/pthread-wmm/mix040_power.oepc_pso.oepc_rmo.oepc.i Unable to find full path for "g++" [2024-11-14 02:42:26,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 02:42:26,547 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 02:42:26,547 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/sv-benchmarks/c/pthread-wmm/mix040_power.oepc_pso.oepc_rmo.oepc.i [2024-11-14 02:42:26,571 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/data/ea13023f3/b43e27c1fc2544b2860db8f8e1fcccbc/FLAG1335b2e4e [2024-11-14 02:42:26,760 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/data/ea13023f3/b43e27c1fc2544b2860db8f8e1fcccbc [2024-11-14 02:42:26,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 02:42:26,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 02:42:26,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 02:42:26,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 02:42:26,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 02:42:26,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:42:26" (1/1) ... [2024-11-14 02:42:26,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bbfc5ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:26, skipping insertion in model container [2024-11-14 02:42:26,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:42:26" (1/1) ... [2024-11-14 02:42:26,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 02:42:27,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:42:27,379 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 02:42:27,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:42:27,510 INFO L204 MainTranslator]: Completed translation [2024-11-14 02:42:27,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:27 WrapperNode [2024-11-14 02:42:27,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 02:42:27,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 02:42:27,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 02:42:27,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 02:42:27,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:27" (1/1) ... [2024-11-14 02:42:27,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:27" (1/1) ... [2024-11-14 02:42:27,561 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 132 [2024-11-14 02:42:27,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 02:42:27,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 02:42:27,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 02:42:27,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 02:42:27,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:27" (1/1) ... [2024-11-14 02:42:27,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:27" (1/1) ... [2024-11-14 02:42:27,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:27" (1/1) ... [2024-11-14 02:42:27,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:27" (1/1) ... [2024-11-14 02:42:27,587 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:27" (1/1) ... [2024-11-14 02:42:27,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:27" (1/1) ... [2024-11-14 02:42:27,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:27" (1/1) ... [2024-11-14 02:42:27,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:27" (1/1) ... [2024-11-14 02:42:27,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 02:42:27,597 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 02:42:27,597 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 02:42:27,597 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 02:42:27,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:27" (1/1) ... [2024-11-14 02:42:27,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:42:27,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:42:27,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 02:42:27,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 02:42:27,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-14 02:42:27,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 02:42:27,679 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-14 02:42:27,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-14 02:42:27,679 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-14 02:42:27,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-14 02:42:27,679 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-14 02:42:27,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-14 02:42:27,680 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-14 02:42:27,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-14 02:42:27,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 02:42:27,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-14 02:42:27,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 02:42:27,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 02:42:27,682 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 02:42:27,859 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 02:42:27,862 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 02:42:28,496 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 02:42:28,496 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 02:42:28,829 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 02:42:28,830 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-14 02:42:28,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:42:28 BoogieIcfgContainer [2024-11-14 02:42:28,831 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 02:42:28,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 02:42:28,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 02:42:28,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 02:42:28,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 02:42:26" (1/3) ... [2024-11-14 02:42:28,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df4b2f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:42:28, skipping insertion in model container [2024-11-14 02:42:28,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:42:27" (2/3) ... [2024-11-14 02:42:28,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df4b2f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:42:28, skipping insertion in model container [2024-11-14 02:42:28,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:42:28" (3/3) ... [2024-11-14 02:42:28,844 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040_power.oepc_pso.oepc_rmo.oepc.i [2024-11-14 02:42:28,863 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 02:42:28,865 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG mix040_power.oepc_pso.oepc_rmo.oepc.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-14 02:42:28,865 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 02:42:28,953 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-14 02:42:28,994 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 55 transitions, 126 flow [2024-11-14 02:42:32,369 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 51629 states, 51624 states have (on average 4.523380598171393) internal successors, (233515), 51628 states have internal predecessors, (233515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:32,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 02:42:32,450 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@56a44085, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 02:42:32,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-14 02:42:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand has 51629 states, 51624 states have (on average 4.523380598171393) internal successors, (233515), 51628 states have internal predecessors, (233515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:32,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 02:42:32,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:32,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 02:42:32,561 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:42:32,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:32,571 INFO L85 PathProgramCache]: Analyzing trace with hash 12835840, now seen corresponding path program 1 times [2024-11-14 02:42:32,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:32,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362591121] [2024-11-14 02:42:32,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:32,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:42:33,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:42:33,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362591121] [2024-11-14 02:42:33,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362591121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:42:33,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:42:33,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 02:42:33,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311440997] [2024-11-14 02:42:33,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:42:33,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 02:42:33,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:42:33,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 02:42:33,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:42:33,347 INFO L87 Difference]: Start difference. First operand has 51629 states, 51624 states have (on average 4.523380598171393) internal successors, (233515), 51628 states have internal predecessors, (233515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:35,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:42:35,114 INFO L93 Difference]: Finished difference Result 61772 states and 277118 transitions. [2024-11-14 02:42:35,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 02:42:35,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-14 02:42:35,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:42:35,987 INFO L225 Difference]: With dead ends: 61772 [2024-11-14 02:42:35,988 INFO L226 Difference]: Without dead ends: 40931 [2024-11-14 02:42:36,043 INFO L431 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 [2024-11-14 02:42:36,046 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 34 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:42:36,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 43 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:42:36,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40931 states. [2024-11-14 02:42:38,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40931 to 40931. [2024-11-14 02:42:38,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40931 states, 40929 states have (on average 4.364973490678981) internal successors, (178654), 40930 states have internal predecessors, (178654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:38,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40931 states to 40931 states and 178654 transitions. [2024-11-14 02:42:38,949 INFO L78 Accepts]: Start accepts. Automaton has 40931 states and 178654 transitions. Word has length 4 [2024-11-14 02:42:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:42:38,950 INFO L471 AbstractCegarLoop]: Abstraction has 40931 states and 178654 transitions. [2024-11-14 02:42:38,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 40931 states and 178654 transitions. [2024-11-14 02:42:38,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 02:42:38,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:38,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:42:38,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 02:42:38,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:42:38,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:38,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1230100567, now seen corresponding path program 1 times [2024-11-14 02:42:38,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:38,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670189440] [2024-11-14 02:42:38,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:38,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:39,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:39,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:42:39,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:42:39,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670189440] [2024-11-14 02:42:39,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670189440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:42:39,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:42:39,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 02:42:39,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478581326] [2024-11-14 02:42:39,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:42:39,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 02:42:39,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:42:39,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 02:42:39,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:42:39,164 INFO L87 Difference]: Start difference. First operand 40931 states and 178654 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:42:39,917 INFO L93 Difference]: Finished difference Result 40931 states and 178654 transitions. [2024-11-14 02:42:39,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 02:42:39,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-14 02:42:39,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:42:40,290 INFO L225 Difference]: With dead ends: 40931 [2024-11-14 02:42:40,291 INFO L226 Difference]: Without dead ends: 31670 [2024-11-14 02:42:40,325 INFO L431 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 [2024-11-14 02:42:40,328 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 21 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 [2024-11-14 02:42:40,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 21 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:42:40,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31670 states. [2024-11-14 02:42:42,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31670 to 31670. [2024-11-14 02:42:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31670 states, 31669 states have (on average 4.336954119170167) internal successors, (137347), 31669 states have internal predecessors, (137347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:42,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31670 states to 31670 states and 137347 transitions. [2024-11-14 02:42:42,893 INFO L78 Accepts]: Start accepts. Automaton has 31670 states and 137347 transitions. Word has length 17 [2024-11-14 02:42:42,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:42:42,895 INFO L471 AbstractCegarLoop]: Abstraction has 31670 states and 137347 transitions. [2024-11-14 02:42:42,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:42,895 INFO L276 IsEmpty]: Start isEmpty. Operand 31670 states and 137347 transitions. [2024-11-14 02:42:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 02:42:42,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:42,907 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:42:42,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 02:42:42,908 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:42:42,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:42,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1230101755, now seen corresponding path program 1 times [2024-11-14 02:42:42,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:42,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029967966] [2024-11-14 02:42:42,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:42,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:42:43,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:42:43,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029967966] [2024-11-14 02:42:43,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029967966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:42:43,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:42:43,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 02:42:43,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403068174] [2024-11-14 02:42:43,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:42:43,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:42:43,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:42:43,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:42:43,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:42:43,425 INFO L87 Difference]: Start difference. First operand 31670 states and 137347 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:45,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:42:45,101 INFO L93 Difference]: Finished difference Result 73753 states and 316631 transitions. [2024-11-14 02:42:45,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 02:42:45,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-14 02:42:45,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:42:45,535 INFO L225 Difference]: With dead ends: 73753 [2024-11-14 02:42:45,535 INFO L226 Difference]: Without dead ends: 51294 [2024-11-14 02:42:45,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-14 02:42:45,580 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 113 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 02:42:45,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 168 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 02:42:45,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51294 states. [2024-11-14 02:42:47,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51294 to 40134. [2024-11-14 02:42:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40134 states, 40133 states have (on average 4.269179976577878) internal successors, (171335), 40133 states have internal predecessors, (171335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:47,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40134 states to 40134 states and 171335 transitions. [2024-11-14 02:42:47,577 INFO L78 Accepts]: Start accepts. Automaton has 40134 states and 171335 transitions. Word has length 17 [2024-11-14 02:42:47,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:42:47,577 INFO L471 AbstractCegarLoop]: Abstraction has 40134 states and 171335 transitions. [2024-11-14 02:42:47,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:47,578 INFO L276 IsEmpty]: Start isEmpty. Operand 40134 states and 171335 transitions. [2024-11-14 02:42:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 02:42:47,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:47,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:42:47,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 02:42:47,604 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:42:47,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:47,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1906558438, now seen corresponding path program 1 times [2024-11-14 02:42:47,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:47,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198122206] [2024-11-14 02:42:47,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:47,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:48,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:42:48,006 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:42:48,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198122206] [2024-11-14 02:42:48,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198122206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:42:48,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:42:48,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 02:42:48,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817038681] [2024-11-14 02:42:48,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:42:48,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:42:48,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:42:48,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:42:48,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:42:48,009 INFO L87 Difference]: Start difference. First operand 40134 states and 171335 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:49,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:42:49,235 INFO L93 Difference]: Finished difference Result 48009 states and 203985 transitions. [2024-11-14 02:42:49,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 02:42:49,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-14 02:42:49,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:42:49,556 INFO L225 Difference]: With dead ends: 48009 [2024-11-14 02:42:49,557 INFO L226 Difference]: Without dead ends: 33834 [2024-11-14 02:42:49,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-14 02:42:49,595 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 111 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 02:42:49,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 144 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 02:42:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33834 states. [2024-11-14 02:42:50,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33834 to 29250. [2024-11-14 02:42:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29250 states, 29249 states have (on average 4.230195904133475) internal successors, (123729), 29249 states have internal predecessors, (123729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:50,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29250 states to 29250 states and 123729 transitions. [2024-11-14 02:42:51,015 INFO L78 Accepts]: Start accepts. Automaton has 29250 states and 123729 transitions. Word has length 19 [2024-11-14 02:42:51,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:42:51,016 INFO L471 AbstractCegarLoop]: Abstraction has 29250 states and 123729 transitions. [2024-11-14 02:42:51,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:51,017 INFO L276 IsEmpty]: Start isEmpty. Operand 29250 states and 123729 transitions. [2024-11-14 02:42:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 02:42:51,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:51,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:42:51,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 02:42:51,043 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:42:51,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:51,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1504816839, now seen corresponding path program 1 times [2024-11-14 02:42:51,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:51,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154300493] [2024-11-14 02:42:51,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:51,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:51,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:42:51,397 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:42:51,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154300493] [2024-11-14 02:42:51,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154300493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:42:51,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:42:51,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 02:42:51,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309027304] [2024-11-14 02:42:51,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:42:51,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:42:51,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:42:51,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:42:51,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:42:51,399 INFO L87 Difference]: Start difference. First operand 29250 states and 123729 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:52,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:42:52,478 INFO L93 Difference]: Finished difference Result 36775 states and 154819 transitions. [2024-11-14 02:42:52,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 02:42:52,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-14 02:42:52,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:42:52,640 INFO L225 Difference]: With dead ends: 36775 [2024-11-14 02:42:52,640 INFO L226 Difference]: Without dead ends: 28200 [2024-11-14 02:42:52,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-14 02:42:52,659 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 91 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 02:42:52,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 130 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 02:42:52,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28200 states. [2024-11-14 02:42:53,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28200 to 28200. [2024-11-14 02:42:53,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28200 states, 28199 states have (on average 4.214298379375155) internal successors, (118839), 28199 states have internal predecessors, (118839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:53,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28200 states to 28200 states and 118839 transitions. [2024-11-14 02:42:53,994 INFO L78 Accepts]: Start accepts. Automaton has 28200 states and 118839 transitions. Word has length 21 [2024-11-14 02:42:53,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:42:53,994 INFO L471 AbstractCegarLoop]: Abstraction has 28200 states and 118839 transitions. [2024-11-14 02:42:53,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:53,995 INFO L276 IsEmpty]: Start isEmpty. Operand 28200 states and 118839 transitions. [2024-11-14 02:42:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 02:42:54,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:54,020 INFO L215 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] [2024-11-14 02:42:54,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 02:42:54,021 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:42:54,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:54,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1989609176, now seen corresponding path program 1 times [2024-11-14 02:42:54,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:54,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051664620] [2024-11-14 02:42:54,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:54,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:42:54,312 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:42:54,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051664620] [2024-11-14 02:42:54,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051664620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:42:54,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:42:54,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 02:42:54,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013102862] [2024-11-14 02:42:54,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:42:54,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 02:42:54,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:42:54,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 02:42:54,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 02:42:54,316 INFO L87 Difference]: Start difference. First operand 28200 states and 118839 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:55,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:42:55,205 INFO L93 Difference]: Finished difference Result 46223 states and 193101 transitions. [2024-11-14 02:42:55,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 02:42:55,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-11-14 02:42:55,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:42:55,412 INFO L225 Difference]: With dead ends: 46223 [2024-11-14 02:42:55,413 INFO L226 Difference]: Without dead ends: 36650 [2024-11-14 02:42:55,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-14 02:42:55,444 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 160 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 02:42:55,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 166 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 02:42:55,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36650 states. [2024-11-14 02:42:56,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36650 to 26850. [2024-11-14 02:42:56,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26850 states, 26849 states have (on average 4.200491638422288) internal successors, (112779), 26849 states have internal predecessors, (112779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26850 states to 26850 states and 112779 transitions. [2024-11-14 02:42:56,579 INFO L78 Accepts]: Start accepts. Automaton has 26850 states and 112779 transitions. Word has length 23 [2024-11-14 02:42:56,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:42:56,579 INFO L471 AbstractCegarLoop]: Abstraction has 26850 states and 112779 transitions. [2024-11-14 02:42:56,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:56,579 INFO L276 IsEmpty]: Start isEmpty. Operand 26850 states and 112779 transitions. [2024-11-14 02:42:56,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 02:42:56,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:56,609 INFO L215 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] [2024-11-14 02:42:56,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 02:42:56,609 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:42:56,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:56,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1466054060, now seen corresponding path program 1 times [2024-11-14 02:42:56,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:56,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579371504] [2024-11-14 02:42:56,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:56,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:56,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:42:56,842 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:42:56,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579371504] [2024-11-14 02:42:56,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579371504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:42:56,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:42:56,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 02:42:56,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389828458] [2024-11-14 02:42:56,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:42:56,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:42:56,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:42:56,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:42:56,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:42:56,845 INFO L87 Difference]: Start difference. First operand 26850 states and 112779 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:58,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:42:58,030 INFO L93 Difference]: Finished difference Result 42550 states and 176794 transitions. [2024-11-14 02:42:58,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 02:42:58,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-14 02:42:58,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:42:58,241 INFO L225 Difference]: With dead ends: 42550 [2024-11-14 02:42:58,242 INFO L226 Difference]: Without dead ends: 28410 [2024-11-14 02:42:58,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-14 02:42:58,270 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 90 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 02:42:58,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 166 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 02:42:58,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28410 states. [2024-11-14 02:42:58,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28410 to 23510. [2024-11-14 02:42:58,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23510 states, 23509 states have (on average 4.131056191245905) internal successors, (97117), 23509 states have internal predecessors, (97117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23510 states to 23510 states and 97117 transitions. [2024-11-14 02:42:58,942 INFO L78 Accepts]: Start accepts. Automaton has 23510 states and 97117 transitions. Word has length 24 [2024-11-14 02:42:58,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:42:58,943 INFO L471 AbstractCegarLoop]: Abstraction has 23510 states and 97117 transitions. [2024-11-14 02:42:58,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:42:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 23510 states and 97117 transitions. [2024-11-14 02:42:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 02:42:58,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:42:58,976 INFO L215 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] [2024-11-14 02:42:58,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 02:42:58,977 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:42:58,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:42:58,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1277119881, now seen corresponding path program 1 times [2024-11-14 02:42:58,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:42:58,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903412604] [2024-11-14 02:42:58,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:42:58,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:42:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:42:59,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:42:59,482 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:42:59,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903412604] [2024-11-14 02:42:59,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903412604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:42:59,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:42:59,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 02:42:59,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433312862] [2024-11-14 02:42:59,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:42:59,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 02:42:59,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:42:59,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 02:42:59,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 02:42:59,485 INFO L87 Difference]: Start difference. First operand 23510 states and 97117 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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) [2024-11-14 02:43:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:43:00,023 INFO L93 Difference]: Finished difference Result 35608 states and 144518 transitions. [2024-11-14 02:43:00,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 02:43:00,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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 [2024-11-14 02:43:00,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:43:00,219 INFO L225 Difference]: With dead ends: 35608 [2024-11-14 02:43:00,220 INFO L226 Difference]: Without dead ends: 19832 [2024-11-14 02:43:00,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:43:00,254 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 76 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:43:00,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 49 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:43:00,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19832 states. [2024-11-14 02:43:00,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19832 to 19832. [2024-11-14 02:43:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19832 states, 19831 states have (on average 3.9891079622812766) internal successors, (79108), 19831 states have internal predecessors, (79108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:00,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19832 states to 19832 states and 79108 transitions. [2024-11-14 02:43:00,840 INFO L78 Accepts]: Start accepts. Automaton has 19832 states and 79108 transitions. Word has length 25 [2024-11-14 02:43:00,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:43:00,840 INFO L471 AbstractCegarLoop]: Abstraction has 19832 states and 79108 transitions. [2024-11-14 02:43:00,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 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) [2024-11-14 02:43:00,840 INFO L276 IsEmpty]: Start isEmpty. Operand 19832 states and 79108 transitions. [2024-11-14 02:43:00,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 02:43:00,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:00,885 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:00,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 02:43:00,885 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:43:00,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:00,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2113440178, now seen corresponding path program 1 times [2024-11-14 02:43:00,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:43:00,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320137457] [2024-11-14 02:43:00,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:43:00,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:43:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:43:01,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:43:01,107 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:43:01,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320137457] [2024-11-14 02:43:01,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320137457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:43:01,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:43:01,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 02:43:01,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822779160] [2024-11-14 02:43:01,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:43:01,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:43:01,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:43:01,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:43:01,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:43:01,109 INFO L87 Difference]: Start difference. First operand 19832 states and 79108 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:01,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:43:01,845 INFO L93 Difference]: Finished difference Result 25516 states and 99680 transitions. [2024-11-14 02:43:01,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 02:43:01,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-14 02:43:01,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:43:01,972 INFO L225 Difference]: With dead ends: 25516 [2024-11-14 02:43:01,973 INFO L226 Difference]: Without dead ends: 13418 [2024-11-14 02:43:01,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-14 02:43:01,995 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 134 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 02:43:01,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 64 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 02:43:02,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13418 states. [2024-11-14 02:43:02,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13418 to 13394. [2024-11-14 02:43:02,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13394 states, 13393 states have (on average 3.7875755991936084) internal successors, (50727), 13393 states have internal predecessors, (50727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13394 states to 13394 states and 50727 transitions. [2024-11-14 02:43:02,295 INFO L78 Accepts]: Start accepts. Automaton has 13394 states and 50727 transitions. Word has length 28 [2024-11-14 02:43:02,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:43:02,296 INFO L471 AbstractCegarLoop]: Abstraction has 13394 states and 50727 transitions. [2024-11-14 02:43:02,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:02,296 INFO L276 IsEmpty]: Start isEmpty. Operand 13394 states and 50727 transitions. [2024-11-14 02:43:02,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 02:43:02,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:02,316 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:02,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 02:43:02,317 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:43:02,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:02,317 INFO L85 PathProgramCache]: Analyzing trace with hash -149728107, now seen corresponding path program 1 times [2024-11-14 02:43:02,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:43:02,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906647204] [2024-11-14 02:43:02,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:43:02,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:43:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:43:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:43:02,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:43:02,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906647204] [2024-11-14 02:43:02,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906647204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:43:02,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:43:02,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 02:43:02,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779105323] [2024-11-14 02:43:02,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:43:02,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 02:43:02,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:43:02,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 02:43:02,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-14 02:43:02,666 INFO L87 Difference]: Start difference. First operand 13394 states and 50727 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:03,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:43:03,041 INFO L93 Difference]: Finished difference Result 14786 states and 55263 transitions. [2024-11-14 02:43:03,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 02:43:03,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-11-14 02:43:03,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:43:03,155 INFO L225 Difference]: With dead ends: 14786 [2024-11-14 02:43:03,155 INFO L226 Difference]: Without dead ends: 9006 [2024-11-14 02:43:03,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-14 02:43:03,168 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 186 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:43:03,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 79 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:43:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9006 states. [2024-11-14 02:43:03,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9006 to 8782. [2024-11-14 02:43:03,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8782 states, 8781 states have (on average 3.7142694453934633) internal successors, (32615), 8781 states have internal predecessors, (32615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:03,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8782 states to 8782 states and 32615 transitions. [2024-11-14 02:43:03,796 INFO L78 Accepts]: Start accepts. Automaton has 8782 states and 32615 transitions. Word has length 31 [2024-11-14 02:43:03,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:43:03,796 INFO L471 AbstractCegarLoop]: Abstraction has 8782 states and 32615 transitions. [2024-11-14 02:43:03,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:03,797 INFO L276 IsEmpty]: Start isEmpty. Operand 8782 states and 32615 transitions. [2024-11-14 02:43:03,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 02:43:03,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:03,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:03,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 02:43:03,810 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:43:03,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:03,810 INFO L85 PathProgramCache]: Analyzing trace with hash -508710236, now seen corresponding path program 1 times [2024-11-14 02:43:03,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:43:03,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990181849] [2024-11-14 02:43:03,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:43:03,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:43:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:43:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:43:04,157 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:43:04,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990181849] [2024-11-14 02:43:04,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990181849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:43:04,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:43:04,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 02:43:04,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104429593] [2024-11-14 02:43:04,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:43:04,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 02:43:04,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:43:04,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 02:43:04,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 02:43:04,159 INFO L87 Difference]: Start difference. First operand 8782 states and 32615 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:04,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:43:04,744 INFO L93 Difference]: Finished difference Result 15054 states and 55207 transitions. [2024-11-14 02:43:04,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 02:43:04,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-14 02:43:04,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:43:04,870 INFO L225 Difference]: With dead ends: 15054 [2024-11-14 02:43:04,870 INFO L226 Difference]: Without dead ends: 12598 [2024-11-14 02:43:04,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-14 02:43:04,880 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 129 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 02:43:04,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 174 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 02:43:04,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12598 states. [2024-11-14 02:43:05,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12598 to 8478. [2024-11-14 02:43:05,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8478 states, 8477 states have (on average 3.6709920962604694) internal successors, (31119), 8477 states have internal predecessors, (31119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:05,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8478 states to 8478 states and 31119 transitions. [2024-11-14 02:43:05,179 INFO L78 Accepts]: Start accepts. Automaton has 8478 states and 31119 transitions. Word has length 34 [2024-11-14 02:43:05,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:43:05,179 INFO L471 AbstractCegarLoop]: Abstraction has 8478 states and 31119 transitions. [2024-11-14 02:43:05,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:05,180 INFO L276 IsEmpty]: Start isEmpty. Operand 8478 states and 31119 transitions. [2024-11-14 02:43:05,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 02:43:05,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:05,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:05,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 02:43:05,192 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:43:05,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:05,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1783053346, now seen corresponding path program 2 times [2024-11-14 02:43:05,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:43:05,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163400126] [2024-11-14 02:43:05,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:43:05,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:43:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:43:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:43:05,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:43:05,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163400126] [2024-11-14 02:43:05,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163400126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:43:05,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:43:05,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 02:43:05,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621244250] [2024-11-14 02:43:05,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:43:05,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 02:43:05,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:43:05,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 02:43:05,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 02:43:05,586 INFO L87 Difference]: Start difference. First operand 8478 states and 31119 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:06,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:43:06,466 INFO L93 Difference]: Finished difference Result 15766 states and 57283 transitions. [2024-11-14 02:43:06,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 02:43:06,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-14 02:43:06,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:43:06,558 INFO L225 Difference]: With dead ends: 15766 [2024-11-14 02:43:06,558 INFO L226 Difference]: Without dead ends: 11152 [2024-11-14 02:43:06,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-14 02:43:06,567 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 152 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 02:43:06,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 228 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 02:43:06,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11152 states. [2024-11-14 02:43:06,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11152 to 8240. [2024-11-14 02:43:06,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8240 states, 8239 states have (on average 3.613788081077801) internal successors, (29774), 8239 states have internal predecessors, (29774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8240 states to 8240 states and 29774 transitions. [2024-11-14 02:43:06,808 INFO L78 Accepts]: Start accepts. Automaton has 8240 states and 29774 transitions. Word has length 34 [2024-11-14 02:43:06,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:43:06,808 INFO L471 AbstractCegarLoop]: Abstraction has 8240 states and 29774 transitions. [2024-11-14 02:43:06,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:06,808 INFO L276 IsEmpty]: Start isEmpty. Operand 8240 states and 29774 transitions. [2024-11-14 02:43:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 02:43:06,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:06,820 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:06,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 02:43:06,820 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:43:06,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:06,821 INFO L85 PathProgramCache]: Analyzing trace with hash 2136705508, now seen corresponding path program 3 times [2024-11-14 02:43:06,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:43:06,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692589766] [2024-11-14 02:43:06,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:43:06,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:43:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:43:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:43:07,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:43:07,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692589766] [2024-11-14 02:43:07,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692589766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:43:07,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:43:07,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 02:43:07,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118440413] [2024-11-14 02:43:07,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:43:07,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 02:43:07,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:43:07,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 02:43:07,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 02:43:07,153 INFO L87 Difference]: Start difference. First operand 8240 states and 29774 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:07,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:43:07,471 INFO L93 Difference]: Finished difference Result 8368 states and 30142 transitions. [2024-11-14 02:43:07,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 02:43:07,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-14 02:43:07,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:43:07,556 INFO L225 Difference]: With dead ends: 8368 [2024-11-14 02:43:07,556 INFO L226 Difference]: Without dead ends: 2982 [2024-11-14 02:43:07,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-14 02:43:07,568 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 239 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:43:07,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 57 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:43:07,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2024-11-14 02:43:07,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2854. [2024-11-14 02:43:07,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2854 states, 2853 states have (on average 3.5436382754994744) internal successors, (10110), 2853 states have internal predecessors, (10110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 10110 transitions. [2024-11-14 02:43:07,702 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 10110 transitions. Word has length 34 [2024-11-14 02:43:07,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:43:07,702 INFO L471 AbstractCegarLoop]: Abstraction has 2854 states and 10110 transitions. [2024-11-14 02:43:07,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:07,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 10110 transitions. [2024-11-14 02:43:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 02:43:07,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:07,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:07,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 02:43:07,708 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:43:07,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:07,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1032032079, now seen corresponding path program 1 times [2024-11-14 02:43:07,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:43:07,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838493517] [2024-11-14 02:43:07,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:43:07,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:43:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:43:08,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:43:08,006 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:43:08,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838493517] [2024-11-14 02:43:08,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838493517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:43:08,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:43:08,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 02:43:08,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283643792] [2024-11-14 02:43:08,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:43:08,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:43:08,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:43:08,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:43:08,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:43:08,007 INFO L87 Difference]: Start difference. First operand 2854 states and 10110 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:08,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:43:08,223 INFO L93 Difference]: Finished difference Result 4638 states and 16368 transitions. [2024-11-14 02:43:08,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 02:43:08,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-14 02:43:08,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:43:08,304 INFO L225 Difference]: With dead ends: 4638 [2024-11-14 02:43:08,304 INFO L226 Difference]: Without dead ends: 1996 [2024-11-14 02:43:08,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 02:43:08,309 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 35 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:43:08,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 110 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:43:08,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2024-11-14 02:43:08,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1996. [2024-11-14 02:43:08,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1996 states, 1995 states have (on average 3.4526315789473685) internal successors, (6888), 1995 states have internal predecessors, (6888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 6888 transitions. [2024-11-14 02:43:08,426 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 6888 transitions. Word has length 39 [2024-11-14 02:43:08,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:43:08,427 INFO L471 AbstractCegarLoop]: Abstraction has 1996 states and 6888 transitions. [2024-11-14 02:43:08,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:08,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 6888 transitions. [2024-11-14 02:43:08,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 02:43:08,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:08,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:08,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 02:43:08,432 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:43:08,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:08,432 INFO L85 PathProgramCache]: Analyzing trace with hash 117456919, now seen corresponding path program 2 times [2024-11-14 02:43:08,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:43:08,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428938808] [2024-11-14 02:43:08,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:43:08,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:43:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:43:10,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:43:10,643 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 02:43:10,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428938808] [2024-11-14 02:43:10,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428938808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:43:10,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:43:10,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 02:43:10,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008623367] [2024-11-14 02:43:10,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:43:10,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 02:43:10,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 02:43:10,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 02:43:10,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-14 02:43:10,646 INFO L87 Difference]: Start difference. First operand 1996 states and 6888 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:11,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:43:11,147 INFO L93 Difference]: Finished difference Result 2940 states and 10096 transitions. [2024-11-14 02:43:11,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 02:43:11,148 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-14 02:43:11,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:43:11,219 INFO L225 Difference]: With dead ends: 2940 [2024-11-14 02:43:11,219 INFO L226 Difference]: Without dead ends: 1480 [2024-11-14 02:43:11,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-14 02:43:11,222 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 83 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 02:43:11,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 239 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 02:43:11,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2024-11-14 02:43:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1480. [2024-11-14 02:43:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1479 states have (on average 3.359026369168357) internal successors, (4968), 1479 states have internal predecessors, (4968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 4968 transitions. [2024-11-14 02:43:11,322 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 4968 transitions. Word has length 39 [2024-11-14 02:43:11,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:43:11,323 INFO L471 AbstractCegarLoop]: Abstraction has 1480 states and 4968 transitions. [2024-11-14 02:43:11,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 4968 transitions. [2024-11-14 02:43:11,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 02:43:11,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:11,326 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:11,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 02:43:11,326 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:43:11,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:11,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1789759511, now seen corresponding path program 3 times [2024-11-14 02:43:11,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 02:43:11,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182789975] [2024-11-14 02:43:11,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:43:11,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 02:43:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 02:43:11,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 02:43:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 02:43:11,587 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 02:43:11,588 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 02:43:11,590 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-14 02:43:11,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-14 02:43:11,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-14 02:43:11,592 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-14 02:43:11,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-14 02:43:11,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-14 02:43:11,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-14 02:43:11,593 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-14 02:43:11,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 02:43:11,596 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:11,728 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 02:43:11,729 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 02:43:11,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 02:43:11 BasicIcfg [2024-11-14 02:43:11,732 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 02:43:11,732 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 02:43:11,734 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 02:43:11,734 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 02:43:11,735 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:42:28" (3/4) ... [2024-11-14 02:43:11,737 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 02:43:11,738 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 02:43:11,739 INFO L158 Benchmark]: Toolchain (without parser) took 44975.87ms. Allocated memory was 142.6MB in the beginning and 12.8GB in the end (delta: 12.6GB). Free memory was 116.0MB in the beginning and 10.2GB in the end (delta: -10.1GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2024-11-14 02:43:11,739 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 02:43:11,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 746.96ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 91.8MB in the end (delta: 24.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-14 02:43:11,740 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.35ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 89.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 02:43:11,740 INFO L158 Benchmark]: Boogie Preprocessor took 32.15ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 87.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 02:43:11,741 INFO L158 Benchmark]: RCFGBuilder took 1234.31ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 101.3MB in the end (delta: -13.6MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2024-11-14 02:43:11,741 INFO L158 Benchmark]: TraceAbstraction took 42897.32ms. Allocated memory was 142.6MB in the beginning and 12.8GB in the end (delta: 12.6GB). Free memory was 100.6MB in the beginning and 10.2GB in the end (delta: -10.1GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2024-11-14 02:43:11,742 INFO L158 Benchmark]: Witness Printer took 5.88ms. Allocated memory is still 12.8GB. Free memory was 10.2GB in the beginning and 10.2GB in the end (delta: 94.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 02:43:11,743 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 746.96ms. Allocated memory is still 142.6MB. Free memory was 115.9MB in the beginning and 91.8MB in the end (delta: 24.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.35ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 89.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.15ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 87.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1234.31ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 101.3MB in the end (delta: -13.6MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. * TraceAbstraction took 42897.32ms. Allocated memory was 142.6MB in the beginning and 12.8GB in the end (delta: 12.6GB). Free memory was 100.6MB in the beginning and 10.2GB in the end (delta: -10.1GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 5.88ms. Allocated memory is still 12.8GB. Free memory was 10.2GB in the beginning and 10.2GB in the end (delta: 94.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t1057; [L870] FCALL, FORK 0 pthread_create(&t1057, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1057=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1058; [L872] FCALL, FORK 0 pthread_create(&t1058, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1057=-2, t1058=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1059; [L874] FCALL, FORK 0 pthread_create(&t1059, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1057=-2, t1058=-1, t1059=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1060; [L876] FCALL, FORK 0 pthread_create(&t1060, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1057=-2, t1058=-1, t1059=0, t1060=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=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 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L802] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L822] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L825] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L828] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z=1] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z=1] [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z=1] [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z=1] [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z=1] [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1057=-2, t1058=-1, t1059=0, t1060=1, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z=1] [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L884] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L886] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1057=-2, t1058=-1, t1059=0, t1060=1, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z=1] [L889] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1057=-2, t1058=-1, t1059=0, t1060=1, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z=1] [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z=1] [L17] 0 __assert_fail ("0", "mix040_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 89 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 42.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.4s, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1662 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1662 mSDsluCounter, 1838 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1280 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2367 IncrementalHoareTripleChecker+Invalid, 2423 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 558 mSDtfsCounter, 2367 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51629occurred in iteration=0, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 37852 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 428 NumberOfCodeBlocks, 428 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 374 ConstructedInterpolants, 0 QuantifiedInterpolants, 1800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 [2024-11-14 02:43:11,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix040_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a72b3b3683b5d2b2d35965fc1a3189152678e29fe154c9fbeb2d06d1447980e3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 02:43:14,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 02:43:14,752 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-14 02:43:14,760 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 02:43:14,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 02:43:14,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 02:43:14,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 02:43:14,819 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 02:43:14,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 02:43:14,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 02:43:14,819 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 02:43:14,819 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 02:43:14,819 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 02:43:14,819 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 02:43:14,819 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 02:43:14,820 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 02:43:14,820 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 02:43:14,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 02:43:14,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 02:43:14,824 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 02:43:14,824 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 02:43:14,825 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 02:43:14,825 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 02:43:14,825 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 02:43:14,825 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 02:43:14,825 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 02:43:14,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 02:43:14,825 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 02:43:14,825 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 02:43:14,825 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 02:43:14,825 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 02:43:14,825 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 02:43:14,825 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 02:43:14,825 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 02:43:14,826 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 02:43:14,826 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 02:43:14,826 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 02:43:14,826 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 02:43:14,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:43:14,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 02:43:14,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 02:43:14,826 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 02:43:14,826 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 02:43:14,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 02:43:14,826 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 02:43:14,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan 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 -> a72b3b3683b5d2b2d35965fc1a3189152678e29fe154c9fbeb2d06d1447980e3 [2024-11-14 02:43:15,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 02:43:15,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 02:43:15,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 02:43:15,151 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 02:43:15,152 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 02:43:15,153 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/pthread-wmm/mix040_power.oepc_pso.oepc_rmo.oepc.i Unable to find full path for "g++" [2024-11-14 02:43:17,083 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 02:43:17,459 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 02:43:17,460 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/sv-benchmarks/c/pthread-wmm/mix040_power.oepc_pso.oepc_rmo.oepc.i [2024-11-14 02:43:17,482 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/data/420fd2df6/bdd6e557d12d4fd38ef2147e1ac2c15d/FLAG21c206146 [2024-11-14 02:43:17,506 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/data/420fd2df6/bdd6e557d12d4fd38ef2147e1ac2c15d [2024-11-14 02:43:17,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 02:43:17,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 02:43:17,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 02:43:17,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 02:43:17,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 02:43:17,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:43:17" (1/1) ... [2024-11-14 02:43:17,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a9a8385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:17, skipping insertion in model container [2024-11-14 02:43:17,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 02:43:17" (1/1) ... [2024-11-14 02:43:17,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 02:43:17,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:43:17,982 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 02:43:18,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 02:43:18,128 INFO L204 MainTranslator]: Completed translation [2024-11-14 02:43:18,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:18 WrapperNode [2024-11-14 02:43:18,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 02:43:18,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 02:43:18,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 02:43:18,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 02:43:18,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:18" (1/1) ... [2024-11-14 02:43:18,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:18" (1/1) ... [2024-11-14 02:43:18,206 INFO L138 Inliner]: procedures = 177, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 133 [2024-11-14 02:43:18,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 02:43:18,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 02:43:18,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 02:43:18,208 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 02:43:18,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:18" (1/1) ... [2024-11-14 02:43:18,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:18" (1/1) ... [2024-11-14 02:43:18,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:18" (1/1) ... [2024-11-14 02:43:18,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:18" (1/1) ... [2024-11-14 02:43:18,232 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:18" (1/1) ... [2024-11-14 02:43:18,234 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:18" (1/1) ... [2024-11-14 02:43:18,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:18" (1/1) ... [2024-11-14 02:43:18,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:18" (1/1) ... [2024-11-14 02:43:18,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 02:43:18,243 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 02:43:18,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 02:43:18,243 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 02:43:18,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:18" (1/1) ... [2024-11-14 02:43:18,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 02:43:18,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 02:43:18,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 02:43:18,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 02:43:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-14 02:43:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 02:43:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 02:43:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-14 02:43:18,309 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-14 02:43:18,309 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-14 02:43:18,310 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-14 02:43:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-14 02:43:18,310 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-14 02:43:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-14 02:43:18,310 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-14 02:43:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-14 02:43:18,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 02:43:18,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 02:43:18,311 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 02:43:18,468 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 02:43:18,472 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 02:43:18,986 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 02:43:18,986 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 02:43:19,306 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 02:43:19,307 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-14 02:43:19,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:43:19 BoogieIcfgContainer [2024-11-14 02:43:19,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 02:43:19,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 02:43:19,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 02:43:19,321 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 02:43:19,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 02:43:17" (1/3) ... [2024-11-14 02:43:19,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5caddca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:43:19, skipping insertion in model container [2024-11-14 02:43:19,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 02:43:18" (2/3) ... [2024-11-14 02:43:19,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5caddca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 02:43:19, skipping insertion in model container [2024-11-14 02:43:19,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:43:19" (3/3) ... [2024-11-14 02:43:19,323 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040_power.oepc_pso.oepc_rmo.oepc.i [2024-11-14 02:43:19,340 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 02:43:19,342 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG mix040_power.oepc_pso.oepc_rmo.oepc.i that has 5 procedures, 54 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-14 02:43:19,342 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 02:43:19,428 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-14 02:43:19,466 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 55 transitions, 126 flow [2024-11-14 02:43:22,312 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 51629 states, 51624 states have (on average 4.523380598171393) internal successors, (233515), 51628 states have internal predecessors, (233515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:22,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 02:43:22,362 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@74defcc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 02:43:22,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-14 02:43:22,456 INFO L276 IsEmpty]: Start isEmpty. Operand has 51629 states, 51624 states have (on average 4.523380598171393) internal successors, (233515), 51628 states have internal predecessors, (233515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:22,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 02:43:22,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:22,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 02:43:22,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:43:22,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:22,469 INFO L85 PathProgramCache]: Analyzing trace with hash 12891642, now seen corresponding path program 1 times [2024-11-14 02:43:22,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:43:22,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936078160] [2024-11-14 02:43:22,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:43:22,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 02:43:22,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:43:22,484 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 02:43:22,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:43:22,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 02:43:22,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:43:22,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:43:22,843 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 02:43:22,844 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 02:43:22,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936078160] [2024-11-14 02:43:22,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936078160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:43:22,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:43:22,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 02:43:22,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179631204] [2024-11-14 02:43:22,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:43:22,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 02:43:22,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 02:43:22,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 02:43:22,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:43:22,972 INFO L87 Difference]: Start difference. First operand has 51629 states, 51624 states have (on average 4.523380598171393) internal successors, (233515), 51628 states have internal predecessors, (233515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:43:24,842 INFO L93 Difference]: Finished difference Result 61772 states and 277118 transitions. [2024-11-14 02:43:24,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 02:43:24,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-14 02:43:24,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:43:25,420 INFO L225 Difference]: With dead ends: 61772 [2024-11-14 02:43:25,421 INFO L226 Difference]: Without dead ends: 40931 [2024-11-14 02:43:25,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:43:25,493 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 34 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 02:43:25,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 43 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:43:25,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40931 states. [2024-11-14 02:43:27,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40931 to 40931. [2024-11-14 02:43:27,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40931 states, 40929 states have (on average 4.364973490678981) internal successors, (178654), 40930 states have internal predecessors, (178654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40931 states to 40931 states and 178654 transitions. [2024-11-14 02:43:28,431 INFO L78 Accepts]: Start accepts. Automaton has 40931 states and 178654 transitions. Word has length 4 [2024-11-14 02:43:28,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:43:28,433 INFO L471 AbstractCegarLoop]: Abstraction has 40931 states and 178654 transitions. [2024-11-14 02:43:28,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 40931 states and 178654 transitions. [2024-11-14 02:43:28,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 02:43:28,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:28,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:28,464 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:28,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:28,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:43:28,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:28,663 INFO L85 PathProgramCache]: Analyzing trace with hash -68787367, now seen corresponding path program 1 times [2024-11-14 02:43:28,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:43:28,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825087848] [2024-11-14 02:43:28,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:43:28,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 [2024-11-14 02:43:28,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:43:28,668 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 02:43:28,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:43:28,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 02:43:28,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:43:28,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:43:28,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 02:43:28,874 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 02:43:28,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825087848] [2024-11-14 02:43:28,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825087848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:43:28,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:43:28,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 02:43:28,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362394232] [2024-11-14 02:43:28,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:43:28,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 02:43:28,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 02:43:28,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 02:43:28,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 02:43:28,877 INFO L87 Difference]: Start difference. First operand 40931 states and 178654 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:30,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:43:30,244 INFO L93 Difference]: Finished difference Result 65263 states and 279776 transitions. [2024-11-14 02:43:30,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 02:43:30,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-14 02:43:30,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:43:30,552 INFO L225 Difference]: With dead ends: 65263 [2024-11-14 02:43:30,552 INFO L226 Difference]: Without dead ends: 31306 [2024-11-14 02:43:30,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:43:30,627 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 82 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 02:43:30,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 55 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 02:43:30,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31306 states. [2024-11-14 02:43:32,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31306 to 31306. [2024-11-14 02:43:32,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31306 states, 31304 states have (on average 4.1697227191413235) internal successors, (130529), 31305 states have internal predecessors, (130529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:32,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31306 states to 31306 states and 130529 transitions. [2024-11-14 02:43:32,380 INFO L78 Accepts]: Start accepts. Automaton has 31306 states and 130529 transitions. Word has length 17 [2024-11-14 02:43:32,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:43:32,381 INFO L471 AbstractCegarLoop]: Abstraction has 31306 states and 130529 transitions. [2024-11-14 02:43:32,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:32,382 INFO L276 IsEmpty]: Start isEmpty. Operand 31306 states and 130529 transitions. [2024-11-14 02:43:32,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 02:43:32,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:32,407 INFO L215 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] [2024-11-14 02:43:32,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:32,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:32,608 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:43:32,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:32,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2113562839, now seen corresponding path program 1 times [2024-11-14 02:43:32,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:43:32,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637193282] [2024-11-14 02:43:32,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:43:32,609 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 [2024-11-14 02:43:32,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:43:32,612 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 02:43:32,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:43:32,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 02:43:32,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:43:32,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:43:32,836 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 02:43:32,836 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 02:43:32,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637193282] [2024-11-14 02:43:32,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637193282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:43:32,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:43:32,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 02:43:32,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990026865] [2024-11-14 02:43:32,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:43:32,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:43:32,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 02:43:32,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:43:32,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:43:32,837 INFO L87 Difference]: Start difference. First operand 31306 states and 130529 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) [2024-11-14 02:43:33,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:43:33,385 INFO L93 Difference]: Finished difference Result 41338 states and 168601 transitions. [2024-11-14 02:43:33,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 02:43:33,386 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 [2024-11-14 02:43:33,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:43:33,523 INFO L225 Difference]: With dead ends: 41338 [2024-11-14 02:43:33,523 INFO L226 Difference]: Without dead ends: 17006 [2024-11-14 02:43:33,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 02:43:33,569 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 138 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:43:33,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 84 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:43:33,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17006 states. [2024-11-14 02:43:34,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17006 to 17006. [2024-11-14 02:43:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17006 states, 17004 states have (on average 3.8919665960950365) internal successors, (66179), 17005 states have internal predecessors, (66179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17006 states to 17006 states and 66179 transitions. [2024-11-14 02:43:34,618 INFO L78 Accepts]: Start accepts. Automaton has 17006 states and 66179 transitions. Word has length 22 [2024-11-14 02:43:34,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:43:34,618 INFO L471 AbstractCegarLoop]: Abstraction has 17006 states and 66179 transitions. [2024-11-14 02:43:34,619 INFO L472 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) [2024-11-14 02:43:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 17006 states and 66179 transitions. [2024-11-14 02:43:34,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 02:43:34,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:34,650 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:34,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:34,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:34,854 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:43:34,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:34,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1035359717, now seen corresponding path program 1 times [2024-11-14 02:43:34,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:43:34,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19807106] [2024-11-14 02:43:34,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:43:34,858 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 [2024-11-14 02:43:34,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:43:34,861 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 02:43:34,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:43:35,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 02:43:35,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:43:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:43:35,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 02:43:35,116 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 02:43:35,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19807106] [2024-11-14 02:43:35,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19807106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:43:35,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:43:35,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 02:43:35,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224364671] [2024-11-14 02:43:35,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:43:35,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 02:43:35,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 02:43:35,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 02:43:35,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 02:43:35,117 INFO L87 Difference]: Start difference. First operand 17006 states and 66179 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:35,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:43:35,623 INFO L93 Difference]: Finished difference Result 19118 states and 73291 transitions. [2024-11-14 02:43:35,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 02:43:35,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-14 02:43:35,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:43:35,719 INFO L225 Difference]: With dead ends: 19118 [2024-11-14 02:43:35,720 INFO L226 Difference]: Without dead ends: 9086 [2024-11-14 02:43:35,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-14 02:43:35,746 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 190 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 02:43:35,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 149 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 02:43:35,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9086 states. [2024-11-14 02:43:36,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9086 to 9086. [2024-11-14 02:43:36,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9086 states, 9084 states have (on average 3.7977763099955966) internal successors, (34499), 9085 states have internal predecessors, (34499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9086 states to 9086 states and 34499 transitions. [2024-11-14 02:43:36,397 INFO L78 Accepts]: Start accepts. Automaton has 9086 states and 34499 transitions. Word has length 27 [2024-11-14 02:43:36,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:43:36,398 INFO L471 AbstractCegarLoop]: Abstraction has 9086 states and 34499 transitions. [2024-11-14 02:43:36,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:36,398 INFO L276 IsEmpty]: Start isEmpty. Operand 9086 states and 34499 transitions. [2024-11-14 02:43:36,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 02:43:36,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:36,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:36,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-14 02:43:36,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:36,624 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:43:36,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:36,625 INFO L85 PathProgramCache]: Analyzing trace with hash -893950014, now seen corresponding path program 1 times [2024-11-14 02:43:36,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:43:36,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580261024] [2024-11-14 02:43:36,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:43:36,626 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 [2024-11-14 02:43:36,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:43:36,628 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 02:43:36,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:43:36,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 02:43:36,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:43:36,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:43:36,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 02:43:36,901 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 02:43:36,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1580261024] [2024-11-14 02:43:36,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1580261024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:43:36,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:43:36,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 02:43:36,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379749985] [2024-11-14 02:43:36,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:43:36,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 02:43:36,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 02:43:36,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 02:43:36,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 02:43:36,902 INFO L87 Difference]: Start difference. First operand 9086 states and 34499 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:37,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:43:37,419 INFO L93 Difference]: Finished difference Result 9262 states and 35011 transitions. [2024-11-14 02:43:37,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 02:43:37,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-14 02:43:37,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:43:37,479 INFO L225 Difference]: With dead ends: 9262 [2024-11-14 02:43:37,480 INFO L226 Difference]: Without dead ends: 7150 [2024-11-14 02:43:37,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-14 02:43:37,485 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 216 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 02:43:37,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 222 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 02:43:37,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7150 states. [2024-11-14 02:43:37,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7150 to 7150. [2024-11-14 02:43:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7150 states, 7148 states have (on average 3.8784275321768327) internal successors, (27723), 7149 states have internal predecessors, (27723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7150 states to 7150 states and 27723 transitions. [2024-11-14 02:43:37,715 INFO L78 Accepts]: Start accepts. Automaton has 7150 states and 27723 transitions. Word has length 32 [2024-11-14 02:43:37,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:43:37,716 INFO L471 AbstractCegarLoop]: Abstraction has 7150 states and 27723 transitions. [2024-11-14 02:43:37,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:37,716 INFO L276 IsEmpty]: Start isEmpty. Operand 7150 states and 27723 transitions. [2024-11-14 02:43:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 02:43:37,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:37,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:37,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-14 02:43:37,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:37,936 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:43:37,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:37,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1926642653, now seen corresponding path program 1 times [2024-11-14 02:43:37,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:43:37,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864256169] [2024-11-14 02:43:37,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:43:37,937 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 [2024-11-14 02:43:37,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:43:37,939 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 02:43:37,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:43:38,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 02:43:38,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:43:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:43:38,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 02:43:38,181 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 02:43:38,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864256169] [2024-11-14 02:43:38,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864256169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:43:38,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:43:38,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 02:43:38,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347706731] [2024-11-14 02:43:38,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:43:38,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 02:43:38,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 02:43:38,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 02:43:38,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:43:38,183 INFO L87 Difference]: Start difference. First operand 7150 states and 27723 transitions. Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:38,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:43:38,280 INFO L93 Difference]: Finished difference Result 7150 states and 27723 transitions. [2024-11-14 02:43:38,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 02:43:38,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-14 02:43:38,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:43:38,362 INFO L225 Difference]: With dead ends: 7150 [2024-11-14 02:43:38,363 INFO L226 Difference]: Without dead ends: 7102 [2024-11-14 02:43:38,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 02:43:38,367 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 21 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 [2024-11-14 02:43:38,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 21 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 02:43:38,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7102 states. [2024-11-14 02:43:38,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7102 to 7102. [2024-11-14 02:43:38,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7102 states, 7101 states have (on average 3.8838191803971274) internal successors, (27579), 7101 states have internal predecessors, (27579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:38,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7102 states to 7102 states and 27579 transitions. [2024-11-14 02:43:38,788 INFO L78 Accepts]: Start accepts. Automaton has 7102 states and 27579 transitions. Word has length 39 [2024-11-14 02:43:38,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:43:38,788 INFO L471 AbstractCegarLoop]: Abstraction has 7102 states and 27579 transitions. [2024-11-14 02:43:38,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 7102 states and 27579 transitions. [2024-11-14 02:43:38,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 02:43:38,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:38,806 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:38,809 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-14 02:43:39,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:39,007 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:43:39,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:39,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1926641465, now seen corresponding path program 1 times [2024-11-14 02:43:39,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:43:39,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704929575] [2024-11-14 02:43:39,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 02:43:39,008 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 [2024-11-14 02:43:39,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:43:39,011 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 02:43:39,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 02:43:39,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 02:43:39,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:43:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:43:39,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 02:43:39,257 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 02:43:39,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704929575] [2024-11-14 02:43:39,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704929575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:43:39,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:43:39,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 02:43:39,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084681559] [2024-11-14 02:43:39,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:43:39,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 02:43:39,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 02:43:39,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 02:43:39,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 02:43:39,259 INFO L87 Difference]: Start difference. First operand 7102 states and 27579 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:39,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:43:39,641 INFO L93 Difference]: Finished difference Result 9974 states and 38449 transitions. [2024-11-14 02:43:39,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 02:43:39,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-14 02:43:39,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:43:39,721 INFO L225 Difference]: With dead ends: 9974 [2024-11-14 02:43:39,722 INFO L226 Difference]: Without dead ends: 5044 [2024-11-14 02:43:39,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-14 02:43:39,737 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 60 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:43:39,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 156 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:43:39,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5044 states. [2024-11-14 02:43:39,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5044 to 5044. [2024-11-14 02:43:39,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5044 states, 5043 states have (on average 3.748958953004164) internal successors, (18906), 5043 states have internal predecessors, (18906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5044 states to 5044 states and 18906 transitions. [2024-11-14 02:43:39,960 INFO L78 Accepts]: Start accepts. Automaton has 5044 states and 18906 transitions. Word has length 39 [2024-11-14 02:43:39,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:43:39,960 INFO L471 AbstractCegarLoop]: Abstraction has 5044 states and 18906 transitions. [2024-11-14 02:43:39,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand 5044 states and 18906 transitions. [2024-11-14 02:43:39,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 02:43:39,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:39,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:39,978 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-14 02:43:40,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:40,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:43:40,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:40,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1822036769, now seen corresponding path program 2 times [2024-11-14 02:43:40,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:43:40,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53958788] [2024-11-14 02:43:40,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 02:43:40,177 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 [2024-11-14 02:43:40,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:43:40,181 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 02:43:40,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:40,336 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-14 02:43:40,336 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:43:40,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 02:43:40,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:43:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:43:40,403 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 02:43:40,404 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 02:43:40,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53958788] [2024-11-14 02:43:40,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53958788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:43:40,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:43:40,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 02:43:40,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387692861] [2024-11-14 02:43:40,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:43:40,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:43:40,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 02:43:40,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:43:40,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:43:40,405 INFO L87 Difference]: Start difference. First operand 5044 states and 18906 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:43:40,693 INFO L93 Difference]: Finished difference Result 7172 states and 26510 transitions. [2024-11-14 02:43:40,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 02:43:40,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-14 02:43:40,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:43:40,770 INFO L225 Difference]: With dead ends: 7172 [2024-11-14 02:43:40,770 INFO L226 Difference]: Without dead ends: 3544 [2024-11-14 02:43:40,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 02:43:40,779 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 38 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:43:40,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 113 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:43:40,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3544 states. [2024-11-14 02:43:40,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3544 to 3544. [2024-11-14 02:43:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3544 states, 3543 states have (on average 3.6172734970364098) internal successors, (12816), 3543 states have internal predecessors, (12816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:40,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3544 states to 3544 states and 12816 transitions. [2024-11-14 02:43:40,967 INFO L78 Accepts]: Start accepts. Automaton has 3544 states and 12816 transitions. Word has length 39 [2024-11-14 02:43:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:43:40,967 INFO L471 AbstractCegarLoop]: Abstraction has 3544 states and 12816 transitions. [2024-11-14 02:43:40,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:40,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3544 states and 12816 transitions. [2024-11-14 02:43:40,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 02:43:40,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:40,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:40,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-14 02:43:41,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:41,187 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:43:41,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:41,189 INFO L85 PathProgramCache]: Analyzing trace with hash 2043120033, now seen corresponding path program 3 times [2024-11-14 02:43:41,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:43:41,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568758490] [2024-11-14 02:43:41,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 02:43:41,190 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 [2024-11-14 02:43:41,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:43:41,193 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 02:43:41,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:41,367 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-14 02:43:41,367 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:43:41,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 02:43:41,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:43:41,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:43:41,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 02:43:41,432 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 02:43:41,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568758490] [2024-11-14 02:43:41,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568758490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:43:41,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:43:41,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 02:43:41,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164968595] [2024-11-14 02:43:41,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:43:41,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 02:43:41,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 02:43:41,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 02:43:41,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 02:43:41,436 INFO L87 Difference]: Start difference. First operand 3544 states and 12816 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:41,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:43:41,703 INFO L93 Difference]: Finished difference Result 5048 states and 18144 transitions. [2024-11-14 02:43:41,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 02:43:41,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-14 02:43:41,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:43:41,753 INFO L225 Difference]: With dead ends: 5048 [2024-11-14 02:43:41,753 INFO L226 Difference]: Without dead ends: 1996 [2024-11-14 02:43:41,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 02:43:41,759 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 33 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 02:43:41,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 104 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 02:43:41,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2024-11-14 02:43:41,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1996. [2024-11-14 02:43:41,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1996 states, 1995 states have (on average 3.4526315789473685) internal successors, (6888), 1995 states have internal predecessors, (6888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:41,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 6888 transitions. [2024-11-14 02:43:41,854 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 6888 transitions. Word has length 39 [2024-11-14 02:43:41,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:43:41,855 INFO L471 AbstractCegarLoop]: Abstraction has 1996 states and 6888 transitions. [2024-11-14 02:43:41,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:41,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 6888 transitions. [2024-11-14 02:43:41,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 02:43:41,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:41,859 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:41,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-14 02:43:42,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:42,060 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:43:42,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:42,060 INFO L85 PathProgramCache]: Analyzing trace with hash -695359477, now seen corresponding path program 4 times [2024-11-14 02:43:42,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:43:42,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84666780] [2024-11-14 02:43:42,061 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 02:43:42,061 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 [2024-11-14 02:43:42,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:43:42,067 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 02:43:42,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:42,200 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 02:43:42,201 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:43:42,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 02:43:42,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:43:42,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:43:42,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 02:43:42,592 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 02:43:42,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84666780] [2024-11-14 02:43:42,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84666780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:43:42,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:43:42,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 02:43:42,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950803726] [2024-11-14 02:43:42,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:43:42,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 02:43:42,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 02:43:42,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 02:43:42,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-14 02:43:42,594 INFO L87 Difference]: Start difference. First operand 1996 states and 6888 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:43:43,033 INFO L93 Difference]: Finished difference Result 3228 states and 11083 transitions. [2024-11-14 02:43:43,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 02:43:43,033 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-14 02:43:43,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:43:43,090 INFO L225 Difference]: With dead ends: 3228 [2024-11-14 02:43:43,090 INFO L226 Difference]: Without dead ends: 1768 [2024-11-14 02:43:43,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-14 02:43:43,094 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 82 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 02:43:43,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 198 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 02:43:43,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2024-11-14 02:43:43,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1768. [2024-11-14 02:43:43,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1767 states have (on average 3.424448217317487) internal successors, (6051), 1767 states have internal predecessors, (6051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 6051 transitions. [2024-11-14 02:43:43,185 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 6051 transitions. Word has length 39 [2024-11-14 02:43:43,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:43:43,185 INFO L471 AbstractCegarLoop]: Abstraction has 1768 states and 6051 transitions. [2024-11-14 02:43:43,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:43,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 6051 transitions. [2024-11-14 02:43:43,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 02:43:43,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:43,191 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:43,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:43,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:43,395 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:43:43,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:43,396 INFO L85 PathProgramCache]: Analyzing trace with hash 926925417, now seen corresponding path program 5 times [2024-11-14 02:43:43,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:43:43,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549968860] [2024-11-14 02:43:43,396 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-14 02:43:43,397 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 [2024-11-14 02:43:43,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:43:43,399 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 02:43:43,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:43,530 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-14 02:43:43,530 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:43:43,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-14 02:43:43,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:43:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:43:43,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 02:43:43,970 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 02:43:43,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549968860] [2024-11-14 02:43:43,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549968860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:43:43,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:43:43,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 02:43:43,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018531208] [2024-11-14 02:43:43,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:43:43,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 02:43:43,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 02:43:43,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 02:43:43,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-14 02:43:43,971 INFO L87 Difference]: Start difference. First operand 1768 states and 6051 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:44,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:43:44,434 INFO L93 Difference]: Finished difference Result 2256 states and 7653 transitions. [2024-11-14 02:43:44,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 02:43:44,435 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-14 02:43:44,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:43:44,490 INFO L225 Difference]: With dead ends: 2256 [2024-11-14 02:43:44,490 INFO L226 Difference]: Without dead ends: 1840 [2024-11-14 02:43:44,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-14 02:43:44,493 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 91 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 02:43:44,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 212 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 02:43:44,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2024-11-14 02:43:44,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1768. [2024-11-14 02:43:44,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1767 states have (on average 3.4142614601018675) internal successors, (6033), 1767 states have internal predecessors, (6033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 6033 transitions. [2024-11-14 02:43:44,607 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 6033 transitions. Word has length 39 [2024-11-14 02:43:44,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:43:44,608 INFO L471 AbstractCegarLoop]: Abstraction has 1768 states and 6033 transitions. [2024-11-14 02:43:44,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:44,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 6033 transitions. [2024-11-14 02:43:44,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 02:43:44,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:44,612 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:44,616 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:44,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:44,816 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:43:44,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:44,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1770739001, now seen corresponding path program 6 times [2024-11-14 02:43:44,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:43:44,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022116215] [2024-11-14 02:43:44,817 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-14 02:43:44,817 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 [2024-11-14 02:43:44,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:43:44,819 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 02:43:44,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-14 02:43:44,935 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-14 02:43:44,935 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 02:43:44,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-14 02:43:44,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 02:43:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 02:43:45,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 02:43:45,501 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 02:43:45,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022116215] [2024-11-14 02:43:45,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022116215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 02:43:45,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 02:43:45,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 02:43:45,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426750799] [2024-11-14 02:43:45,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 02:43:45,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 02:43:45,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 02:43:45,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 02:43:45,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-14 02:43:45,502 INFO L87 Difference]: Start difference. First operand 1768 states and 6033 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:45,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 02:43:45,944 INFO L93 Difference]: Finished difference Result 3076 states and 10370 transitions. [2024-11-14 02:43:45,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 02:43:45,944 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2024-11-14 02:43:45,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 02:43:45,995 INFO L225 Difference]: With dead ends: 3076 [2024-11-14 02:43:45,995 INFO L226 Difference]: Without dead ends: 1800 [2024-11-14 02:43:45,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-11-14 02:43:45,999 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 155 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 02:43:45,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 189 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 02:43:46,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2024-11-14 02:43:46,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 1480. [2024-11-14 02:43:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1479 states have (on average 3.2738336713995944) internal successors, (4842), 1479 states have internal predecessors, (4842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:46,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 4842 transitions. [2024-11-14 02:43:46,099 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 4842 transitions. Word has length 39 [2024-11-14 02:43:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 02:43:46,100 INFO L471 AbstractCegarLoop]: Abstraction has 1480 states and 4842 transitions. [2024-11-14 02:43:46,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 02:43:46,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 4842 transitions. [2024-11-14 02:43:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 02:43:46,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 02:43:46,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:46,108 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-14 02:43:46,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:46,306 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-14 02:43:46,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 02:43:46,307 INFO L85 PathProgramCache]: Analyzing trace with hash 976943115, now seen corresponding path program 7 times [2024-11-14 02:43:46,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 02:43:46,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390121256] [2024-11-14 02:43:46,307 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-14 02:43:46,307 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 [2024-11-14 02:43:46,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 02:43:46,309 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-14 02:43:46,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-14 02:43:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 02:43:46,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 02:43:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 02:43:46,606 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2024-11-14 02:43:46,606 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 02:43:46,607 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-14 02:43:46,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2024-11-14 02:43:46,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2024-11-14 02:43:46,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-11-14 02:43:46,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-11-14 02:43:46,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 8 remaining) [2024-11-14 02:43:46,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2024-11-14 02:43:46,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2024-11-14 02:43:46,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-14 02:43:46,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-14 02:43:46,814 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1] [2024-11-14 02:43:46,935 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 02:43:46,936 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 02:43:46,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 02:43:46 BasicIcfg [2024-11-14 02:43:46,939 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 02:43:46,939 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 02:43:46,940 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 02:43:46,940 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 02:43:46,941 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 02:43:19" (3/4) ... [2024-11-14 02:43:46,942 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 02:43:46,943 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 02:43:46,944 INFO L158 Benchmark]: Toolchain (without parser) took 29433.47ms. Allocated memory was 117.4MB in the beginning and 10.0GB in the end (delta: 9.9GB). Free memory was 90.9MB in the beginning and 8.8GB in the end (delta: -8.7GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-14 02:43:46,944 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 117.4MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 02:43:46,945 INFO L158 Benchmark]: CACSL2BoogieTranslator took 615.32ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 66.4MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 02:43:46,945 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.05ms. Allocated memory is still 117.4MB. Free memory was 66.4MB in the beginning and 64.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 02:43:46,945 INFO L158 Benchmark]: Boogie Preprocessor took 34.72ms. Allocated memory is still 117.4MB. Free memory was 64.2MB in the beginning and 62.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 02:43:46,946 INFO L158 Benchmark]: RCFGBuilder took 1065.10ms. Allocated memory is still 117.4MB. Free memory was 62.3MB in the beginning and 81.9MB in the end (delta: -19.6MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2024-11-14 02:43:46,946 INFO L158 Benchmark]: TraceAbstraction took 27626.87ms. Allocated memory was 117.4MB in the beginning and 10.0GB in the end (delta: 9.9GB). Free memory was 81.2MB in the beginning and 8.8GB in the end (delta: -8.8GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-11-14 02:43:46,946 INFO L158 Benchmark]: Witness Printer took 4.00ms. Allocated memory is still 10.0GB. Free memory was 8.8GB in the beginning and 8.8GB in the end (delta: 218.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 02:43:46,948 INFO L338 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 117.4MB. Free memory is still 84.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 615.32ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 66.4MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.05ms. Allocated memory is still 117.4MB. Free memory was 66.4MB in the beginning and 64.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.72ms. Allocated memory is still 117.4MB. Free memory was 64.2MB in the beginning and 62.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1065.10ms. Allocated memory is still 117.4MB. Free memory was 62.3MB in the beginning and 81.9MB in the end (delta: -19.6MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. * TraceAbstraction took 27626.87ms. Allocated memory was 117.4MB in the beginning and 10.0GB in the end (delta: 9.9GB). Free memory was 81.2MB in the beginning and 8.8GB in the end (delta: -8.8GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 4.00ms. Allocated memory is still 10.0GB. Free memory was 8.8GB in the beginning and 8.8GB in the end (delta: 218.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t1057; [L870] FCALL, FORK 0 pthread_create(&t1057, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1057=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1058; [L872] FCALL, FORK 0 pthread_create(&t1058, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1057=0, t1058=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1059; [L874] FCALL, FORK 0 pthread_create(&t1059, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1057=0, t1058=1, t1059=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1060; [L876] FCALL, FORK 0 pthread_create(&t1060, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1057=0, t1058=1, t1059=2, t1060=3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=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 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L802] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L822] 4 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L825] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L828] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1057=0, t1058=1, t1059=2, t1060=3, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L884] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L886] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1057=0, t1058=1, t1059=2, t1060=3, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L889] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1057=0, t1058=1, t1059=2, t1060=3, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L17] 0 __assert_fail ("0", "mix040_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 89 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 27.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.3s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1126 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1126 mSDsluCounter, 1546 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1154 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2242 IncrementalHoareTripleChecker+Invalid, 2310 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 392 mSDtfsCounter, 2242 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51629occurred in iteration=0, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 392 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 414 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 363 ConstructedInterpolants, 0 QuantifiedInterpolants, 1513 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1568 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 [2024-11-14 02:43:46,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa63bb81-7a75-48da-b3c9-93b5f8a5d8a6/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample