./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.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_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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 ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:40:10,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:40:10,460 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-13 23:40:10,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:40:10,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:40:10,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:40:10,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:40:10,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:40:10,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:40:10,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:40:10,507 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:40:10,507 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:40:10,507 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:40:10,507 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-13 23:40:10,508 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:40:10,508 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:40:10,509 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-13 23:40:10,509 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-13 23:40:10,509 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:40:10,510 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-13 23:40:10,510 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-13 23:40:10,510 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-13 23:40:10,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 23:40:10,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 23:40:10,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:40:10,511 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:40:10,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 23:40:10,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:40:10,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:40:10,511 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 23:40:10,511 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 23:40:10,511 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 23:40:10,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:40:10,511 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 23:40:10,511 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:40:10,511 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 23:40:10,511 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:40:10,511 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:40:10,512 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:40:10,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:40:10,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:40:10,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:40:10,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:40:10,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:40:10,512 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-13 23:40:10,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 23:40:10,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:40:10,512 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:40:10,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 23:40:10,513 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_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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 -> ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 [2024-11-13 23:40:10,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:40:10,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:40:10,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:40:10,865 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:40:10,866 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:40:10,867 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i Unable to find full path for "g++" [2024-11-13 23:40:12,846 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:40:13,201 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:40:13,201 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2024-11-13 23:40:13,215 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/data/ed332e07c/74ab2afcc3ee48518d9f538bdf3fb682/FLAG91e2cc7db [2024-11-13 23:40:13,413 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/data/ed332e07c/74ab2afcc3ee48518d9f538bdf3fb682 [2024-11-13 23:40:13,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:40:13,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:40:13,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:40:13,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:40:13,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:40:13,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:40:13" (1/1) ... [2024-11-13 23:40:13,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@238a1e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:13, skipping insertion in model container [2024-11-13 23:40:13,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:40:13" (1/1) ... [2024-11-13 23:40:13,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:40:13,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:40:13,856 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:40:13,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:40:13,955 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:40:13,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:13 WrapperNode [2024-11-13 23:40:13,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:40:13,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:40:13,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:40:13,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:40:13,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:13" (1/1) ... [2024-11-13 23:40:13,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:13" (1/1) ... [2024-11-13 23:40:14,002 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-11-13 23:40:14,002 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:40:14,003 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:40:14,003 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:40:14,003 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:40:14,011 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:13" (1/1) ... [2024-11-13 23:40:14,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:13" (1/1) ... [2024-11-13 23:40:14,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:13" (1/1) ... [2024-11-13 23:40:14,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:13" (1/1) ... [2024-11-13 23:40:14,023 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:13" (1/1) ... [2024-11-13 23:40:14,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:13" (1/1) ... [2024-11-13 23:40:14,027 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:13" (1/1) ... [2024-11-13 23:40:14,028 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:13" (1/1) ... [2024-11-13 23:40:14,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:40:14,032 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:40:14,032 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:40:14,032 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:40:14,033 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:13" (1/1) ... [2024-11-13 23:40:14,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:40:14,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:40:14,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:40:14,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:40:14,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 23:40:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:40:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 23:40:14,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 23:40:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 23:40:14,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 23:40:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 23:40:14,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 23:40:14,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 23:40:14,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 23:40:14,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:40:14,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:40:14,098 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 23:40:14,238 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:40:14,240 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:40:14,639 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 23:40:14,639 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:40:14,921 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:40:14,923 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 23:40:14,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:40:14 BoogieIcfgContainer [2024-11-13 23:40:14,924 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:40:14,926 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:40:14,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:40:14,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:40:14,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:40:13" (1/3) ... [2024-11-13 23:40:14,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a3ce52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:40:14, skipping insertion in model container [2024-11-13 23:40:14,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:13" (2/3) ... [2024-11-13 23:40:14,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36a3ce52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:40:14, skipping insertion in model container [2024-11-13 23:40:14,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:40:14" (3/3) ... [2024-11-13 23:40:14,938 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2024-11-13 23:40:14,955 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:40:14,957 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG safe004_power.opt_pso.opt_rmo.opt.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-13 23:40:14,957 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 23:40:15,033 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 23:40:15,068 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 52 places, 44 transitions, 100 flow [2024-11-13 23:40:15,484 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5763 states, 5758 states have (on average 3.633379645710316) internal successors, (20921), 5762 states have internal predecessors, (20921), 0 states have call successors, (0), 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-13 23:40:15,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:40:15,532 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;@6311a887, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:40:15,532 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-13 23:40:15,552 INFO L276 IsEmpty]: Start isEmpty. Operand has 5763 states, 5758 states have (on average 3.633379645710316) internal successors, (20921), 5762 states have internal predecessors, (20921), 0 states have call successors, (0), 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-13 23:40:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 23:40:15,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:15,561 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 23:40:15,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:15,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:15,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1414063623, now seen corresponding path program 1 times [2024-11-13 23:40:15,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:40:15,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072890835] [2024-11-13 23:40:15,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:15,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:40:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:16,172 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-13 23:40:16,172 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:40:16,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072890835] [2024-11-13 23:40:16,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072890835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:16,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:16,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 23:40:16,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367252399] [2024-11-13 23:40:16,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:16,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:40:16,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:40:16,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:40:16,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:40:16,216 INFO L87 Difference]: Start difference. First operand has 5763 states, 5758 states have (on average 3.633379645710316) internal successors, (20921), 5762 states have internal predecessors, (20921), 0 states have call successors, (0), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-13 23:40:16,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:16,598 INFO L93 Difference]: Finished difference Result 6890 states and 24764 transitions. [2024-11-13 23:40:16,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:40:16,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-13 23:40:16,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:16,696 INFO L225 Difference]: With dead ends: 6890 [2024-11-13 23:40:16,696 INFO L226 Difference]: Without dead ends: 4573 [2024-11-13 23:40:16,713 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-13 23:40:16,717 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:16,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 31 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:40:16,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4573 states. [2024-11-13 23:40:17,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4573 to 4573. [2024-11-13 23:40:17,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4573 states, 4571 states have (on average 3.4732006125574273) internal successors, (15876), 4572 states have internal predecessors, (15876), 0 states have call successors, (0), 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-13 23:40:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 15876 transitions. [2024-11-13 23:40:17,125 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 15876 transitions. Word has length 6 [2024-11-13 23:40:17,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:17,126 INFO L471 AbstractCegarLoop]: Abstraction has 4573 states and 15876 transitions. [2024-11-13 23:40:17,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-13 23:40:17,127 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 15876 transitions. [2024-11-13 23:40:17,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 23:40:17,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:17,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:40:17,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 23:40:17,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:17,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:17,145 INFO L85 PathProgramCache]: Analyzing trace with hash -533648435, now seen corresponding path program 1 times [2024-11-13 23:40:17,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:40:17,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477067704] [2024-11-13 23:40:17,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:17,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:40:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:17,313 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-13 23:40:17,313 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:40:17,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477067704] [2024-11-13 23:40:17,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477067704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:17,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:17,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 23:40:17,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295133310] [2024-11-13 23:40:17,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:17,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:40:17,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:40:17,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:40:17,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:40:17,318 INFO L87 Difference]: Start difference. First operand 4573 states and 15876 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:17,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:17,460 INFO L93 Difference]: Finished difference Result 4573 states and 15876 transitions. [2024-11-13 23:40:17,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:40:17,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-13 23:40:17,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:17,499 INFO L225 Difference]: With dead ends: 4573 [2024-11-13 23:40:17,499 INFO L226 Difference]: Without dead ends: 3544 [2024-11-13 23:40:17,504 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-13 23:40:17,507 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:17,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 15 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:40:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3544 states. [2024-11-13 23:40:17,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3544 to 3544. [2024-11-13 23:40:17,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3544 states, 3543 states have (on average 3.4436917866215073) internal successors, (12201), 3543 states have internal predecessors, (12201), 0 states have call successors, (0), 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-13 23:40:17,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3544 states to 3544 states and 12201 transitions. [2024-11-13 23:40:17,715 INFO L78 Accepts]: Start accepts. Automaton has 3544 states and 12201 transitions. Word has length 15 [2024-11-13 23:40:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:17,716 INFO L471 AbstractCegarLoop]: Abstraction has 3544 states and 12201 transitions. [2024-11-13 23:40:17,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3544 states and 12201 transitions. [2024-11-13 23:40:17,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 23:40:17,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:17,721 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:40:17,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 23:40:17,722 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:17,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:17,727 INFO L85 PathProgramCache]: Analyzing trace with hash -533646914, now seen corresponding path program 1 times [2024-11-13 23:40:17,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:40:17,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2455786] [2024-11-13 23:40:17,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:17,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:40:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:18,266 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-13 23:40:18,267 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:40:18,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2455786] [2024-11-13 23:40:18,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2455786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:18,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:18,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 23:40:18,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303357182] [2024-11-13 23:40:18,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:18,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:40:18,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:40:18,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:40:18,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:40:18,271 INFO L87 Difference]: Start difference. First operand 3544 states and 12201 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:18,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:18,473 INFO L93 Difference]: Finished difference Result 5288 states and 17783 transitions. [2024-11-13 23:40:18,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:40:18,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-13 23:40:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:18,499 INFO L225 Difference]: With dead ends: 5288 [2024-11-13 23:40:18,500 INFO L226 Difference]: Without dead ends: 2544 [2024-11-13 23:40:18,505 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-13 23:40:18,506 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:18,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 33 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:40:18,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2024-11-13 23:40:18,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 2544. [2024-11-13 23:40:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 2543 states have (on average 3.2249311836413685) internal successors, (8201), 2543 states have internal predecessors, (8201), 0 states have call successors, (0), 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-13 23:40:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 8201 transitions. [2024-11-13 23:40:18,613 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 8201 transitions. Word has length 15 [2024-11-13 23:40:18,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:18,613 INFO L471 AbstractCegarLoop]: Abstraction has 2544 states and 8201 transitions. [2024-11-13 23:40:18,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 8201 transitions. [2024-11-13 23:40:18,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 23:40:18,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:18,622 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] [2024-11-13 23:40:18,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 23:40:18,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:18,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:18,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1509822087, now seen corresponding path program 1 times [2024-11-13 23:40:18,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:40:18,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104535984] [2024-11-13 23:40:18,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:18,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:40:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:19,063 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-13 23:40:19,064 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:40:19,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104535984] [2024-11-13 23:40:19,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104535984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:19,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:19,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:40:19,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240006320] [2024-11-13 23:40:19,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:19,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:40:19,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:40:19,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:40:19,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:40:19,066 INFO L87 Difference]: Start difference. First operand 2544 states and 8201 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:19,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:19,303 INFO L93 Difference]: Finished difference Result 3088 states and 9733 transitions. [2024-11-13 23:40:19,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:40:19,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-13 23:40:19,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:19,318 INFO L225 Difference]: With dead ends: 3088 [2024-11-13 23:40:19,318 INFO L226 Difference]: Without dead ends: 1344 [2024-11-13 23:40:19,323 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-13 23:40:19,325 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 94 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:19,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 43 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:40:19,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2024-11-13 23:40:19,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1344. [2024-11-13 23:40:19,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1343 states have (on average 2.979151154132539) internal successors, (4001), 1343 states have internal predecessors, (4001), 0 states have call successors, (0), 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-13 23:40:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 4001 transitions. [2024-11-13 23:40:19,375 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 4001 transitions. Word has length 20 [2024-11-13 23:40:19,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:19,375 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 4001 transitions. [2024-11-13 23:40:19,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 4001 transitions. [2024-11-13 23:40:19,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 23:40:19,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:19,379 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-13 23:40:19,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 23:40:19,380 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:19,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:19,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1751635675, now seen corresponding path program 1 times [2024-11-13 23:40:19,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:40:19,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019448605] [2024-11-13 23:40:19,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:19,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:40:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:19,863 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-13 23:40:19,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:40:19,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019448605] [2024-11-13 23:40:19,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019448605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:19,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:19,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:40:19,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755504588] [2024-11-13 23:40:19,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:19,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:40:19,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:40:19,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:40:19,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:40:19,866 INFO L87 Difference]: Start difference. First operand 1344 states and 4001 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:20,083 INFO L93 Difference]: Finished difference Result 1408 states and 4153 transitions. [2024-11-13 23:40:20,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:40:20,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-13 23:40:20,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:20,092 INFO L225 Difference]: With dead ends: 1408 [2024-11-13 23:40:20,093 INFO L226 Difference]: Without dead ends: 864 [2024-11-13 23:40:20,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:40:20,095 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 112 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:20,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 34 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:40:20,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-11-13 23:40:20,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2024-11-13 23:40:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 863 states have (on average 2.9675550405561992) internal successors, (2561), 863 states have internal predecessors, (2561), 0 states have call successors, (0), 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-13 23:40:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 2561 transitions. [2024-11-13 23:40:20,125 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 2561 transitions. Word has length 25 [2024-11-13 23:40:20,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:20,126 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 2561 transitions. [2024-11-13 23:40:20,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:20,126 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 2561 transitions. [2024-11-13 23:40:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 23:40:20,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:20,129 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] [2024-11-13 23:40:20,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 23:40:20,129 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:20,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:20,130 INFO L85 PathProgramCache]: Analyzing trace with hash 137878860, now seen corresponding path program 1 times [2024-11-13 23:40:20,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:40:20,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719903521] [2024-11-13 23:40:20,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:20,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:40:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:21,135 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-13 23:40:21,137 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:40:21,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719903521] [2024-11-13 23:40:21,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719903521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:21,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:21,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 23:40:21,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199481043] [2024-11-13 23:40:21,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:21,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 23:40:21,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:40:21,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 23:40:21,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:40:21,138 INFO L87 Difference]: Start difference. First operand 864 states and 2561 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:21,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:21,784 INFO L93 Difference]: Finished difference Result 2026 states and 5889 transitions. [2024-11-13 23:40:21,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 23:40:21,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-13 23:40:21,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:21,795 INFO L225 Difference]: With dead ends: 2026 [2024-11-13 23:40:21,795 INFO L226 Difference]: Without dead ends: 1282 [2024-11-13 23:40:21,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2024-11-13 23:40:21,798 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 65 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:21,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 153 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 23:40:21,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2024-11-13 23:40:21,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 864. [2024-11-13 23:40:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 863 states have (on average 2.895712630359212) internal successors, (2499), 863 states have internal predecessors, (2499), 0 states have call successors, (0), 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-13 23:40:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 2499 transitions. [2024-11-13 23:40:21,831 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 2499 transitions. Word has length 30 [2024-11-13 23:40:21,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:21,832 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 2499 transitions. [2024-11-13 23:40:21,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:21,832 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 2499 transitions. [2024-11-13 23:40:21,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 23:40:21,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:21,835 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] [2024-11-13 23:40:21,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 23:40:21,835 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:21,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:21,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1186076448, now seen corresponding path program 2 times [2024-11-13 23:40:21,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:40:21,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181129637] [2024-11-13 23:40:21,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:21,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:40:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:22,758 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-13 23:40:22,758 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:40:22,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181129637] [2024-11-13 23:40:22,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181129637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:22,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:22,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 23:40:22,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909639839] [2024-11-13 23:40:22,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:22,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 23:40:22,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:40:22,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 23:40:22,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:40:22,761 INFO L87 Difference]: Start difference. First operand 864 states and 2499 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:23,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:23,176 INFO L93 Difference]: Finished difference Result 1546 states and 4401 transitions. [2024-11-13 23:40:23,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 23:40:23,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-13 23:40:23,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:23,188 INFO L225 Difference]: With dead ends: 1546 [2024-11-13 23:40:23,188 INFO L226 Difference]: Without dead ends: 1252 [2024-11-13 23:40:23,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-13 23:40:23,190 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 59 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:23,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 136 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 23:40:23,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2024-11-13 23:40:23,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 864. [2024-11-13 23:40:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 863 states have (on average 2.8609501738122827) internal successors, (2469), 863 states have internal predecessors, (2469), 0 states have call successors, (0), 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-13 23:40:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 2469 transitions. [2024-11-13 23:40:23,229 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 2469 transitions. Word has length 30 [2024-11-13 23:40:23,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:23,230 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 2469 transitions. [2024-11-13 23:40:23,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:23,230 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 2469 transitions. [2024-11-13 23:40:23,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 23:40:23,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:23,233 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] [2024-11-13 23:40:23,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 23:40:23,234 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:23,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:23,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1961661492, now seen corresponding path program 3 times [2024-11-13 23:40:23,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:40:23,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810116925] [2024-11-13 23:40:23,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:23,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:40:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:23,760 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-13 23:40:23,761 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:40:23,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810116925] [2024-11-13 23:40:23,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810116925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:23,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:23,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:40:23,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452022490] [2024-11-13 23:40:23,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:23,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:40:23,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:40:23,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:40:23,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:40:23,764 INFO L87 Difference]: Start difference. First operand 864 states and 2469 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:23,946 INFO L93 Difference]: Finished difference Result 1088 states and 3077 transitions. [2024-11-13 23:40:23,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:40:23,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-13 23:40:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:23,952 INFO L225 Difference]: With dead ends: 1088 [2024-11-13 23:40:23,952 INFO L226 Difference]: Without dead ends: 454 [2024-11-13 23:40:23,954 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-13 23:40:23,954 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 20 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:23,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 70 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:40:23,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-13 23:40:23,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2024-11-13 23:40:23,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 2.750551876379691) internal successors, (1246), 453 states have internal predecessors, (1246), 0 states have call successors, (0), 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-13 23:40:23,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1246 transitions. [2024-11-13 23:40:23,969 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1246 transitions. Word has length 30 [2024-11-13 23:40:23,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:23,969 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 1246 transitions. [2024-11-13 23:40:23,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:23,970 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1246 transitions. [2024-11-13 23:40:23,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 23:40:23,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:23,971 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] [2024-11-13 23:40:23,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 23:40:23,972 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:23,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:23,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1725670964, now seen corresponding path program 4 times [2024-11-13 23:40:23,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:40:23,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615745553] [2024-11-13 23:40:23,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:23,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:40:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:24,719 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-13 23:40:24,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:40:24,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615745553] [2024-11-13 23:40:24,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615745553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:24,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:24,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 23:40:24,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171578004] [2024-11-13 23:40:24,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:24,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 23:40:24,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:40:24,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 23:40:24,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:40:24,721 INFO L87 Difference]: Start difference. First operand 454 states and 1246 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:24,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:24,939 INFO L93 Difference]: Finished difference Result 782 states and 2160 transitions. [2024-11-13 23:40:24,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:40:24,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-13 23:40:24,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:24,945 INFO L225 Difference]: With dead ends: 782 [2024-11-13 23:40:24,946 INFO L226 Difference]: Without dead ends: 418 [2024-11-13 23:40:24,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-13 23:40:24,947 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 46 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:24,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 54 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:40:24,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-13 23:40:24,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 394. [2024-11-13 23:40:24,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 2.712468193384224) internal successors, (1066), 393 states have internal predecessors, (1066), 0 states have call successors, (0), 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-13 23:40:24,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1066 transitions. [2024-11-13 23:40:24,961 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 1066 transitions. Word has length 30 [2024-11-13 23:40:24,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:24,961 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 1066 transitions. [2024-11-13 23:40:24,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:24,961 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 1066 transitions. [2024-11-13 23:40:24,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 23:40:24,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:24,963 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] [2024-11-13 23:40:24,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 23:40:24,963 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:24,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:24,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1585539540, now seen corresponding path program 5 times [2024-11-13 23:40:24,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:40:24,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695887898] [2024-11-13 23:40:24,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:24,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:40:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:27,349 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-13 23:40:27,349 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-13 23:40:27,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695887898] [2024-11-13 23:40:27,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695887898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:27,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:27,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 23:40:27,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753343073] [2024-11-13 23:40:27,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:27,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 23:40:27,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-13 23:40:27,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 23:40:27,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 23:40:27,351 INFO L87 Difference]: Start difference. First operand 394 states and 1066 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:28,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:28,152 INFO L93 Difference]: Finished difference Result 614 states and 1654 transitions. [2024-11-13 23:40:28,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 23:40:28,154 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-13 23:40:28,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:28,159 INFO L225 Difference]: With dead ends: 614 [2024-11-13 23:40:28,159 INFO L226 Difference]: Without dead ends: 274 [2024-11-13 23:40:28,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2024-11-13 23:40:28,160 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 108 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:28,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 168 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 23:40:28,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-13 23:40:28,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-11-13 23:40:28,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 2.542124542124542) internal successors, (694), 273 states have internal predecessors, (694), 0 states have call successors, (0), 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-13 23:40:28,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 694 transitions. [2024-11-13 23:40:28,174 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 694 transitions. Word has length 30 [2024-11-13 23:40:28,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:28,175 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 694 transitions. [2024-11-13 23:40:28,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 694 transitions. [2024-11-13 23:40:28,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 23:40:28,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:28,177 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] [2024-11-13 23:40:28,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 23:40:28,177 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:28,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:28,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1507781076, now seen corresponding path program 6 times [2024-11-13 23:40:28,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:40:28,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172577500] [2024-11-13 23:40:28,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:28,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:40:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:40:28,306 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 23:40:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:40:28,471 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-13 23:40:28,472 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 23:40:28,473 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-13 23:40:28,475 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-13 23:40:28,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-13 23:40:28,476 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-13 23:40:28,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-13 23:40:28,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-13 23:40:28,478 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-13 23:40:28,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 23:40:28,481 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2024-11-13 23:40:28,579 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 23:40:28,580 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 23:40:28,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 11:40:28 BasicIcfg [2024-11-13 23:40:28,583 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 23:40:28,583 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 23:40:28,584 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 23:40:28,584 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 23:40:28,584 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:40:14" (3/4) ... [2024-11-13 23:40:28,586 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 23:40:28,587 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 23:40:28,588 INFO L158 Benchmark]: Toolchain (without parser) took 15171.20ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 117.9MB in the beginning and 459.8MB in the end (delta: -341.9MB). Peak memory consumption was 143.8MB. Max. memory is 16.1GB. [2024-11-13 23:40:28,588 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 142.6MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:40:28,588 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.10ms. Allocated memory is still 142.6MB. Free memory was 117.7MB in the beginning and 94.6MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 23:40:28,589 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.83ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:40:28,589 INFO L158 Benchmark]: Boogie Preprocessor took 28.42ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 90.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:40:28,589 INFO L158 Benchmark]: RCFGBuilder took 891.70ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 91.4MB in the end (delta: -1.1MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. [2024-11-13 23:40:28,590 INFO L158 Benchmark]: TraceAbstraction took 13656.53ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 90.9MB in the beginning and 459.8MB in the end (delta: -368.9MB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. [2024-11-13 23:40:28,590 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 629.1MB. Free memory was 459.8MB in the beginning and 459.8MB in the end (delta: 45.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:40:28,592 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.36ms. Allocated memory is still 142.6MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 538.10ms. Allocated memory is still 142.6MB. Free memory was 117.7MB in the beginning and 94.6MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.83ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.42ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 90.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 891.70ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 91.4MB in the end (delta: -1.1MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. * TraceAbstraction took 13656.53ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 90.9MB in the beginning and 459.8MB in the end (delta: -368.9MB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 629.1MB. Free memory was 459.8MB in the beginning and 459.8MB in the end (delta: 45.7kB). 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1876; [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1876=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L820] 0 pthread_t t1877; [L821] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1876=-2, t1877=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L822] 0 pthread_t t1878; [L823] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876=-2, t1877=-1, t1878=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L851] 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}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L17] 0 __assert_fail ("0", "safe004_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - 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: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 823]: 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: 819]: 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: 821]: 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 7 procedures, 68 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 605 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 605 mSDsluCounter, 737 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 551 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1313 IncrementalHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 186 mSDtfsCounter, 1313 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5763occurred in iteration=0, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 830 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 1479 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 23:40:28,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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 ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:40:31,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:40:31,446 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-13 23:40:31,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:40:31,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:40:31,515 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:40:31,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:40:31,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:40:31,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:40:31,518 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:40:31,519 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:40:31,519 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:40:31,520 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:40:31,520 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:40:31,520 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:40:31,520 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:40:31,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 23:40:31,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 23:40:31,521 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:40:31,521 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:40:31,521 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 23:40:31,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:40:31,522 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:40:31,522 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 23:40:31,522 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 23:40:31,522 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 23:40:31,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:40:31,522 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 23:40:31,522 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 23:40:31,523 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:40:31,523 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 23:40:31,523 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 23:40:31,523 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:40:31,523 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:40:31,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:40:31,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 23:40:31,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:40:31,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:40:31,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:40:31,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:40:31,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:40:31,525 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-13 23:40:31,525 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 23:40:31,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:40:31,525 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:40:31,525 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_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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 -> ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 [2024-11-13 23:40:31,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:40:31,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:40:31,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:40:31,837 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:40:31,838 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:40:31,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i Unable to find full path for "g++" [2024-11-13 23:40:33,801 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:40:34,116 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:40:34,116 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2024-11-13 23:40:34,133 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/data/619366d7d/48164458d70b47198bf0b8ed078f6aa4/FLAG28fc03aa0 [2024-11-13 23:40:34,149 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/data/619366d7d/48164458d70b47198bf0b8ed078f6aa4 [2024-11-13 23:40:34,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:40:34,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:40:34,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:40:34,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:40:34,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:40:34,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:40:34" (1/1) ... [2024-11-13 23:40:34,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f3e866f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:34, skipping insertion in model container [2024-11-13 23:40:34,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:40:34" (1/1) ... [2024-11-13 23:40:34,220 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:40:34,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:40:34,729 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:40:34,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:40:34,833 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:40:34,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:34 WrapperNode [2024-11-13 23:40:34,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:40:34,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:40:34,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:40:34,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:40:34,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:34" (1/1) ... [2024-11-13 23:40:34,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:34" (1/1) ... [2024-11-13 23:40:34,887 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-11-13 23:40:34,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:40:34,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:40:34,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:40:34,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:40:34,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:34" (1/1) ... [2024-11-13 23:40:34,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:34" (1/1) ... [2024-11-13 23:40:34,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:34" (1/1) ... [2024-11-13 23:40:34,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:34" (1/1) ... [2024-11-13 23:40:34,920 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:34" (1/1) ... [2024-11-13 23:40:34,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:34" (1/1) ... [2024-11-13 23:40:34,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:34" (1/1) ... [2024-11-13 23:40:34,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:34" (1/1) ... [2024-11-13 23:40:34,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:40:34,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:40:34,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:40:34,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:40:34,938 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:34" (1/1) ... [2024-11-13 23:40:34,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:40:34,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:40:34,982 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:40:34,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:40:35,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 23:40:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:40:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-13 23:40:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-13 23:40:35,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-13 23:40:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-13 23:40:35,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-13 23:40:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-13 23:40:35,016 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-13 23:40:35,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 23:40:35,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:40:35,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:40:35,019 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 23:40:35,213 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:40:35,214 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:40:35,628 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 23:40:35,628 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:40:35,964 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:40:35,965 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-13 23:40:35,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:40:35 BoogieIcfgContainer [2024-11-13 23:40:35,966 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:40:35,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:40:35,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:40:35,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:40:35,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:40:34" (1/3) ... [2024-11-13 23:40:35,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a98a1db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:40:35, skipping insertion in model container [2024-11-13 23:40:35,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:40:34" (2/3) ... [2024-11-13 23:40:35,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a98a1db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:40:35, skipping insertion in model container [2024-11-13 23:40:35,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:40:35" (3/3) ... [2024-11-13 23:40:35,977 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2024-11-13 23:40:36,017 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:40:36,018 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG safe004_power.opt_pso.opt_rmo.opt.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-13 23:40:36,018 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 23:40:36,092 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-13 23:40:36,126 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 52 places, 44 transitions, 100 flow [2024-11-13 23:40:36,584 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5763 states, 5758 states have (on average 3.633379645710316) internal successors, (20921), 5762 states have internal predecessors, (20921), 0 states have call successors, (0), 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-13 23:40:36,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:40:36,637 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;@62f8d5d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:40:36,638 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-13 23:40:36,658 INFO L276 IsEmpty]: Start isEmpty. Operand has 5763 states, 5758 states have (on average 3.633379645710316) internal successors, (20921), 5762 states have internal predecessors, (20921), 0 states have call successors, (0), 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-13 23:40:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 23:40:36,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:36,665 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 23:40:36,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:36,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:36,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1353053513, now seen corresponding path program 1 times [2024-11-13 23:40:36,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:36,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914181915] [2024-11-13 23:40:36,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:36,687 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-13 23:40:36,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:36,693 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:36,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:36,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 23:40:36,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:36,883 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-13 23:40:36,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:40:36,884 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:40:36,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914181915] [2024-11-13 23:40:36,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914181915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:36,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:36,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 23:40:36,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758753921] [2024-11-13 23:40:36,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:36,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:40:36,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:40:36,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:40:36,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:40:36,943 INFO L87 Difference]: Start difference. First operand has 5763 states, 5758 states have (on average 3.633379645710316) internal successors, (20921), 5762 states have internal predecessors, (20921), 0 states have call successors, (0), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-13 23:40:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:37,258 INFO L93 Difference]: Finished difference Result 6890 states and 24764 transitions. [2024-11-13 23:40:37,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:40:37,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-13 23:40:37,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:37,353 INFO L225 Difference]: With dead ends: 6890 [2024-11-13 23:40:37,353 INFO L226 Difference]: Without dead ends: 4573 [2024-11-13 23:40:37,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 23:40:37,374 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:37,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 31 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:40:37,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4573 states. [2024-11-13 23:40:37,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4573 to 4573. [2024-11-13 23:40:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4573 states, 4571 states have (on average 3.4732006125574273) internal successors, (15876), 4572 states have internal predecessors, (15876), 0 states have call successors, (0), 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-13 23:40:37,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 15876 transitions. [2024-11-13 23:40:37,836 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 15876 transitions. Word has length 6 [2024-11-13 23:40:37,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:37,837 INFO L471 AbstractCegarLoop]: Abstraction has 4573 states and 15876 transitions. [2024-11-13 23:40:37,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-13 23:40:37,838 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 15876 transitions. [2024-11-13 23:40:37,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-13 23:40:37,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:37,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:40:37,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:38,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:38,108 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:38,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:38,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1234145807, now seen corresponding path program 1 times [2024-11-13 23:40:38,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:38,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478703805] [2024-11-13 23:40:38,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:38,110 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-13 23:40:38,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:38,114 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:38,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:38,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 23:40:38,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:38,287 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-13 23:40:38,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:40:38,287 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:40:38,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478703805] [2024-11-13 23:40:38,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478703805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:38,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:38,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 23:40:38,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820939501] [2024-11-13 23:40:38,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:38,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 23:40:38,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:40:38,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 23:40:38,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 23:40:38,291 INFO L87 Difference]: Start difference. First operand 4573 states and 15876 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:38,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:38,533 INFO L93 Difference]: Finished difference Result 6971 states and 23633 transitions. [2024-11-13 23:40:38,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 23:40:38,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-13 23:40:38,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:38,565 INFO L225 Difference]: With dead ends: 6971 [2024-11-13 23:40:38,566 INFO L226 Difference]: Without dead ends: 3198 [2024-11-13 23:40:38,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-13 23:40:38,576 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 57 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:38,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 39 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:40:38,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3198 states. [2024-11-13 23:40:38,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3198 to 3198. [2024-11-13 23:40:38,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3198 states, 3196 states have (on average 3.246558197747184) internal successors, (10376), 3197 states have internal predecessors, (10376), 0 states have call successors, (0), 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-13 23:40:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3198 states to 3198 states and 10376 transitions. [2024-11-13 23:40:38,760 INFO L78 Accepts]: Start accepts. Automaton has 3198 states and 10376 transitions. Word has length 15 [2024-11-13 23:40:38,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:38,761 INFO L471 AbstractCegarLoop]: Abstraction has 3198 states and 10376 transitions. [2024-11-13 23:40:38,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3198 states and 10376 transitions. [2024-11-13 23:40:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 23:40:38,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:38,767 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] [2024-11-13 23:40:38,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:38,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:38,970 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:38,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:38,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1404878740, now seen corresponding path program 1 times [2024-11-13 23:40:38,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:38,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15039876] [2024-11-13 23:40:38,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:38,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 23:40:38,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:38,974 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:38,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:39,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 23:40:39,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:39,173 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-13 23:40:39,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:40:39,173 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:40:39,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15039876] [2024-11-13 23:40:39,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15039876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:39,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:39,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 23:40:39,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339547874] [2024-11-13 23:40:39,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:39,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:40:39,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:40:39,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:40:39,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:40:39,176 INFO L87 Difference]: Start difference. First operand 3198 states and 10376 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:39,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:39,408 INFO L93 Difference]: Finished difference Result 3946 states and 12508 transitions. [2024-11-13 23:40:39,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:40:39,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-13 23:40:39,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:39,426 INFO L225 Difference]: With dead ends: 3946 [2024-11-13 23:40:39,426 INFO L226 Difference]: Without dead ends: 1548 [2024-11-13 23:40:39,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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-13 23:40:39,432 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 94 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:39,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 59 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:40:39,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2024-11-13 23:40:39,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1548. [2024-11-13 23:40:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1546 states have (on average 2.976067270375162) internal successors, (4601), 1547 states have internal predecessors, (4601), 0 states have call successors, (0), 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-13 23:40:39,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 4601 transitions. [2024-11-13 23:40:39,540 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 4601 transitions. Word has length 20 [2024-11-13 23:40:39,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:39,540 INFO L471 AbstractCegarLoop]: Abstraction has 1548 states and 4601 transitions. [2024-11-13 23:40:39,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 4601 transitions. [2024-11-13 23:40:39,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-13 23:40:39,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:39,544 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-13 23:40:39,548 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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)] Ended with exit code 0 [2024-11-13 23:40:39,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:39,748 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:39,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:39,748 INFO L85 PathProgramCache]: Analyzing trace with hash -16184824, now seen corresponding path program 1 times [2024-11-13 23:40:39,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:39,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326229306] [2024-11-13 23:40:39,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:39,749 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-13 23:40:39,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:39,751 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:39,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:39,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 23:40:39,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:39,963 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-13 23:40:39,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:40:39,963 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:40:39,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326229306] [2024-11-13 23:40:39,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326229306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:39,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:39,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:40:39,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173247467] [2024-11-13 23:40:39,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:39,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:40:39,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:40:39,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:40:39,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:40:39,965 INFO L87 Difference]: Start difference. First operand 1548 states and 4601 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:40,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:40,216 INFO L93 Difference]: Finished difference Result 1636 states and 4813 transitions. [2024-11-13 23:40:40,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:40:40,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-13 23:40:40,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:40,228 INFO L225 Difference]: With dead ends: 1636 [2024-11-13 23:40:40,229 INFO L226 Difference]: Without dead ends: 888 [2024-11-13 23:40:40,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 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-13 23:40:40,232 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 112 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:40,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 92 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:40:40,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2024-11-13 23:40:40,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2024-11-13 23:40:40,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 886 states have (on average 2.9582392776523703) internal successors, (2621), 887 states have internal predecessors, (2621), 0 states have call successors, (0), 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-13 23:40:40,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 2621 transitions. [2024-11-13 23:40:40,277 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 2621 transitions. Word has length 25 [2024-11-13 23:40:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:40,277 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 2621 transitions. [2024-11-13 23:40:40,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:40:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 2621 transitions. [2024-11-13 23:40:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 23:40:40,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:40,282 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] [2024-11-13 23:40:40,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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)] Forceful destruction successful, exit code 0 [2024-11-13 23:40:40,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:40,485 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:40,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:40,486 INFO L85 PathProgramCache]: Analyzing trace with hash -440352641, now seen corresponding path program 1 times [2024-11-13 23:40:40,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:40,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436538005] [2024-11-13 23:40:40,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:40,487 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-13 23:40:40,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:40,489 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:40,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:40,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 23:40:40,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:40,691 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-13 23:40:40,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:40:40,691 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:40:40,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436538005] [2024-11-13 23:40:40,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436538005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:40,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:40,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 23:40:40,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795086733] [2024-11-13 23:40:40,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:40,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:40:40,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:40:40,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:40:40,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:40:40,693 INFO L87 Difference]: Start difference. First operand 888 states and 2621 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:40,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:40,747 INFO L93 Difference]: Finished difference Result 888 states and 2621 transitions. [2024-11-13 23:40:40,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:40:40,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-13 23:40:40,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:40,759 INFO L225 Difference]: With dead ends: 888 [2024-11-13 23:40:40,759 INFO L226 Difference]: Without dead ends: 864 [2024-11-13 23:40:40,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-13 23:40:40,761 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:40,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 15 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 23:40:40,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-11-13 23:40:40,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2024-11-13 23:40:40,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 863 states have (on average 2.9675550405561992) internal successors, (2561), 863 states have internal predecessors, (2561), 0 states have call successors, (0), 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-13 23:40:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 2561 transitions. [2024-11-13 23:40:40,806 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 2561 transitions. Word has length 30 [2024-11-13 23:40:40,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:40,806 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 2561 transitions. [2024-11-13 23:40:40,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:40,806 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 2561 transitions. [2024-11-13 23:40:40,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 23:40:40,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:40,810 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] [2024-11-13 23:40:40,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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)] Forceful destruction successful, exit code 0 [2024-11-13 23:40:41,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:41,011 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:41,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:41,012 INFO L85 PathProgramCache]: Analyzing trace with hash -440351120, now seen corresponding path program 1 times [2024-11-13 23:40:41,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:41,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980505932] [2024-11-13 23:40:41,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:40:41,012 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-13 23:40:41,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:41,014 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:41,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:40:41,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 23:40:41,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:41,323 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-13 23:40:41,324 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:40:41,324 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:40:41,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980505932] [2024-11-13 23:40:41,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980505932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:41,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:41,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 23:40:41,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552676003] [2024-11-13 23:40:41,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:41,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:40:41,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:40:41,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:40:41,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:40:41,326 INFO L87 Difference]: Start difference. First operand 864 states and 2561 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:41,689 INFO L93 Difference]: Finished difference Result 1902 states and 5510 transitions. [2024-11-13 23:40:41,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 23:40:41,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-13 23:40:41,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:41,703 INFO L225 Difference]: With dead ends: 1902 [2024-11-13 23:40:41,704 INFO L226 Difference]: Without dead ends: 1128 [2024-11-13 23:40:41,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-13 23:40:41,707 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 45 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:41,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 122 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 23:40:41,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2024-11-13 23:40:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 864. [2024-11-13 23:40:41,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 863 states have (on average 2.9049826187717267) internal successors, (2507), 863 states have internal predecessors, (2507), 0 states have call successors, (0), 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-13 23:40:41,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 2507 transitions. [2024-11-13 23:40:41,757 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 2507 transitions. Word has length 30 [2024-11-13 23:40:41,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:41,758 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 2507 transitions. [2024-11-13 23:40:41,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 2507 transitions. [2024-11-13 23:40:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 23:40:41,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:41,763 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] [2024-11-13 23:40:41,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:41,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:41,966 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:41,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:41,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1755075824, now seen corresponding path program 2 times [2024-11-13 23:40:41,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:41,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479437622] [2024-11-13 23:40:41,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 23:40:41,968 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-13 23:40:41,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:41,970 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:41,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:42,115 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 23:40:42,115 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:40:42,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 23:40:42,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:42,515 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-13 23:40:42,516 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:40:42,516 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:40:42,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479437622] [2024-11-13 23:40:42,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479437622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:42,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:42,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:40:42,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365129779] [2024-11-13 23:40:42,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:42,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 23:40:42,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:40:42,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 23:40:42,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 23:40:42,518 INFO L87 Difference]: Start difference. First operand 864 states and 2507 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:42,693 INFO L93 Difference]: Finished difference Result 1128 states and 3237 transitions. [2024-11-13 23:40:42,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 23:40:42,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-13 23:40:42,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:42,703 INFO L225 Difference]: With dead ends: 1128 [2024-11-13 23:40:42,703 INFO L226 Difference]: Without dead ends: 494 [2024-11-13 23:40:42,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 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-13 23:40:42,705 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 20 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:42,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 70 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:40:42,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-11-13 23:40:42,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2024-11-13 23:40:42,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 2.791075050709939) internal successors, (1376), 493 states have internal predecessors, (1376), 0 states have call successors, (0), 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-13 23:40:42,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1376 transitions. [2024-11-13 23:40:42,725 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1376 transitions. Word has length 30 [2024-11-13 23:40:42,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:42,725 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 1376 transitions. [2024-11-13 23:40:42,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:42,726 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1376 transitions. [2024-11-13 23:40:42,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 23:40:42,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:42,729 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] [2024-11-13 23:40:42,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:42,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:42,930 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:42,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:42,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2002806736, now seen corresponding path program 3 times [2024-11-13 23:40:42,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:42,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30766714] [2024-11-13 23:40:42,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 23:40:42,931 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-13 23:40:42,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:42,934 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:42,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:43,043 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-13 23:40:43,043 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:40:43,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 23:40:43,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:43,173 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-13 23:40:43,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:40:43,174 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:40:43,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30766714] [2024-11-13 23:40:43,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30766714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:43,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:43,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 23:40:43,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339682875] [2024-11-13 23:40:43,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:43,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:40:43,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:40:43,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:40:43,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:40:43,175 INFO L87 Difference]: Start difference. First operand 494 states and 1376 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:43,338 INFO L93 Difference]: Finished difference Result 838 states and 2350 transitions. [2024-11-13 23:40:43,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:40:43,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-13 23:40:43,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:43,345 INFO L225 Difference]: With dead ends: 838 [2024-11-13 23:40:43,345 INFO L226 Difference]: Without dead ends: 434 [2024-11-13 23:40:43,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:40:43,346 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:43,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 55 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 23:40:43,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-13 23:40:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2024-11-13 23:40:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 2.7621247113163974) internal successors, (1196), 433 states have internal predecessors, (1196), 0 states have call successors, (0), 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-13 23:40:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1196 transitions. [2024-11-13 23:40:43,362 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1196 transitions. Word has length 30 [2024-11-13 23:40:43,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:43,362 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 1196 transitions. [2024-11-13 23:40:43,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:43,363 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1196 transitions. [2024-11-13 23:40:43,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 23:40:43,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:43,364 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] [2024-11-13 23:40:43,368 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:43,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:43,567 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:43,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:43,568 INFO L85 PathProgramCache]: Analyzing trace with hash 2142938160, now seen corresponding path program 4 times [2024-11-13 23:40:43,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:43,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172373176] [2024-11-13 23:40:43,568 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 23:40:43,568 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-13 23:40:43,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:43,571 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:43,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:43,676 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 23:40:43,676 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:40:43,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 23:40:43,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:43,882 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-13 23:40:43,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:40:43,882 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:40:43,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172373176] [2024-11-13 23:40:43,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172373176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:43,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:43,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 23:40:43,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276930097] [2024-11-13 23:40:43,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:43,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 23:40:43,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:40:43,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 23:40:43,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-13 23:40:43,884 INFO L87 Difference]: Start difference. First operand 434 states and 1196 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:44,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:44,147 INFO L93 Difference]: Finished difference Result 844 states and 2283 transitions. [2024-11-13 23:40:44,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:40:44,148 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-13 23:40:44,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:44,156 INFO L225 Difference]: With dead ends: 844 [2024-11-13 23:40:44,156 INFO L226 Difference]: Without dead ends: 534 [2024-11-13 23:40:44,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-13 23:40:44,159 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 43 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:44,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 160 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:40:44,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-13 23:40:44,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 362. [2024-11-13 23:40:44,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 2.6814404432132966) internal successors, (968), 361 states have internal predecessors, (968), 0 states have call successors, (0), 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-13 23:40:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 968 transitions. [2024-11-13 23:40:44,175 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 968 transitions. Word has length 30 [2024-11-13 23:40:44,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:44,175 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 968 transitions. [2024-11-13 23:40:44,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 968 transitions. [2024-11-13 23:40:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 23:40:44,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:44,177 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] [2024-11-13 23:40:44,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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)] Forceful destruction successful, exit code 0 [2024-11-13 23:40:44,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:44,381 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:44,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:44,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1831820558, now seen corresponding path program 5 times [2024-11-13 23:40:44,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:44,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615489537] [2024-11-13 23:40:44,385 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 23:40:44,385 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-13 23:40:44,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:44,388 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:44,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:44,508 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-13 23:40:44,508 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:40:44,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-13 23:40:44,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:40:45,114 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-13 23:40:45,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:40:45,114 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:40:45,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615489537] [2024-11-13 23:40:45,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615489537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:40:45,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:40:45,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 23:40:45,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199362944] [2024-11-13 23:40:45,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:40:45,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 23:40:45,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:40:45,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 23:40:45,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-13 23:40:45,116 INFO L87 Difference]: Start difference. First operand 362 states and 968 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:45,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:40:45,456 INFO L93 Difference]: Finished difference Result 498 states and 1314 transitions. [2024-11-13 23:40:45,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:40:45,457 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2024-11-13 23:40:45,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:40:45,465 INFO L225 Difference]: With dead ends: 498 [2024-11-13 23:40:45,465 INFO L226 Difference]: Without dead ends: 308 [2024-11-13 23:40:45,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-13 23:40:45,466 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 83 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:40:45,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 130 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 23:40:45,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-13 23:40:45,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-11-13 23:40:45,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 2.596091205211726) internal successors, (797), 307 states have internal predecessors, (797), 0 states have call successors, (0), 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-13 23:40:45,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 797 transitions. [2024-11-13 23:40:45,483 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 797 transitions. Word has length 30 [2024-11-13 23:40:45,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:40:45,483 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 797 transitions. [2024-11-13 23:40:45,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 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-13 23:40:45,484 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 797 transitions. [2024-11-13 23:40:45,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-13 23:40:45,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:40:45,485 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] [2024-11-13 23:40:45,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:45,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:45,688 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-13 23:40:45,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:40:45,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2074270672, now seen corresponding path program 6 times [2024-11-13 23:40:45,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:40:45,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317622439] [2024-11-13 23:40:45,689 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-13 23:40:45,689 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-13 23:40:45,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:40:45,694 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:45,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:45,819 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-13 23:40:45,820 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-13 23:40:45,820 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 23:40:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:40:45,965 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2024-11-13 23:40:45,965 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 23:40:45,966 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-13 23:40:45,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-13 23:40:45,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-13 23:40:45,971 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-13 23:40:45,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-13 23:40:45,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-13 23:40:45,972 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-13 23:40:45,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:46,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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-13 23:40:46,175 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2024-11-13 23:40:46,256 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 23:40:46,256 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 23:40:46,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 11:40:46 BasicIcfg [2024-11-13 23:40:46,259 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 23:40:46,260 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 23:40:46,260 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 23:40:46,260 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 23:40:46,261 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:40:35" (3/4) ... [2024-11-13 23:40:46,262 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 23:40:46,263 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 23:40:46,264 INFO L158 Benchmark]: Toolchain (without parser) took 12111.67ms. Allocated memory was 117.4MB in the beginning and 612.4MB in the end (delta: 494.9MB). Free memory was 91.4MB in the beginning and 500.8MB in the end (delta: -409.4MB). Peak memory consumption was 85.6MB. Max. memory is 16.1GB. [2024-11-13 23:40:46,264 INFO L158 Benchmark]: CDTParser took 1.52ms. Allocated memory is still 117.4MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:40:46,265 INFO L158 Benchmark]: CACSL2BoogieTranslator took 680.54ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 67.6MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 23:40:46,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.11ms. Allocated memory is still 117.4MB. Free memory was 67.6MB in the beginning and 65.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:40:46,265 INFO L158 Benchmark]: Boogie Preprocessor took 49.00ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 63.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:40:46,265 INFO L158 Benchmark]: RCFGBuilder took 1028.70ms. Allocated memory is still 117.4MB. Free memory was 63.6MB in the beginning and 41.3MB in the end (delta: 22.3MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2024-11-13 23:40:46,266 INFO L158 Benchmark]: TraceAbstraction took 10290.64ms. Allocated memory was 117.4MB in the beginning and 612.4MB in the end (delta: 494.9MB). Free memory was 40.8MB in the beginning and 500.9MB in the end (delta: -460.1MB). Peak memory consumption was 391.9MB. Max. memory is 16.1GB. [2024-11-13 23:40:46,266 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 612.4MB. Free memory was 500.9MB in the beginning and 500.8MB in the end (delta: 125.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:40:46,267 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.52ms. Allocated memory is still 117.4MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 680.54ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 67.6MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.11ms. Allocated memory is still 117.4MB. Free memory was 67.6MB in the beginning and 65.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.00ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 63.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1028.70ms. Allocated memory is still 117.4MB. Free memory was 63.6MB in the beginning and 41.3MB in the end (delta: 22.3MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10290.64ms. Allocated memory was 117.4MB in the beginning and 612.4MB in the end (delta: 494.9MB). Free memory was 40.8MB in the beginning and 500.9MB in the end (delta: -460.1MB). Peak memory consumption was 391.9MB. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 612.4MB. Free memory was 500.9MB in the beginning and 500.8MB in the end (delta: 125.8kB). 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1876; [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1876=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L820] 0 pthread_t t1877; [L821] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1876=0, t1877=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L822] 0 pthread_t t1878; [L823] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1876=0, t1877=1, t1878=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876=0, t1877=1, t1878=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876=0, t1877=1, t1878=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876=0, t1877=1, t1878=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L851] 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}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L17] 0 __assert_fail ("0", "safe004_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - 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: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 823]: 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: 819]: 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 7 procedures, 68 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 515 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 515 mSDsluCounter, 773 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 570 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1253 IncrementalHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 203 mSDtfsCounter, 1253 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5763occurred in iteration=0, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 10 MinimizatonAttempts, 436 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 276 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 236 ConstructedInterpolants, 0 QuantifiedInterpolants, 949 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1100 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 23:40:46,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b36eea3e-4a2d-4b7b-80ae-709f971831d0/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 Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample