./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe028_rmo.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_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/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_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe028_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/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_22254365-a1be-4627-a1ed-c20f797bdc38/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 f2554c8e438e3af7ef33c0e1415937b85e1e4893b09cefba11e131adcc4208eb --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:08:10,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:08:10,366 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 03:08:10,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:08:10,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:08:10,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:08:10,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:08:10,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:08:10,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:08:10,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:08:10,412 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:08:10,412 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:08:10,413 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:08:10,413 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:08:10,414 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:08:10,414 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:08:10,414 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:08:10,414 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:08:10,415 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:08:10,415 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:08:10,415 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:08:10,415 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:08:10,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:08:10,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:08:10,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:08:10,416 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:08:10,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:08:10,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:08:10,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:08:10,416 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:08:10,416 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:08:10,416 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:08:10,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:08:10,416 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:08:10,416 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:08:10,416 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:08:10,417 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:08:10,417 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:08:10,417 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:08:10,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:08:10,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:08:10,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:08:10,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:08:10,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:08:10,418 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:08:10,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:08:10,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:08:10,419 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:08:10,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:08:10,419 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_22254365-a1be-4627-a1ed-c20f797bdc38/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 -> f2554c8e438e3af7ef33c0e1415937b85e1e4893b09cefba11e131adcc4208eb [2024-11-14 03:08:10,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:08:10,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:08:10,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:08:10,830 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:08:10,831 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:08:10,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/pthread-wmm/safe028_rmo.i Unable to find full path for "g++" [2024-11-14 03:08:13,009 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:08:13,348 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:08:13,349 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/sv-benchmarks/c/pthread-wmm/safe028_rmo.i [2024-11-14 03:08:13,373 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/data/aedeb2e7a/45e38218daa0452d9971bc2ecc58e491/FLAG7eaa4b13b [2024-11-14 03:08:13,395 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/data/aedeb2e7a/45e38218daa0452d9971bc2ecc58e491 [2024-11-14 03:08:13,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:08:13,400 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:08:13,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:08:13,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:08:13,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:08:13,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:08:13" (1/1) ... [2024-11-14 03:08:13,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@457eee2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:08:13, skipping insertion in model container [2024-11-14 03:08:13,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:08:13" (1/1) ... [2024-11-14 03:08:13,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:08:14,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:08:14,055 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:08:14,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:08:14,193 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:08:14,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:08:14 WrapperNode [2024-11-14 03:08:14,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:08:14,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:08:14,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:08:14,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:08:14,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:08:14" (1/1) ... [2024-11-14 03:08:14,225 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:08:14" (1/1) ... [2024-11-14 03:08:14,252 INFO L138 Inliner]: procedures = 175, calls = 64, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2024-11-14 03:08:14,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:08:14,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:08:14,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:08:14,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:08:14,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:08:14" (1/1) ... [2024-11-14 03:08:14,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:08:14" (1/1) ... [2024-11-14 03:08:14,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:08:14" (1/1) ... [2024-11-14 03:08:14,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:08:14" (1/1) ... [2024-11-14 03:08:14,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:08:14" (1/1) ... [2024-11-14 03:08:14,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:08:14" (1/1) ... [2024-11-14 03:08:14,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:08:14" (1/1) ... [2024-11-14 03:08:14,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:08:14" (1/1) ... [2024-11-14 03:08:14,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:08:14,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:08:14,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:08:14,294 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:08:14,295 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:08:14" (1/1) ... [2024-11-14 03:08:14,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:08:14,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:08:14,349 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:08:14,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:08:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 03:08:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:08:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-14 03:08:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:08:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-14 03:08:14,386 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-14 03:08:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-14 03:08:14,386 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-14 03:08:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-14 03:08:14,386 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-14 03:08:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:08:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-14 03:08:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:08:14,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:08:14,388 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 03:08:14,586 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:08:14,588 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:08:15,480 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 03:08:15,480 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:08:16,378 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:08:16,379 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-14 03:08:16,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:08:16 BoogieIcfgContainer [2024-11-14 03:08:16,380 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:08:16,384 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:08:16,384 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:08:16,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:08:16,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:08:13" (1/3) ... [2024-11-14 03:08:16,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab061d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:08:16, skipping insertion in model container [2024-11-14 03:08:16,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:08:14" (2/3) ... [2024-11-14 03:08:16,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab061d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:08:16, skipping insertion in model container [2024-11-14 03:08:16,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:08:16" (3/3) ... [2024-11-14 03:08:16,395 INFO L112 eAbstractionObserver]: Analyzing ICFG safe028_rmo.i [2024-11-14 03:08:16,415 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:08:16,417 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG safe028_rmo.i that has 4 procedures, 82 locations, 1 initial locations, 0 loop locations, and 42 error locations. [2024-11-14 03:08:16,418 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 03:08:16,657 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-14 03:08:16,705 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 83 transitions, 178 flow [2024-11-14 03:08:21,940 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 116406 states, 102484 states have (on average 4.391085437726865) internal successors, (450016), 116405 states have internal predecessors, (450016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:22,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:08:22,239 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;@10915684, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:08:22,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2024-11-14 03:08:22,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 116406 states, 102484 states have (on average 4.391085437726865) internal successors, (450016), 116405 states have internal predecessors, (450016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:22,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:08:22,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:08:22,539 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:08:22,540 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:08:22,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:08:22,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1807559909, now seen corresponding path program 1 times [2024-11-14 03:08:22,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:08:22,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656009454] [2024-11-14 03:08:22,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:22,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:08:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:23,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:08:23,033 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:08:23,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656009454] [2024-11-14 03:08:23,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656009454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:08:23,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:08:23,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:08:23,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387070666] [2024-11-14 03:08:23,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:08:23,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:08:23,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:08:23,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:08:23,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:08:23,268 INFO L87 Difference]: Start difference. First operand has 116406 states, 102484 states have (on average 4.391085437726865) internal successors, (450016), 116405 states have internal predecessors, (450016), 0 states have call successors, (0), 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-14 03:08:26,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:08:26,985 INFO L93 Difference]: Finished difference Result 122610 states and 482688 transitions. [2024-11-14 03:08:26,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:08:27,000 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-14 03:08:27,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:08:27,858 INFO L225 Difference]: With dead ends: 122610 [2024-11-14 03:08:27,859 INFO L226 Difference]: Without dead ends: 31426 [2024-11-14 03:08:28,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:08:28,081 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:08:28,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 15 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:08:28,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31426 states. [2024-11-14 03:08:29,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31426 to 31426. [2024-11-14 03:08:29,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31426 states, 30104 states have (on average 3.8430773319160245) internal successors, (115692), 31425 states have internal predecessors, (115692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31426 states to 31426 states and 115692 transitions. [2024-11-14 03:08:30,416 INFO L78 Accepts]: Start accepts. Automaton has 31426 states and 115692 transitions. Word has length 6 [2024-11-14 03:08:30,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:08:30,417 INFO L471 AbstractCegarLoop]: Abstraction has 31426 states and 115692 transitions. [2024-11-14 03:08:30,418 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-14 03:08:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 31426 states and 115692 transitions. [2024-11-14 03:08:30,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:08:30,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:08:30,421 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:08:30,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:08:30,421 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:08:30,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:08:30,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1807559906, now seen corresponding path program 1 times [2024-11-14 03:08:30,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:08:30,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772433807] [2024-11-14 03:08:30,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:30,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:08:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:30,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:08:30,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:08:30,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772433807] [2024-11-14 03:08:30,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772433807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:08:30,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:08:30,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:08:30,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533783955] [2024-11-14 03:08:30,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:08:30,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:08:30,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:08:30,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:08:30,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:08:30,655 INFO L87 Difference]: Start difference. First operand 31426 states and 115692 transitions. 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-14 03:08:31,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:08:31,530 INFO L93 Difference]: Finished difference Result 31426 states and 115692 transitions. [2024-11-14 03:08:31,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:08:31,531 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-14 03:08:31,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:08:31,723 INFO L225 Difference]: With dead ends: 31426 [2024-11-14 03:08:31,723 INFO L226 Difference]: Without dead ends: 14726 [2024-11-14 03:08:31,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:08:31,764 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:08:31,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 14 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:08:31,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14726 states. [2024-11-14 03:08:32,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14726 to 14726. [2024-11-14 03:08:32,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14726 states, 14503 states have (on average 3.66503482038199) internal successors, (53154), 14725 states have internal predecessors, (53154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:32,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14726 states to 14726 states and 53154 transitions. [2024-11-14 03:08:32,570 INFO L78 Accepts]: Start accepts. Automaton has 14726 states and 53154 transitions. Word has length 6 [2024-11-14 03:08:32,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:08:32,571 INFO L471 AbstractCegarLoop]: Abstraction has 14726 states and 53154 transitions. [2024-11-14 03:08:32,571 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-14 03:08:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 14726 states and 53154 transitions. [2024-11-14 03:08:32,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:08:32,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:08:32,572 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:08:32,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:08:32,572 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:08:32,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:08:32,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1807559907, now seen corresponding path program 1 times [2024-11-14 03:08:32,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:08:32,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027829752] [2024-11-14 03:08:32,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:32,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:08:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:32,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:08:32,789 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:08:32,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027829752] [2024-11-14 03:08:32,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027829752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:08:32,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:08:32,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:08:32,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685099782] [2024-11-14 03:08:32,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:08:32,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:08:32,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:08:32,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:08:32,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:08:32,791 INFO L87 Difference]: Start difference. First operand 14726 states and 53154 transitions. 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-14 03:08:32,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:08:32,991 INFO L93 Difference]: Finished difference Result 14726 states and 53154 transitions. [2024-11-14 03:08:32,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:08:32,992 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-14 03:08:32,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:08:33,104 INFO L225 Difference]: With dead ends: 14726 [2024-11-14 03:08:33,105 INFO L226 Difference]: Without dead ends: 5154 [2024-11-14 03:08:33,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:08:33,124 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:08:33,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 15 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:08:33,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5154 states. [2024-11-14 03:08:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5154 to 5154. [2024-11-14 03:08:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5154 states, 5150 states have (on average 3.4807766990291262) internal successors, (17926), 5153 states have internal predecessors, (17926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5154 states to 5154 states and 17926 transitions. [2024-11-14 03:08:33,358 INFO L78 Accepts]: Start accepts. Automaton has 5154 states and 17926 transitions. Word has length 6 [2024-11-14 03:08:33,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:08:33,359 INFO L471 AbstractCegarLoop]: Abstraction has 5154 states and 17926 transitions. [2024-11-14 03:08:33,359 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-14 03:08:33,359 INFO L276 IsEmpty]: Start isEmpty. Operand 5154 states and 17926 transitions. [2024-11-14 03:08:33,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 03:08:33,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:08:33,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:08:33,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:08:33,361 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:08:33,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:08:33,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1803836730, now seen corresponding path program 1 times [2024-11-14 03:08:33,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:08:33,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851610949] [2024-11-14 03:08:33,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:33,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:08:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:08:33,828 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:08:33,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851610949] [2024-11-14 03:08:33,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851610949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:08:33,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:08:33,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:08:33,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019428242] [2024-11-14 03:08:33,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:08:33,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:08:33,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:08:33,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:08:33,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:08:33,831 INFO L87 Difference]: Start difference. First operand 5154 states and 17926 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:34,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:08:34,017 INFO L93 Difference]: Finished difference Result 5634 states and 19130 transitions. [2024-11-14 03:08:34,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:08:34,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-14 03:08:34,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:08:34,097 INFO L225 Difference]: With dead ends: 5634 [2024-11-14 03:08:34,098 INFO L226 Difference]: Without dead ends: 4962 [2024-11-14 03:08:34,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:08:34,102 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:08:34,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 29 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:08:34,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4962 states. [2024-11-14 03:08:34,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4962 to 4962. [2024-11-14 03:08:34,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4962 states, 4958 states have (on average 3.4719645018152483) internal successors, (17214), 4961 states have internal predecessors, (17214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4962 states to 4962 states and 17214 transitions. [2024-11-14 03:08:34,353 INFO L78 Accepts]: Start accepts. Automaton has 4962 states and 17214 transitions. Word has length 11 [2024-11-14 03:08:34,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:08:34,354 INFO L471 AbstractCegarLoop]: Abstraction has 4962 states and 17214 transitions. [2024-11-14 03:08:34,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:34,354 INFO L276 IsEmpty]: Start isEmpty. Operand 4962 states and 17214 transitions. [2024-11-14 03:08:34,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 03:08:34,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:08:34,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:08:34,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:08:34,363 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:08:34,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:08:34,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1089502553, now seen corresponding path program 1 times [2024-11-14 03:08:34,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:08:34,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197641249] [2024-11-14 03:08:34,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:34,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:08:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:08:34,627 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:08:34,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197641249] [2024-11-14 03:08:34,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197641249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:08:34,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:08:34,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:08:34,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185952124] [2024-11-14 03:08:34,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:08:34,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:08:34,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:08:34,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:08:34,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:08:34,630 INFO L87 Difference]: Start difference. First operand 4962 states and 17214 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:34,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:08:34,797 INFO L93 Difference]: Finished difference Result 4962 states and 17214 transitions. [2024-11-14 03:08:34,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:08:34,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-14 03:08:34,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:08:34,888 INFO L225 Difference]: With dead ends: 4962 [2024-11-14 03:08:34,888 INFO L226 Difference]: Without dead ends: 4722 [2024-11-14 03:08:34,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:08:34,893 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 51 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:08:34,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 38 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:08:34,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4722 states. [2024-11-14 03:08:35,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4722 to 4722. [2024-11-14 03:08:35,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4722 states, 4719 states have (on average 3.469379105742742) internal successors, (16372), 4721 states have internal predecessors, (16372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:35,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4722 states to 4722 states and 16372 transitions. [2024-11-14 03:08:35,134 INFO L78 Accepts]: Start accepts. Automaton has 4722 states and 16372 transitions. Word has length 13 [2024-11-14 03:08:35,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:08:35,134 INFO L471 AbstractCegarLoop]: Abstraction has 4722 states and 16372 transitions. [2024-11-14 03:08:35,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:35,135 INFO L276 IsEmpty]: Start isEmpty. Operand 4722 states and 16372 transitions. [2024-11-14 03:08:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 03:08:35,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:08:35,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:08:35,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:08:35,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:08:35,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:08:35,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1089502554, now seen corresponding path program 1 times [2024-11-14 03:08:35,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:08:35,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767616947] [2024-11-14 03:08:35,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:35,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:08:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:35,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:08:35,645 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:08:35,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767616947] [2024-11-14 03:08:35,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767616947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:08:35,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:08:35,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:08:35,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308101626] [2024-11-14 03:08:35,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:08:35,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:08:35,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:08:35,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:08:35,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:08:35,647 INFO L87 Difference]: Start difference. First operand 4722 states and 16372 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:08:35,851 INFO L93 Difference]: Finished difference Result 4722 states and 16372 transitions. [2024-11-14 03:08:35,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:08:35,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-14 03:08:35,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:08:35,949 INFO L225 Difference]: With dead ends: 4722 [2024-11-14 03:08:35,949 INFO L226 Difference]: Without dead ends: 4482 [2024-11-14 03:08:35,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:08:35,953 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 53 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:08:35,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 40 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:08:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4482 states. [2024-11-14 03:08:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4482 to 4482. [2024-11-14 03:08:36,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4482 states, 4480 states have (on average 3.466517857142857) internal successors, (15530), 4481 states have internal predecessors, (15530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:36,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4482 states to 4482 states and 15530 transitions. [2024-11-14 03:08:36,231 INFO L78 Accepts]: Start accepts. Automaton has 4482 states and 15530 transitions. Word has length 13 [2024-11-14 03:08:36,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:08:36,232 INFO L471 AbstractCegarLoop]: Abstraction has 4482 states and 15530 transitions. [2024-11-14 03:08:36,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:36,232 INFO L276 IsEmpty]: Start isEmpty. Operand 4482 states and 15530 transitions. [2024-11-14 03:08:36,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 03:08:36,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:08:36,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:08:36,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 03:08:36,239 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:08:36,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:08:36,240 INFO L85 PathProgramCache]: Analyzing trace with hash -701376520, now seen corresponding path program 1 times [2024-11-14 03:08:36,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:08:36,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004556592] [2024-11-14 03:08:36,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:36,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:08:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:36,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:08:36,319 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:08:36,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004556592] [2024-11-14 03:08:36,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004556592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:08:36,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:08:36,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:08:36,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639472639] [2024-11-14 03:08:36,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:08:36,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:08:36,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:08:36,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:08:36,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:08:36,321 INFO L87 Difference]: Start difference. First operand 4482 states and 15530 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-14 03:08:36,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:08:36,410 INFO L93 Difference]: Finished difference Result 4482 states and 15530 transitions. [2024-11-14 03:08:36,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:08:36,411 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-14 03:08:36,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:08:36,489 INFO L225 Difference]: With dead ends: 4482 [2024-11-14 03:08:36,489 INFO L226 Difference]: Without dead ends: 3474 [2024-11-14 03:08:36,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:08:36,494 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:08:36,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 14 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:08:36,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3474 states. [2024-11-14 03:08:36,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3474 to 3474. [2024-11-14 03:08:36,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3474 states, 3473 states have (on average 3.436798157212784) internal successors, (11936), 3473 states have internal predecessors, (11936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3474 states to 3474 states and 11936 transitions. [2024-11-14 03:08:36,618 INFO L78 Accepts]: Start accepts. Automaton has 3474 states and 11936 transitions. Word has length 15 [2024-11-14 03:08:36,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:08:36,619 INFO L471 AbstractCegarLoop]: Abstraction has 3474 states and 11936 transitions. [2024-11-14 03:08:36,619 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-14 03:08:36,619 INFO L276 IsEmpty]: Start isEmpty. Operand 3474 states and 11936 transitions. [2024-11-14 03:08:36,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 03:08:36,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:08:36,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:08:36,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 03:08:36,623 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:08:36,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:08:36,623 INFO L85 PathProgramCache]: Analyzing trace with hash -701377812, now seen corresponding path program 1 times [2024-11-14 03:08:36,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:08:36,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589781191] [2024-11-14 03:08:36,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:36,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:08:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:37,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:08:37,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:08:37,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589781191] [2024-11-14 03:08:37,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589781191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:08:37,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:08:37,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:08:37,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403929077] [2024-11-14 03:08:37,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:08:37,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:08:37,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:08:37,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:08:37,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:08:37,111 INFO L87 Difference]: Start difference. First operand 3474 states and 11936 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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-14 03:08:37,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:08:37,565 INFO L93 Difference]: Finished difference Result 4674 states and 15906 transitions. [2024-11-14 03:08:37,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:08:37,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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-14 03:08:37,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:08:37,639 INFO L225 Difference]: With dead ends: 4674 [2024-11-14 03:08:37,640 INFO L226 Difference]: Without dead ends: 2994 [2024-11-14 03:08:37,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:08:37,645 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 76 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:08:37,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 99 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:08:37,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2024-11-14 03:08:37,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2994. [2024-11-14 03:08:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2994 states, 2993 states have (on average 3.393250918810558) internal successors, (10156), 2993 states have internal predecessors, (10156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:37,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 10156 transitions. [2024-11-14 03:08:37,788 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 10156 transitions. Word has length 15 [2024-11-14 03:08:37,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:08:37,789 INFO L471 AbstractCegarLoop]: Abstraction has 2994 states and 10156 transitions. [2024-11-14 03:08:37,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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-14 03:08:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 10156 transitions. [2024-11-14 03:08:37,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 03:08:37,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:08:37,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:08:37,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 03:08:37,794 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:08:37,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:08:37,794 INFO L85 PathProgramCache]: Analyzing trace with hash 817966079, now seen corresponding path program 1 times [2024-11-14 03:08:37,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:08:37,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416845694] [2024-11-14 03:08:37,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:37,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:08:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:39,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:08:39,698 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:08:39,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416845694] [2024-11-14 03:08:39,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416845694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:08:39,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:08:39,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:08:39,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934121046] [2024-11-14 03:08:39,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:08:39,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:08:39,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:08:39,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:08:39,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:08:39,700 INFO L87 Difference]: Start difference. First operand 2994 states and 10156 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:40,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:08:40,287 INFO L93 Difference]: Finished difference Result 4282 states and 14454 transitions. [2024-11-14 03:08:40,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:08:40,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-14 03:08:40,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:08:40,372 INFO L225 Difference]: With dead ends: 4282 [2024-11-14 03:08:40,372 INFO L226 Difference]: Without dead ends: 3034 [2024-11-14 03:08:40,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:08:40,377 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 90 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:08:40,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 154 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:08:40,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3034 states. [2024-11-14 03:08:40,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3034 to 3034. [2024-11-14 03:08:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3034 states, 3033 states have (on average 3.385426969996703) internal successors, (10268), 3033 states have internal predecessors, (10268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 10268 transitions. [2024-11-14 03:08:40,553 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 10268 transitions. Word has length 17 [2024-11-14 03:08:40,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:08:40,553 INFO L471 AbstractCegarLoop]: Abstraction has 3034 states and 10268 transitions. [2024-11-14 03:08:40,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 10268 transitions. [2024-11-14 03:08:40,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 03:08:40,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:08:40,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:08:40,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 03:08:40,560 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:08:40,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:08:40,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2091218461, now seen corresponding path program 2 times [2024-11-14 03:08:40,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:08:40,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946547203] [2024-11-14 03:08:40,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:40,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:08:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:42,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:08:42,002 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:08:42,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946547203] [2024-11-14 03:08:42,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946547203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:08:42,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:08:42,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:08:42,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227092993] [2024-11-14 03:08:42,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:08:42,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:08:42,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:08:42,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:08:42,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:08:42,004 INFO L87 Difference]: Start difference. First operand 3034 states and 10268 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:42,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:08:42,533 INFO L93 Difference]: Finished difference Result 4034 states and 13518 transitions. [2024-11-14 03:08:42,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:08:42,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-14 03:08:42,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:08:42,595 INFO L225 Difference]: With dead ends: 4034 [2024-11-14 03:08:42,595 INFO L226 Difference]: Without dead ends: 2834 [2024-11-14 03:08:42,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:08:42,599 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 83 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:08:42,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 143 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:08:42,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2024-11-14 03:08:42,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2794. [2024-11-14 03:08:42,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2794 states, 2793 states have (on average 3.364124597207304) internal successors, (9396), 2793 states have internal predecessors, (9396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:42,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2794 states to 2794 states and 9396 transitions. [2024-11-14 03:08:42,777 INFO L78 Accepts]: Start accepts. Automaton has 2794 states and 9396 transitions. Word has length 17 [2024-11-14 03:08:42,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:08:42,778 INFO L471 AbstractCegarLoop]: Abstraction has 2794 states and 9396 transitions. [2024-11-14 03:08:42,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:42,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 9396 transitions. [2024-11-14 03:08:42,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 03:08:42,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:08:42,785 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:08:42,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 03:08:42,785 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:08:42,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:08:42,786 INFO L85 PathProgramCache]: Analyzing trace with hash -29227294, now seen corresponding path program 1 times [2024-11-14 03:08:42,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:08:42,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872086529] [2024-11-14 03:08:42,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:42,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:08:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:43,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:08:43,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:08:43,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872086529] [2024-11-14 03:08:43,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872086529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:08:43,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:08:43,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:08:43,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516802780] [2024-11-14 03:08:43,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:08:43,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:08:43,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:08:43,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:08:43,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:08:43,089 INFO L87 Difference]: Start difference. First operand 2794 states and 9396 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:43,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:08:43,280 INFO L93 Difference]: Finished difference Result 4202 states and 13824 transitions. [2024-11-14 03:08:43,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:08:43,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-14 03:08:43,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:08:43,362 INFO L225 Difference]: With dead ends: 4202 [2024-11-14 03:08:43,363 INFO L226 Difference]: Without dead ends: 2194 [2024-11-14 03:08:43,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:08:43,368 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 30 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-14 03:08:43,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 30 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:08:43,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2194 states. [2024-11-14 03:08:43,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 2194. [2024-11-14 03:08:43,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2194 states, 2193 states have (on average 3.1901504787961694) internal successors, (6996), 2193 states have internal predecessors, (6996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2194 states to 2194 states and 6996 transitions. [2024-11-14 03:08:43,501 INFO L78 Accepts]: Start accepts. Automaton has 2194 states and 6996 transitions. Word has length 19 [2024-11-14 03:08:43,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:08:43,502 INFO L471 AbstractCegarLoop]: Abstraction has 2194 states and 6996 transitions. [2024-11-14 03:08:43,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:43,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2194 states and 6996 transitions. [2024-11-14 03:08:43,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:08:43,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:08:43,507 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:08:43,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 03:08:43,508 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:08:43,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:08:43,508 INFO L85 PathProgramCache]: Analyzing trace with hash 351807747, now seen corresponding path program 1 times [2024-11-14 03:08:43,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:08:43,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569853658] [2024-11-14 03:08:43,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:43,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:08:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:43,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:08:43,828 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:08:43,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569853658] [2024-11-14 03:08:43,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569853658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:08:43,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:08:43,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:08:43,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782286094] [2024-11-14 03:08:43,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:08:43,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:08:43,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:08:43,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:08:43,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:08:43,830 INFO L87 Difference]: Start difference. First operand 2194 states and 6996 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:08:44,066 INFO L93 Difference]: Finished difference Result 2698 states and 8408 transitions. [2024-11-14 03:08:44,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:08:44,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-14 03:08:44,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:08:44,150 INFO L225 Difference]: With dead ends: 2698 [2024-11-14 03:08:44,150 INFO L226 Difference]: Without dead ends: 1290 [2024-11-14 03:08:44,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:08:44,154 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 100 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:08:44,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 37 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:08:44,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2024-11-14 03:08:44,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2024-11-14 03:08:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 1289 states have (on average 2.972847168347556) internal successors, (3832), 1289 states have internal predecessors, (3832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 3832 transitions. [2024-11-14 03:08:44,274 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 3832 transitions. Word has length 21 [2024-11-14 03:08:44,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:08:44,274 INFO L471 AbstractCegarLoop]: Abstraction has 1290 states and 3832 transitions. [2024-11-14 03:08:44,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 3832 transitions. [2024-11-14 03:08:44,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:08:44,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:08:44,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:08:44,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 03:08:44,279 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:08:44,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:08:44,280 INFO L85 PathProgramCache]: Analyzing trace with hash 825344028, now seen corresponding path program 1 times [2024-11-14 03:08:44,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:08:44,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586963797] [2024-11-14 03:08:44,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:44,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:08:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:08:44,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:08:44,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586963797] [2024-11-14 03:08:44,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586963797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:08:44,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:08:44,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:08:44,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418505167] [2024-11-14 03:08:44,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:08:44,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:08:44,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:08:44,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:08:44,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:08:44,747 INFO L87 Difference]: Start difference. First operand 1290 states and 3832 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:08:44,977 INFO L93 Difference]: Finished difference Result 1354 states and 3984 transitions. [2024-11-14 03:08:44,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:08:44,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-14 03:08:44,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:08:45,056 INFO L225 Difference]: With dead ends: 1354 [2024-11-14 03:08:45,056 INFO L226 Difference]: Without dead ends: 850 [2024-11-14 03:08:45,058 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-14 03:08:45,059 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 118 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:08:45,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 29 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:08:45,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2024-11-14 03:08:45,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2024-11-14 03:08:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 849 states have (on average 2.9587750294464077) internal successors, (2512), 849 states have internal predecessors, (2512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 2512 transitions. [2024-11-14 03:08:45,158 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 2512 transitions. Word has length 24 [2024-11-14 03:08:45,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:08:45,159 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 2512 transitions. [2024-11-14 03:08:45,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:45,159 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 2512 transitions. [2024-11-14 03:08:45,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:08:45,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:08:45,162 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-14 03:08:45,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 03:08:45,163 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:08:45,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:08:45,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1088206635, now seen corresponding path program 1 times [2024-11-14 03:08:45,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:08:45,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405008792] [2024-11-14 03:08:45,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:45,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:08:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:08:45,697 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:08:45,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405008792] [2024-11-14 03:08:45,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405008792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:08:45,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:08:45,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:08:45,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34144492] [2024-11-14 03:08:45,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:08:45,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:08:45,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:08:45,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:08:45,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:08:45,700 INFO L87 Difference]: Start difference. First operand 850 states and 2512 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-14 03:08:46,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:08:46,056 INFO L93 Difference]: Finished difference Result 1202 states and 3512 transitions. [2024-11-14 03:08:46,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:08:46,057 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-14 03:08:46,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:08:46,129 INFO L225 Difference]: With dead ends: 1202 [2024-11-14 03:08:46,129 INFO L226 Difference]: Without dead ends: 550 [2024-11-14 03:08:46,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:08:46,132 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 43 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:08:46,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 87 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:08:46,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-14 03:08:46,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2024-11-14 03:08:46,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 2.848816029143898) internal successors, (1564), 549 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:46,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1564 transitions. [2024-11-14 03:08:46,218 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1564 transitions. Word has length 30 [2024-11-14 03:08:46,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:08:46,219 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 1564 transitions. [2024-11-14 03:08:46,219 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-14 03:08:46,219 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1564 transitions. [2024-11-14 03:08:46,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:08:46,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:08:46,222 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-14 03:08:46,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 03:08:46,222 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:08:46,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:08:46,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1678658969, now seen corresponding path program 2 times [2024-11-14 03:08:46,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:08:46,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561803001] [2024-11-14 03:08:46,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:46,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:08:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:51,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:08:51,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:08:51,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561803001] [2024-11-14 03:08:51,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561803001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:08:51,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:08:51,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 03:08:51,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993865664] [2024-11-14 03:08:51,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:08:51,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 03:08:51,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:08:51,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 03:08:51,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:08:51,172 INFO L87 Difference]: Start difference. First operand 550 states and 1564 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 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-14 03:08:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:08:51,856 INFO L93 Difference]: Finished difference Result 886 states and 2504 transitions. [2024-11-14 03:08:51,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:08:51,856 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 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-14 03:08:51,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:08:51,904 INFO L225 Difference]: With dead ends: 886 [2024-11-14 03:08:51,904 INFO L226 Difference]: Without dead ends: 502 [2024-11-14 03:08:51,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-11-14 03:08:51,909 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 61 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:08:51,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 115 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:08:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-14 03:08:51,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2024-11-14 03:08:51,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 2.8502994011976046) internal successors, (1428), 501 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:51,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1428 transitions. [2024-11-14 03:08:51,987 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 1428 transitions. Word has length 30 [2024-11-14 03:08:51,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:08:51,988 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 1428 transitions. [2024-11-14 03:08:51,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 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-14 03:08:51,988 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 1428 transitions. [2024-11-14 03:08:51,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:08:51,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:08:51,990 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-14 03:08:51,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 03:08:51,990 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:08:51,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:08:51,991 INFO L85 PathProgramCache]: Analyzing trace with hash 752270077, now seen corresponding path program 3 times [2024-11-14 03:08:51,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:08:51,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864092175] [2024-11-14 03:08:51,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:51,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:08:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:08:54,180 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:08:54,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864092175] [2024-11-14 03:08:54,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864092175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:08:54,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:08:54,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:08:54,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348817374] [2024-11-14 03:08:54,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:08:54,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:08:54,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:08:54,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:08:54,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:08:54,182 INFO L87 Difference]: Start difference. First operand 502 states and 1428 transitions. Second operand has 8 states, 8 states have (on average 3.75) 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-14 03:08:54,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:08:54,654 INFO L93 Difference]: Finished difference Result 694 states and 1940 transitions. [2024-11-14 03:08:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 03:08:54,654 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) 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-14 03:08:54,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:08:54,702 INFO L225 Difference]: With dead ends: 694 [2024-11-14 03:08:54,703 INFO L226 Difference]: Without dead ends: 486 [2024-11-14 03:08:54,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-14 03:08:54,704 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 64 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:08:54,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 92 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:08:54,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-11-14 03:08:54,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 430. [2024-11-14 03:08:54,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 2.7412587412587412) internal successors, (1176), 429 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:54,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1176 transitions. [2024-11-14 03:08:54,789 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1176 transitions. Word has length 30 [2024-11-14 03:08:54,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:08:54,790 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 1176 transitions. [2024-11-14 03:08:54,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) 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-14 03:08:54,790 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1176 transitions. [2024-11-14 03:08:54,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:08:54,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:08:54,792 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-14 03:08:54,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 03:08:54,792 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:08:54,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:08:54,793 INFO L85 PathProgramCache]: Analyzing trace with hash -589742627, now seen corresponding path program 4 times [2024-11-14 03:08:54,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:08:54,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612126374] [2024-11-14 03:08:54,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:54,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:08:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:56,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:08:56,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:08:56,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612126374] [2024-11-14 03:08:56,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612126374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:08:56,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:08:56,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 03:08:56,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381141053] [2024-11-14 03:08:56,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:08:56,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 03:08:56,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:08:56,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 03:08:56,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:08:56,716 INFO L87 Difference]: Start difference. First operand 430 states and 1176 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) 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-14 03:08:57,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:08:57,195 INFO L93 Difference]: Finished difference Result 718 states and 1968 transitions. [2024-11-14 03:08:57,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 03:08:57,195 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) 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-14 03:08:57,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:08:57,237 INFO L225 Difference]: With dead ends: 718 [2024-11-14 03:08:57,237 INFO L226 Difference]: Without dead ends: 406 [2024-11-14 03:08:57,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-14 03:08:57,239 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 69 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:08:57,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 119 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:08:57,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-11-14 03:08:57,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 358. [2024-11-14 03:08:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 2.700280112044818) internal successors, (964), 357 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:08:57,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 964 transitions. [2024-11-14 03:08:57,306 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 964 transitions. Word has length 30 [2024-11-14 03:08:57,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:08:57,306 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 964 transitions. [2024-11-14 03:08:57,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) 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-14 03:08:57,307 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 964 transitions. [2024-11-14 03:08:57,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:08:57,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:08:57,308 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-14 03:08:57,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 03:08:57,308 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:08:57,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:08:57,309 INFO L85 PathProgramCache]: Analyzing trace with hash -277138765, now seen corresponding path program 5 times [2024-11-14 03:08:57,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:08:57,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842621808] [2024-11-14 03:08:57,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:57,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:08:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:08:57,390 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 03:08:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:08:57,579 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 03:08:57,579 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 03:08:57,580 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (78 of 79 remaining) [2024-11-14 03:08:57,582 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 79 remaining) [2024-11-14 03:08:57,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 79 remaining) [2024-11-14 03:08:57,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 79 remaining) [2024-11-14 03:08:57,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 79 remaining) [2024-11-14 03:08:57,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 79 remaining) [2024-11-14 03:08:57,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 79 remaining) [2024-11-14 03:08:57,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 79 remaining) [2024-11-14 03:08:57,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 79 remaining) [2024-11-14 03:08:57,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 79 remaining) [2024-11-14 03:08:57,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 79 remaining) [2024-11-14 03:08:57,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 79 remaining) [2024-11-14 03:08:57,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 79 remaining) [2024-11-14 03:08:57,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 79 remaining) [2024-11-14 03:08:57,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 79 remaining) [2024-11-14 03:08:57,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 79 remaining) [2024-11-14 03:08:57,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 79 remaining) [2024-11-14 03:08:57,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 79 remaining) [2024-11-14 03:08:57,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 79 remaining) [2024-11-14 03:08:57,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 79 remaining) [2024-11-14 03:08:57,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 79 remaining) [2024-11-14 03:08:57,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 79 remaining) [2024-11-14 03:08:57,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 79 remaining) [2024-11-14 03:08:57,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 79 remaining) [2024-11-14 03:08:57,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 79 remaining) [2024-11-14 03:08:57,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 79 remaining) [2024-11-14 03:08:57,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 79 remaining) [2024-11-14 03:08:57,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 79 remaining) [2024-11-14 03:08:57,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 79 remaining) [2024-11-14 03:08:57,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 79 remaining) [2024-11-14 03:08:57,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 79 remaining) [2024-11-14 03:08:57,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 79 remaining) [2024-11-14 03:08:57,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 79 remaining) [2024-11-14 03:08:57,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 79 remaining) [2024-11-14 03:08:57,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 79 remaining) [2024-11-14 03:08:57,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 79 remaining) [2024-11-14 03:08:57,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 79 remaining) [2024-11-14 03:08:57,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 79 remaining) [2024-11-14 03:08:57,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 79 remaining) [2024-11-14 03:08:57,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 79 remaining) [2024-11-14 03:08:57,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 79 remaining) [2024-11-14 03:08:57,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (37 of 79 remaining) [2024-11-14 03:08:57,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 79 remaining) [2024-11-14 03:08:57,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 79 remaining) [2024-11-14 03:08:57,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 79 remaining) [2024-11-14 03:08:57,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 79 remaining) [2024-11-14 03:08:57,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 79 remaining) [2024-11-14 03:08:57,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 79 remaining) [2024-11-14 03:08:57,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 79 remaining) [2024-11-14 03:08:57,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 79 remaining) [2024-11-14 03:08:57,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 79 remaining) [2024-11-14 03:08:57,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 79 remaining) [2024-11-14 03:08:57,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 79 remaining) [2024-11-14 03:08:57,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 79 remaining) [2024-11-14 03:08:57,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 79 remaining) [2024-11-14 03:08:57,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 79 remaining) [2024-11-14 03:08:57,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 79 remaining) [2024-11-14 03:08:57,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 79 remaining) [2024-11-14 03:08:57,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 79 remaining) [2024-11-14 03:08:57,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 79 remaining) [2024-11-14 03:08:57,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 79 remaining) [2024-11-14 03:08:57,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 79 remaining) [2024-11-14 03:08:57,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 79 remaining) [2024-11-14 03:08:57,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 79 remaining) [2024-11-14 03:08:57,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 79 remaining) [2024-11-14 03:08:57,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 79 remaining) [2024-11-14 03:08:57,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 79 remaining) [2024-11-14 03:08:57,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 79 remaining) [2024-11-14 03:08:57,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 79 remaining) [2024-11-14 03:08:57,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 79 remaining) [2024-11-14 03:08:57,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 79 remaining) [2024-11-14 03:08:57,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 79 remaining) [2024-11-14 03:08:57,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 79 remaining) [2024-11-14 03:08:57,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 79 remaining) [2024-11-14 03:08:57,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 79 remaining) [2024-11-14 03:08:57,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 79 remaining) [2024-11-14 03:08:57,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 79 remaining) [2024-11-14 03:08:57,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 79 remaining) [2024-11-14 03:08:57,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 79 remaining) [2024-11-14 03:08:57,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-14 03:08:57,597 INFO L407 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:08:57,733 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 03:08:57,733 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 03:08:57,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 03:08:57 BasicIcfg [2024-11-14 03:08:57,739 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 03:08:57,740 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 03:08:57,740 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 03:08:57,740 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 03:08:57,742 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:08:16" (3/4) ... [2024-11-14 03:08:57,745 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 03:08:57,746 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 03:08:57,747 INFO L158 Benchmark]: Toolchain (without parser) took 44346.60ms. Allocated memory was 117.4MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 90.5MB in the beginning and 5.8GB in the end (delta: -5.7GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-14 03:08:57,747 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 83.9MB. Free memory is still 41.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:08:57,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 793.23ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 66.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 03:08:57,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.55ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 63.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:08:57,748 INFO L158 Benchmark]: Boogie Preprocessor took 39.55ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 61.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:08:57,748 INFO L158 Benchmark]: RCFGBuilder took 2086.98ms. Allocated memory is still 117.4MB. Free memory was 61.7MB in the beginning and 74.5MB in the end (delta: -12.8MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2024-11-14 03:08:57,749 INFO L158 Benchmark]: TraceAbstraction took 41354.90ms. Allocated memory was 117.4MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 73.7MB in the beginning and 5.8GB in the end (delta: -5.7GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-14 03:08:57,749 INFO L158 Benchmark]: Witness Printer took 6.02ms. Allocated memory is still 7.2GB. Free memory was 5.8GB in the beginning and 5.8GB in the end (delta: 436.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:08:57,753 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 83.9MB. Free memory is still 41.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 793.23ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 66.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.55ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 63.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.55ms. Allocated memory is still 117.4MB. Free memory was 63.8MB in the beginning and 61.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 2086.98ms. Allocated memory is still 117.4MB. Free memory was 61.7MB in the beginning and 74.5MB in the end (delta: -12.8MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. * TraceAbstraction took 41354.90ms. Allocated memory was 117.4MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 73.7MB in the beginning and 5.8GB in the end (delta: -5.7GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 6.02ms. Allocated memory is still 7.2GB. Free memory was 5.8GB in the beginning and 5.8GB in the end (delta: 436.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L851] 0 pthread_t t2461; [L852] FCALL, FORK 0 pthread_create(&t2461, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2461=-1, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L853] 0 pthread_t t2462; [L854] FCALL, FORK 0 pthread_create(&t2462, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2461=-1, t2462=0, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L855] 0 pthread_t t2463; [L856] FCALL, FORK 0 pthread_create(&t2463, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2461=-1, t2462=0, t2463=1, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 x$flush_delayed = weak$$choice2 [L811] EXPR 3 \read(x) [L811] 3 x$mem_tmp = x [L812] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L812] EXPR 3 \read(x) [L812] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L812] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L814] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L815] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L816] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L818] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L820] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L821] EXPR 3 \read(x) [L821] 3 __unbuffered_p2_EAX = x [L822] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L822] 3 x = x$flush_delayed ? x$mem_tmp : x [L823] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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$$choice1=0, weak$$choice2=1, 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={3:0}, y=0] [L826] 3 __unbuffered_p2_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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$$choice1=0, weak$$choice2=1, 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={3:0}, y=0] [L761] 1 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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$$choice1=0, weak$$choice2=1, 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={3:0}, y=1] [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L829] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L829] EXPR 3 \read(x) [L829] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L829] 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) [L830] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L831] 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 [L832] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L833] 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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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$$choice1=0, weak$$choice2=1, 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={3:0}, y=1] [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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$$choice1=0, weak$$choice2=1, 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={3:0}, y=1] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 x$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(x) [L769] 1 x$mem_tmp = x [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] EXPR 1 \read(x) [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L771] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L772] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L773] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L774] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L776] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=1, weak$$choice1=0, weak$$choice2=1, 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={3:0}, y=1] [L791] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=1, weak$$choice1=0, weak$$choice2=1, 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={3:0}, y=1] [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L794] EXPR 2 \read(x) [L794] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 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) [L795] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L796] 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 [L797] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L798] 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_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=1, weak$$choice1=0, weak$$choice2=1, 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={3:0}, y=1] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=1, weak$$choice1=0, weak$$choice2=1, 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={3:0}, y=1] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=1, weak$$choice1=0, weak$$choice2=1, 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={3:0}, y=1] [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2461=-1, t2462=0, t2463=1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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={3:0}, y=1] [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L862] EXPR 0 \read(x) [L862] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 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) [L863] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L864] 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 [L865] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L866] 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}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2461=-1, t2462=0, t2463=1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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={3:0}, y=1] [L869] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L870] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L870] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L870] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L870] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2461=-1, t2462=0, t2463=1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, 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={3:0}, y=1] [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, 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={3:0}, y=1] [L18] 0 __assert_fail ("0", "safe028_rmo.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, 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={3:0}, y=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 856]: 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: 852]: 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: 854]: 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, 140 locations, 79 error locations. Started 1 CEGAR loops. OverallTime: 40.7s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.4s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1032 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1032 mSDsluCounter, 1070 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 733 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1682 IncrementalHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 337 mSDtfsCounter, 1682 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116406occurred in iteration=0, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 144 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 333 NumberOfCodeBlocks, 333 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 3834 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-14 03:08:57,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/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_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe028_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/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_22254365-a1be-4627-a1ed-c20f797bdc38/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 f2554c8e438e3af7ef33c0e1415937b85e1e4893b09cefba11e131adcc4208eb --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:09:00,630 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:09:00,779 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-14 03:09:00,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:09:00,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:09:00,845 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:09:00,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:09:00,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:09:00,847 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:09:00,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:09:00,847 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:09:00,847 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:09:00,847 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:09:00,847 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:09:00,847 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:09:00,847 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:09:00,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:09:00,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:09:00,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:09:00,853 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:09:00,853 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:09:00,853 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:09:00,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:09:00,853 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:09:00,853 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:09:00,853 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:09:00,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:09:00,854 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:09:00,854 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 03:09:00,854 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:09:00,854 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 03:09:00,854 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:09:00,854 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:09:00,854 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:09:00,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:09:00,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 03:09:00,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:09:00,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:09:00,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:09:00,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:09:00,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:09:00,855 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 03:09:00,855 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 03:09:00,855 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:09:00,855 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:09:00,855 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_22254365-a1be-4627-a1ed-c20f797bdc38/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 -> f2554c8e438e3af7ef33c0e1415937b85e1e4893b09cefba11e131adcc4208eb [2024-11-14 03:09:01,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:09:01,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:09:01,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:09:01,181 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:09:01,182 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:09:01,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/pthread-wmm/safe028_rmo.i Unable to find full path for "g++" [2024-11-14 03:09:03,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:09:03,691 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:09:03,694 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/sv-benchmarks/c/pthread-wmm/safe028_rmo.i [2024-11-14 03:09:03,720 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/data/0d5538e78/43480b600dbc455da501f9ccc9e17554/FLAGd85370fcb [2024-11-14 03:09:03,790 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/data/0d5538e78/43480b600dbc455da501f9ccc9e17554 [2024-11-14 03:09:03,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:09:03,797 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:09:03,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:09:03,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:09:03,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:09:03,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:09:03" (1/1) ... [2024-11-14 03:09:03,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e747696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:03, skipping insertion in model container [2024-11-14 03:09:03,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:09:03" (1/1) ... [2024-11-14 03:09:03,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:09:04,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:09:04,347 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:09:04,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:09:04,470 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:09:04,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:04 WrapperNode [2024-11-14 03:09:04,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:09:04,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:09:04,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:09:04,473 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:09:04,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:04" (1/1) ... [2024-11-14 03:09:04,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:04" (1/1) ... [2024-11-14 03:09:04,534 INFO L138 Inliner]: procedures = 179, calls = 64, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2024-11-14 03:09:04,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:09:04,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:09:04,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:09:04,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:09:04,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:04" (1/1) ... [2024-11-14 03:09:04,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:04" (1/1) ... [2024-11-14 03:09:04,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:04" (1/1) ... [2024-11-14 03:09:04,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:04" (1/1) ... [2024-11-14 03:09:04,568 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:04" (1/1) ... [2024-11-14 03:09:04,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:04" (1/1) ... [2024-11-14 03:09:04,579 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:04" (1/1) ... [2024-11-14 03:09:04,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:04" (1/1) ... [2024-11-14 03:09:04,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:09:04,589 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:09:04,589 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:09:04,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:09:04,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:04" (1/1) ... [2024-11-14 03:09:04,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:09:04,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:09:04,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:09:04,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:09:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-14 03:09:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-14 03:09:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:09:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-14 03:09:04,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 03:09:04,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-11-14 03:09:04,657 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-14 03:09:04,657 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-14 03:09:04,657 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-14 03:09:04,657 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-14 03:09:04,657 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-14 03:09:04,658 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-14 03:09:04,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-14 03:09:04,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:09:04,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:09:04,660 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 03:09:04,856 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:09:04,857 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:09:05,768 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 03:09:05,768 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:09:06,756 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:09:06,756 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-14 03:09:06,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:09:06 BoogieIcfgContainer [2024-11-14 03:09:06,757 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:09:06,761 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:09:06,761 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:09:06,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:09:06,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:09:03" (1/3) ... [2024-11-14 03:09:06,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdb9e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:09:06, skipping insertion in model container [2024-11-14 03:09:06,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:09:04" (2/3) ... [2024-11-14 03:09:06,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdb9e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:09:06, skipping insertion in model container [2024-11-14 03:09:06,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:09:06" (3/3) ... [2024-11-14 03:09:06,772 INFO L112 eAbstractionObserver]: Analyzing ICFG safe028_rmo.i [2024-11-14 03:09:06,794 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:09:06,797 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG safe028_rmo.i that has 4 procedures, 82 locations, 1 initial locations, 0 loop locations, and 42 error locations. [2024-11-14 03:09:06,798 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 03:09:07,058 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-14 03:09:07,102 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 83 transitions, 178 flow [2024-11-14 03:09:11,549 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 116406 states, 102484 states have (on average 4.391085437726865) internal successors, (450016), 116405 states have internal predecessors, (450016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:11,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:09:11,650 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;@5091390f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:09:11,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2024-11-14 03:09:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 116406 states, 102484 states have (on average 4.391085437726865) internal successors, (450016), 116405 states have internal predecessors, (450016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:11,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:09:11,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:11,831 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:09:11,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:09:11,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:11,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1865500165, now seen corresponding path program 1 times [2024-11-14 03:09:11,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:09:11,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862959754] [2024-11-14 03:09:11,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:11,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:09:11,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:09:11,862 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:09:11,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-14 03:09:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:12,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:09:12,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:09:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:09:12,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:09:12,200 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:09:12,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862959754] [2024-11-14 03:09:12,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862959754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:09:12,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:09:12,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:09:12,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833883234] [2024-11-14 03:09:12,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:09:12,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:09:12,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:09:12,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:09:12,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:09:12,413 INFO L87 Difference]: Start difference. First operand has 116406 states, 102484 states have (on average 4.391085437726865) internal successors, (450016), 116405 states have internal predecessors, (450016), 0 states have call successors, (0), 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-14 03:09:15,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:15,422 INFO L93 Difference]: Finished difference Result 119610 states and 470230 transitions. [2024-11-14 03:09:15,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:09:15,425 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-14 03:09:15,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:15,835 INFO L225 Difference]: With dead ends: 119610 [2024-11-14 03:09:15,835 INFO L226 Difference]: Without dead ends: 14726 [2024-11-14 03:09:16,325 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-14 03:09:16,329 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:16,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 14 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:09:16,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14726 states. [2024-11-14 03:09:17,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14726 to 14726. [2024-11-14 03:09:17,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14726 states, 14503 states have (on average 3.66503482038199) internal successors, (53154), 14725 states have internal predecessors, (53154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14726 states to 14726 states and 53154 transitions. [2024-11-14 03:09:17,659 INFO L78 Accepts]: Start accepts. Automaton has 14726 states and 53154 transitions. Word has length 6 [2024-11-14 03:09:17,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:17,662 INFO L471 AbstractCegarLoop]: Abstraction has 14726 states and 53154 transitions. [2024-11-14 03:09:17,662 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-14 03:09:17,662 INFO L276 IsEmpty]: Start isEmpty. Operand 14726 states and 53154 transitions. [2024-11-14 03:09:17,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:09:17,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:17,663 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:09:17,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-14 03:09:17,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:09:17,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:09:17,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:17,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1865500166, now seen corresponding path program 1 times [2024-11-14 03:09:17,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:09:17,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [100069990] [2024-11-14 03:09:17,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:17,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:09:17,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:09:17,871 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:09:17,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-14 03:09:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:18,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:09:18,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:09:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:09:18,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:09:18,134 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:09:18,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [100069990] [2024-11-14 03:09:18,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [100069990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:09:18,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:09:18,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:09:18,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341012155] [2024-11-14 03:09:18,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:09:18,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:09:18,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:09:18,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:09:18,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:09:18,137 INFO L87 Difference]: Start difference. First operand 14726 states and 53154 transitions. 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-14 03:09:18,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:18,523 INFO L93 Difference]: Finished difference Result 14726 states and 53154 transitions. [2024-11-14 03:09:18,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:09:18,524 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-14 03:09:18,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:18,657 INFO L225 Difference]: With dead ends: 14726 [2024-11-14 03:09:18,657 INFO L226 Difference]: Without dead ends: 5154 [2024-11-14 03:09:18,679 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-14 03:09:18,680 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:18,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 15 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:09:18,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5154 states. [2024-11-14 03:09:18,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5154 to 5154. [2024-11-14 03:09:18,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5154 states, 5150 states have (on average 3.4807766990291262) internal successors, (17926), 5153 states have internal predecessors, (17926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5154 states to 5154 states and 17926 transitions. [2024-11-14 03:09:18,999 INFO L78 Accepts]: Start accepts. Automaton has 5154 states and 17926 transitions. Word has length 6 [2024-11-14 03:09:19,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:19,000 INFO L471 AbstractCegarLoop]: Abstraction has 5154 states and 17926 transitions. [2024-11-14 03:09:19,001 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-14 03:09:19,001 INFO L276 IsEmpty]: Start isEmpty. Operand 5154 states and 17926 transitions. [2024-11-14 03:09:19,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 03:09:19,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:19,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:09:19,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/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)] Ended with exit code 0 [2024-11-14 03:09:19,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:09:19,208 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:09:19,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:19,210 INFO L85 PathProgramCache]: Analyzing trace with hash 209086856, now seen corresponding path program 1 times [2024-11-14 03:09:19,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:09:19,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [980187347] [2024-11-14 03:09:19,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:19,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:09:19,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:09:19,216 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:09:19,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-14 03:09:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:19,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:09:19,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:09:19,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:09:19,476 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:09:19,476 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:09:19,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [980187347] [2024-11-14 03:09:19,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [980187347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:09:19,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:09:19,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:09:19,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087441914] [2024-11-14 03:09:19,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:09:19,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:09:19,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:09:19,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:09:19,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:09:19,479 INFO L87 Difference]: Start difference. First operand 5154 states and 17926 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:19,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:19,827 INFO L93 Difference]: Finished difference Result 7962 states and 27044 transitions. [2024-11-14 03:09:19,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:09:19,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-14 03:09:19,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:19,930 INFO L225 Difference]: With dead ends: 7962 [2024-11-14 03:09:19,931 INFO L226 Difference]: Without dead ends: 3594 [2024-11-14 03:09:19,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:09:19,942 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 57 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:19,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 36 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:09:19,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2024-11-14 03:09:20,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3594. [2024-11-14 03:09:20,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3594 states, 3590 states have (on average 3.2551532033426183) internal successors, (11686), 3593 states have internal predecessors, (11686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:20,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 11686 transitions. [2024-11-14 03:09:20,205 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 11686 transitions. Word has length 11 [2024-11-14 03:09:20,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:20,206 INFO L471 AbstractCegarLoop]: Abstraction has 3594 states and 11686 transitions. [2024-11-14 03:09:20,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 11686 transitions. [2024-11-14 03:09:20,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 03:09:20,210 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:20,211 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:09:20,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/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-14 03:09:20,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:09:20,412 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:09:20,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:20,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1123204364, now seen corresponding path program 1 times [2024-11-14 03:09:20,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:09:20,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432791158] [2024-11-14 03:09:20,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:20,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:09:20,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:09:20,416 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:09:20,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-14 03:09:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:20,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:09:20,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:09:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:09:20,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:09:20,679 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:09:20,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432791158] [2024-11-14 03:09:20,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432791158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:09:20,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:09:20,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:09:20,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992289378] [2024-11-14 03:09:20,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:09:20,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:09:20,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:09:20,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:09:20,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:09:20,681 INFO L87 Difference]: Start difference. First operand 3594 states and 11686 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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-14 03:09:21,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:21,019 INFO L93 Difference]: Finished difference Result 4478 states and 14218 transitions. [2024-11-14 03:09:21,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:09:21,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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-14 03:09:21,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:21,256 INFO L225 Difference]: With dead ends: 4478 [2024-11-14 03:09:21,256 INFO L226 Difference]: Without dead ends: 1670 [2024-11-14 03:09:21,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:09:21,262 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 95 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:21,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 54 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:09:21,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2024-11-14 03:09:21,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2024-11-14 03:09:21,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1666 states have (on average 2.972388955582233) internal successors, (4952), 1669 states have internal predecessors, (4952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 4952 transitions. [2024-11-14 03:09:21,372 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 4952 transitions. Word has length 15 [2024-11-14 03:09:21,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:21,373 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 4952 transitions. [2024-11-14 03:09:21,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 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-14 03:09:21,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 4952 transitions. [2024-11-14 03:09:21,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 03:09:21,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:21,377 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-14 03:09:21,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/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-14 03:09:21,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:09:21,581 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:09:21,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:21,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1528340990, now seen corresponding path program 1 times [2024-11-14 03:09:21,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:09:21,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [692801032] [2024-11-14 03:09:21,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:21,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:09:21,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:09:21,585 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:09:21,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-14 03:09:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:21,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:09:21,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:09:21,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:09:21,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:09:21,897 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:09:21,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [692801032] [2024-11-14 03:09:21,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [692801032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:09:21,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:09:21,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:09:21,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039438453] [2024-11-14 03:09:21,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:09:21,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:09:21,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:09:21,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:09:21,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:09:21,901 INFO L87 Difference]: Start difference. First operand 1670 states and 4952 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-14 03:09:22,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:22,302 INFO L93 Difference]: Finished difference Result 1774 states and 5204 transitions. [2024-11-14 03:09:22,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:09:22,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-14 03:09:22,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:22,364 INFO L225 Difference]: With dead ends: 1774 [2024-11-14 03:09:22,364 INFO L226 Difference]: Without dead ends: 890 [2024-11-14 03:09:22,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:09:22,368 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 113 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:22,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 83 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:09:22,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-11-14 03:09:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2024-11-14 03:09:22,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 886 states have (on average 2.9480812641083523) internal successors, (2612), 889 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:22,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 2612 transitions. [2024-11-14 03:09:22,454 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 2612 transitions. Word has length 20 [2024-11-14 03:09:22,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:22,454 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 2612 transitions. [2024-11-14 03:09:22,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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-14 03:09:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 2612 transitions. [2024-11-14 03:09:22,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 03:09:22,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:22,464 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] [2024-11-14 03:09:22,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/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-14 03:09:22,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:09:22,668 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:09:22,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:22,669 INFO L85 PathProgramCache]: Analyzing trace with hash -217448947, now seen corresponding path program 1 times [2024-11-14 03:09:22,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:09:22,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118279915] [2024-11-14 03:09:22,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:22,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:09:22,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:09:22,673 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:09:22,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-14 03:09:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:22,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:09:22,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:09:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:09:23,148 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:09:23,148 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:09:23,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118279915] [2024-11-14 03:09:23,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118279915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:09:23,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:09:23,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:09:23,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453699156] [2024-11-14 03:09:23,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:09:23,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:09:23,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:09:23,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:09:23,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:09:23,150 INFO L87 Difference]: Start difference. First operand 890 states and 2612 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:23,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:23,296 INFO L93 Difference]: Finished difference Result 890 states and 2612 transitions. [2024-11-14 03:09:23,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:09:23,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-14 03:09:23,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:23,357 INFO L225 Difference]: With dead ends: 890 [2024-11-14 03:09:23,357 INFO L226 Difference]: Without dead ends: 882 [2024-11-14 03:09:23,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:09:23,359 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 42 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:23,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 29 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:09:23,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-11-14 03:09:23,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2024-11-14 03:09:23,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 879 states have (on average 2.948805460750853) internal successors, (2592), 881 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:23,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 2592 transitions. [2024-11-14 03:09:23,439 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 2592 transitions. Word has length 26 [2024-11-14 03:09:23,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:23,440 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 2592 transitions. [2024-11-14 03:09:23,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:23,440 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 2592 transitions. [2024-11-14 03:09:23,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 03:09:23,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:23,443 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] [2024-11-14 03:09:23,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-14 03:09:23,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:09:23,647 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:09:23,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:23,648 INFO L85 PathProgramCache]: Analyzing trace with hash -217448946, now seen corresponding path program 1 times [2024-11-14 03:09:23,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:09:23,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389290030] [2024-11-14 03:09:23,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:23,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:09:23,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:09:23,651 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:09:23,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-14 03:09:23,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:23,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:09:23,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:09:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:09:24,214 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:09:24,214 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:09:24,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389290030] [2024-11-14 03:09:24,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389290030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:09:24,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:09:24,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:09:24,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892302720] [2024-11-14 03:09:24,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:09:24,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:09:24,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:09:24,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:09:24,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:09:24,216 INFO L87 Difference]: Start difference. First operand 882 states and 2592 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:24,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:24,344 INFO L93 Difference]: Finished difference Result 882 states and 2592 transitions. [2024-11-14 03:09:24,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:09:24,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-11-14 03:09:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:24,406 INFO L225 Difference]: With dead ends: 882 [2024-11-14 03:09:24,406 INFO L226 Difference]: Without dead ends: 874 [2024-11-14 03:09:24,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:09:24,408 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:24,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 30 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:09:24,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-14 03:09:24,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-14 03:09:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 872 states have (on average 2.94954128440367) internal successors, (2572), 873 states have internal predecessors, (2572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:24,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 2572 transitions. [2024-11-14 03:09:24,492 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 2572 transitions. Word has length 26 [2024-11-14 03:09:24,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:24,493 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 2572 transitions. [2024-11-14 03:09:24,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:24,493 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 2572 transitions. [2024-11-14 03:09:24,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:09:24,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:24,496 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-14 03:09:24,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-14 03:09:24,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:09:24,700 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:09:24,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:24,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1141123135, now seen corresponding path program 1 times [2024-11-14 03:09:24,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:09:24,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463829811] [2024-11-14 03:09:24,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:24,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:09:24,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:09:24,704 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:09:24,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-14 03:09:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:24,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 03:09:24,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:09:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:09:25,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:09:25,031 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:09:25,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463829811] [2024-11-14 03:09:25,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463829811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:09:25,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:09:25,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:09:25,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695917020] [2024-11-14 03:09:25,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:09:25,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:09:25,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:09:25,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:09:25,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:09:25,032 INFO L87 Difference]: Start difference. First operand 874 states and 2572 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-14 03:09:25,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:25,120 INFO L93 Difference]: Finished difference Result 874 states and 2572 transitions. [2024-11-14 03:09:25,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:09:25,120 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-14 03:09:25,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:25,181 INFO L225 Difference]: With dead ends: 874 [2024-11-14 03:09:25,181 INFO L226 Difference]: Without dead ends: 850 [2024-11-14 03:09:25,183 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-14 03:09:25,183 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:25,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:09:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2024-11-14 03:09:25,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 850. [2024-11-14 03:09:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 849 states have (on average 2.9587750294464077) internal successors, (2512), 849 states have internal predecessors, (2512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:25,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 2512 transitions. [2024-11-14 03:09:25,265 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 2512 transitions. Word has length 30 [2024-11-14 03:09:25,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:25,267 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 2512 transitions. [2024-11-14 03:09:25,267 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-14 03:09:25,267 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 2512 transitions. [2024-11-14 03:09:25,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:09:25,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:25,270 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-14 03:09:25,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-14 03:09:25,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:09:25,471 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:09:25,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:25,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1141121843, now seen corresponding path program 1 times [2024-11-14 03:09:25,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:09:25,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637902828] [2024-11-14 03:09:25,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:09:25,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:09:25,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:09:25,474 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:09:25,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-14 03:09:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:09:25,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-14 03:09:25,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:09:25,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:09:25,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:09:25,943 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:09:25,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637902828] [2024-11-14 03:09:25,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637902828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:09:25,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:09:25,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:09:25,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188734867] [2024-11-14 03:09:25,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:09:25,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:09:25,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:09:25,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:09:25,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:09:25,945 INFO L87 Difference]: Start difference. First operand 850 states and 2512 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-14 03:09:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:09:26,317 INFO L93 Difference]: Finished difference Result 1202 states and 3512 transitions. [2024-11-14 03:09:26,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:09:26,317 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-14 03:09:26,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:09:26,375 INFO L225 Difference]: With dead ends: 1202 [2024-11-14 03:09:26,375 INFO L226 Difference]: Without dead ends: 550 [2024-11-14 03:09:26,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:09:26,379 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 45 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:09:26,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 87 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:09:26,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-14 03:09:26,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2024-11-14 03:09:26,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 2.848816029143898) internal successors, (1564), 549 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:09:26,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1564 transitions. [2024-11-14 03:09:26,447 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1564 transitions. Word has length 30 [2024-11-14 03:09:26,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:09:26,448 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 1564 transitions. [2024-11-14 03:09:26,448 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-14 03:09:26,448 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1564 transitions. [2024-11-14 03:09:26,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:09:26,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:09:26,451 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-14 03:09:26,455 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-14 03:09:26,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:09:26,655 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-14 03:09:26,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:09:26,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1210661679, now seen corresponding path program 2 times [2024-11-14 03:09:26,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:09:26,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062417220] [2024-11-14 03:09:26,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 03:09:26,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:09:26,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:09:26,658 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:09:26,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-14 03:09:26,873 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-14 03:09:26,873 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-14 03:09:26,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 03:09:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:09:27,065 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2024-11-14 03:09:27,066 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 03:09:27,067 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (78 of 79 remaining) [2024-11-14 03:09:27,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 79 remaining) [2024-11-14 03:09:27,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 79 remaining) [2024-11-14 03:09:27,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 79 remaining) [2024-11-14 03:09:27,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 79 remaining) [2024-11-14 03:09:27,069 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 79 remaining) [2024-11-14 03:09:27,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 79 remaining) [2024-11-14 03:09:27,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 79 remaining) [2024-11-14 03:09:27,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 79 remaining) [2024-11-14 03:09:27,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 79 remaining) [2024-11-14 03:09:27,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 79 remaining) [2024-11-14 03:09:27,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 79 remaining) [2024-11-14 03:09:27,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 79 remaining) [2024-11-14 03:09:27,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 79 remaining) [2024-11-14 03:09:27,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 79 remaining) [2024-11-14 03:09:27,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 79 remaining) [2024-11-14 03:09:27,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 79 remaining) [2024-11-14 03:09:27,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 79 remaining) [2024-11-14 03:09:27,070 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 79 remaining) [2024-11-14 03:09:27,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 79 remaining) [2024-11-14 03:09:27,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 79 remaining) [2024-11-14 03:09:27,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 79 remaining) [2024-11-14 03:09:27,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 79 remaining) [2024-11-14 03:09:27,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 79 remaining) [2024-11-14 03:09:27,071 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 79 remaining) [2024-11-14 03:09:27,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 79 remaining) [2024-11-14 03:09:27,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 79 remaining) [2024-11-14 03:09:27,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 79 remaining) [2024-11-14 03:09:27,072 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 79 remaining) [2024-11-14 03:09:27,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 79 remaining) [2024-11-14 03:09:27,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 79 remaining) [2024-11-14 03:09:27,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 79 remaining) [2024-11-14 03:09:27,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 79 remaining) [2024-11-14 03:09:27,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 79 remaining) [2024-11-14 03:09:27,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 79 remaining) [2024-11-14 03:09:27,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 79 remaining) [2024-11-14 03:09:27,073 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 79 remaining) [2024-11-14 03:09:27,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 79 remaining) [2024-11-14 03:09:27,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 79 remaining) [2024-11-14 03:09:27,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 79 remaining) [2024-11-14 03:09:27,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 79 remaining) [2024-11-14 03:09:27,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (37 of 79 remaining) [2024-11-14 03:09:27,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 79 remaining) [2024-11-14 03:09:27,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 79 remaining) [2024-11-14 03:09:27,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 79 remaining) [2024-11-14 03:09:27,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 79 remaining) [2024-11-14 03:09:27,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 79 remaining) [2024-11-14 03:09:27,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 79 remaining) [2024-11-14 03:09:27,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 79 remaining) [2024-11-14 03:09:27,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 79 remaining) [2024-11-14 03:09:27,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 79 remaining) [2024-11-14 03:09:27,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 79 remaining) [2024-11-14 03:09:27,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 79 remaining) [2024-11-14 03:09:27,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 79 remaining) [2024-11-14 03:09:27,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 79 remaining) [2024-11-14 03:09:27,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 79 remaining) [2024-11-14 03:09:27,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 79 remaining) [2024-11-14 03:09:27,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 79 remaining) [2024-11-14 03:09:27,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 79 remaining) [2024-11-14 03:09:27,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 79 remaining) [2024-11-14 03:09:27,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 79 remaining) [2024-11-14 03:09:27,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 79 remaining) [2024-11-14 03:09:27,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 79 remaining) [2024-11-14 03:09:27,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 79 remaining) [2024-11-14 03:09:27,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 79 remaining) [2024-11-14 03:09:27,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 79 remaining) [2024-11-14 03:09:27,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 79 remaining) [2024-11-14 03:09:27,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 79 remaining) [2024-11-14 03:09:27,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 79 remaining) [2024-11-14 03:09:27,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 79 remaining) [2024-11-14 03:09:27,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 79 remaining) [2024-11-14 03:09:27,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 79 remaining) [2024-11-14 03:09:27,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 79 remaining) [2024-11-14 03:09:27,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 79 remaining) [2024-11-14 03:09:27,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 79 remaining) [2024-11-14 03:09:27,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 79 remaining) [2024-11-14 03:09:27,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 79 remaining) [2024-11-14 03:09:27,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 79 remaining) [2024-11-14 03:09:27,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 79 remaining) [2024-11-14 03:09:27,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/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)] Ended with exit code 0 [2024-11-14 03:09:27,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:09:27,282 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:09:27,402 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 03:09:27,402 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 03:09:27,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 03:09:27 BasicIcfg [2024-11-14 03:09:27,409 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 03:09:27,410 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 03:09:27,410 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 03:09:27,410 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 03:09:27,412 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:09:06" (3/4) ... [2024-11-14 03:09:27,414 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 03:09:27,415 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 03:09:27,416 INFO L158 Benchmark]: Toolchain (without parser) took 23620.15ms. Allocated memory was 117.4MB in the beginning and 7.5GB in the end (delta: 7.4GB). Free memory was 90.6MB in the beginning and 6.7GB in the end (delta: -6.6GB). Peak memory consumption was 799.9MB. Max. memory is 16.1GB. [2024-11-14 03:09:27,416 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 117.4MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:09:27,417 INFO L158 Benchmark]: CACSL2BoogieTranslator took 672.25ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 65.9MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 03:09:27,417 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.60ms. Allocated memory is still 117.4MB. Free memory was 65.9MB in the beginning and 63.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:09:27,417 INFO L158 Benchmark]: Boogie Preprocessor took 51.05ms. Allocated memory is still 117.4MB. Free memory was 63.7MB in the beginning and 61.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:09:27,417 INFO L158 Benchmark]: RCFGBuilder took 2167.85ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 61.7MB in the beginning and 156.7MB in the end (delta: -95.1MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. [2024-11-14 03:09:27,418 INFO L158 Benchmark]: TraceAbstraction took 20648.69ms. Allocated memory was 268.4MB in the beginning and 7.5GB in the end (delta: 7.3GB). Free memory was 156.0MB in the beginning and 6.7GB in the end (delta: -6.5GB). Peak memory consumption was 707.4MB. Max. memory is 16.1GB. [2024-11-14 03:09:27,420 INFO L158 Benchmark]: Witness Printer took 5.43ms. Allocated memory is still 7.5GB. Free memory was 6.7GB in the beginning and 6.7GB in the end (delta: 198.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:09:27,422 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.46ms. Allocated memory is still 117.4MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 672.25ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 65.9MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.60ms. Allocated memory is still 117.4MB. Free memory was 65.9MB in the beginning and 63.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.05ms. Allocated memory is still 117.4MB. Free memory was 63.7MB in the beginning and 61.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 2167.85ms. Allocated memory was 117.4MB in the beginning and 268.4MB in the end (delta: 151.0MB). Free memory was 61.7MB in the beginning and 156.7MB in the end (delta: -95.1MB). Peak memory consumption was 61.1MB. Max. memory is 16.1GB. * TraceAbstraction took 20648.69ms. Allocated memory was 268.4MB in the beginning and 7.5GB in the end (delta: 7.3GB). Free memory was 156.0MB in the beginning and 6.7GB in the end (delta: -6.5GB). Peak memory consumption was 707.4MB. Max. memory is 16.1GB. * Witness Printer took 5.43ms. Allocated memory is still 7.5GB. Free memory was 6.7GB in the beginning and 6.7GB in the end (delta: 198.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L851] 0 pthread_t t2461; [L852] FCALL, FORK 0 pthread_create(&t2461, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2461=0, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L853] 0 pthread_t t2462; [L854] FCALL, FORK 0 pthread_create(&t2462, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2461=0, t2462=1, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L855] 0 pthread_t t2463; [L856] FCALL, FORK 0 pthread_create(&t2463, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2461=0, t2462=1, t2463=2, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 x$flush_delayed = weak$$choice2 [L811] EXPR 3 \read(x) [L811] 3 x$mem_tmp = x [L812] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L812] EXPR 3 \read(x) [L812] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L812] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L814] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L815] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L816] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L818] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L820] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L821] EXPR 3 \read(x) [L821] 3 __unbuffered_p2_EAX = x [L822] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L822] EXPR 3 \read(x) [L822] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L822] 3 x = x$flush_delayed ? x$mem_tmp : x [L823] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L826] 3 __unbuffered_p2_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L829] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L829] EXPR 3 \read(x) [L829] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L829] 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) [L830] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L831] 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 [L832] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L833] 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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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={3:0}, y=0] [L761] 1 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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={3:0}, y=1] [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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={3:0}, y=1] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 x$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(x) [L769] 1 x$mem_tmp = x [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] EXPR 1 \read(x) [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L771] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L772] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L773] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L774] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L776] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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={3:0}, y=1] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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={3:0}, y=1] [L791] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=1, weak$$choice1=0, weak$$choice2=1, 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={3:0}, y=1] [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L794] EXPR 2 \read(x) [L794] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 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) [L795] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L796] 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 [L797] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L798] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=1, weak$$choice1=0, weak$$choice2=1, 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={3:0}, y=1] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=1, weak$$choice1=0, weak$$choice2=1, 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={3:0}, y=1] [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2461=0, t2462=1, t2463=2, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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={3:0}, y=1] [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L862] EXPR 0 \read(x) [L862] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 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) [L863] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L864] 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 [L865] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L866] 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}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2461=0, t2462=1, t2463=2, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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={3:0}, y=1] [L869] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L870] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L870] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L870] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L870] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2461=0, t2462=1, t2463=2, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, 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={3:0}, y=1] [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, 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={3:0}, y=1] [L18] 0 __assert_fail ("0", "safe028_rmo.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, 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={3:0}, y=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 854]: 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: 856]: 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: 852]: 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, 140 locations, 79 error locations. Started 1 CEGAR loops. OverallTime: 20.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 475 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 475 mSDsluCounter, 362 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 200 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 695 IncrementalHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 162 mSDtfsCounter, 695 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116406occurred in iteration=0, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 967 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1341 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-14 03:09:27,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_22254365-a1be-4627-a1ed-c20f797bdc38/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample