./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh --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 a9d301fd24d7dbc3684a100e80ac453023513d8631f488025251adcc1a8646b5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 12:28:38,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 12:28:38,533 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 12:28:38,538 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 12:28:38,538 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 12:28:38,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 12:28:38,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 12:28:38,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 12:28:38,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 12:28:38,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 12:28:38,566 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 12:28:38,566 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 12:28:38,567 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 12:28:38,567 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 12:28:38,568 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 12:28:38,568 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 12:28:38,569 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 12:28:38,570 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 12:28:38,570 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 12:28:38,571 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 12:28:38,571 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 12:28:38,573 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 12:28:38,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 12:28:38,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 12:28:38,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 12:28:38,575 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 12:28:38,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 12:28:38,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 12:28:38,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 12:28:38,577 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 12:28:38,577 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 12:28:38,578 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 12:28:38,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 12:28:38,578 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 12:28:38,579 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 12:28:38,579 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 12:28:38,579 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 12:28:38,579 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 12:28:38,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 12:28:38,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 12:28:38,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:28:38,580 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 12:28:38,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 12:28:38,581 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 12:28:38,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 12:28:38,581 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 12:28:38,581 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 12:28:38,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 12:28:38,581 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh 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 -> a9d301fd24d7dbc3684a100e80ac453023513d8631f488025251adcc1a8646b5 [2023-12-02 12:28:38,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 12:28:38,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 12:28:38,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 12:28:38,828 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 12:28:38,829 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 12:28:38,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i [2023-12-02 12:28:41,651 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 12:28:41,901 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 12:28:41,902 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i [2023-12-02 12:28:41,919 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/data/124d4b6ca/b1e5a21b39f6400398a2444ea6ea4f7d/FLAG22edd5b00 [2023-12-02 12:28:41,935 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/data/124d4b6ca/b1e5a21b39f6400398a2444ea6ea4f7d [2023-12-02 12:28:41,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 12:28:41,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 12:28:41,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 12:28:41,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 12:28:41,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 12:28:41,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:28:41" (1/1) ... [2023-12-02 12:28:41,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24ab685a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:28:41, skipping insertion in model container [2023-12-02 12:28:41,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:28:41" (1/1) ... [2023-12-02 12:28:42,015 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 12:28:42,433 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:28:42,448 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 12:28:42,559 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:28:42,623 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 12:28:42,623 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 12:28:42,633 INFO L206 MainTranslator]: Completed translation [2023-12-02 12:28:42,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:28:42 WrapperNode [2023-12-02 12:28:42,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 12:28:42,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 12:28:42,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 12:28:42,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 12:28:42,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:28:42" (1/1) ... [2023-12-02 12:28:42,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:28:42" (1/1) ... [2023-12-02 12:28:42,690 INFO L138 Inliner]: procedures = 177, calls = 85, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 155 [2023-12-02 12:28:42,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 12:28:42,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 12:28:42,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 12:28:42,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 12:28:42,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:28:42" (1/1) ... [2023-12-02 12:28:42,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:28:42" (1/1) ... [2023-12-02 12:28:42,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:28:42" (1/1) ... [2023-12-02 12:28:42,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:28:42" (1/1) ... [2023-12-02 12:28:42,718 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:28:42" (1/1) ... [2023-12-02 12:28:42,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:28:42" (1/1) ... [2023-12-02 12:28:42,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:28:42" (1/1) ... [2023-12-02 12:28:42,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:28:42" (1/1) ... [2023-12-02 12:28:42,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 12:28:42,734 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 12:28:42,734 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 12:28:42,735 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 12:28:42,736 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:28:42" (1/1) ... [2023-12-02 12:28:42,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:28:42,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:28:42,767 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 12:28:42,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 12:28:42,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 12:28:42,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 12:28:42,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 12:28:42,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 12:28:42,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 12:28:42,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 12:28:42,807 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-02 12:28:42,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-02 12:28:42,808 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-02 12:28:42,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-02 12:28:42,808 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-02 12:28:42,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-02 12:28:42,809 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-12-02 12:28:42,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-12-02 12:28:42,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 12:28:42,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 12:28:42,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 12:28:42,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 12:28:42,812 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 12:28:42,993 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 12:28:42,995 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 12:28:43,527 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 12:28:44,236 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 12:28:44,236 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 12:28:44,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:28:44 BoogieIcfgContainer [2023-12-02 12:28:44,237 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 12:28:44,240 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 12:28:44,240 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 12:28:44,243 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 12:28:44,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:28:41" (1/3) ... [2023-12-02 12:28:44,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16984e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:28:44, skipping insertion in model container [2023-12-02 12:28:44,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:28:42" (2/3) ... [2023-12-02 12:28:44,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16984e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:28:44, skipping insertion in model container [2023-12-02 12:28:44,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:28:44" (3/3) ... [2023-12-02 12:28:44,246 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.oepc.i [2023-12-02 12:28:44,267 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 12:28:44,267 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2023-12-02 12:28:44,267 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 12:28:44,438 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 12:28:44,471 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 102 transitions, 220 flow [2023-12-02 12:29:02,732 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 674304 states, 659870 states have (on average 4.782614757452225) internal successors, (3155904), 674303 states have internal predecessors, (3155904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:02,756 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 12:29:02,762 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@a61a6d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 12:29:02,763 INFO L358 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2023-12-02 12:29:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 674304 states, 659870 states have (on average 4.782614757452225) internal successors, (3155904), 674303 states have internal predecessors, (3155904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:05,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 12:29:05,308 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:29:05,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 12:29:05,309 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:29:05,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:29:05,317 INFO L85 PathProgramCache]: Analyzing trace with hash 27754, now seen corresponding path program 1 times [2023-12-02 12:29:05,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:29:05,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607041196] [2023-12-02 12:29:05,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:29:05,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:29:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:29:05,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:29:05,584 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:29:05,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607041196] [2023-12-02 12:29:05,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607041196] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:29:05,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:29:05,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 12:29:05,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271230843] [2023-12-02 12:29:05,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:29:05,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:29:05,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:29:05,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:29:05,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:29:06,978 INFO L87 Difference]: Start difference. First operand has 674304 states, 659870 states have (on average 4.782614757452225) internal successors, (3155904), 674303 states have internal predecessors, (3155904), 0 states have call successors, (0), 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 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:09,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:29:09,477 INFO L93 Difference]: Finished difference Result 119029 states and 530147 transitions. [2023-12-02 12:29:09,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:29:09,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-12-02 12:29:09,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:29:10,930 INFO L225 Difference]: With dead ends: 119029 [2023-12-02 12:29:10,930 INFO L226 Difference]: Without dead ends: 119029 [2023-12-02 12:29:10,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:29:10,937 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 63 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:29:10,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 36 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:29:11,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119029 states. [2023-12-02 12:29:14,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119029 to 119029. [2023-12-02 12:29:15,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119029 states, 118432 states have (on average 4.4763830721426645) internal successors, (530147), 119028 states have internal predecessors, (530147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:16,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119029 states to 119029 states and 530147 transitions. [2023-12-02 12:29:16,380 INFO L78 Accepts]: Start accepts. Automaton has 119029 states and 530147 transitions. Word has length 2 [2023-12-02 12:29:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:29:16,380 INFO L495 AbstractCegarLoop]: Abstraction has 119029 states and 530147 transitions. [2023-12-02 12:29:16,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:16,381 INFO L276 IsEmpty]: Start isEmpty. Operand 119029 states and 530147 transitions. [2023-12-02 12:29:16,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 12:29:16,381 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:29:16,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 12:29:16,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 12:29:16,382 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:29:16,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:29:16,383 INFO L85 PathProgramCache]: Analyzing trace with hash 27755, now seen corresponding path program 1 times [2023-12-02 12:29:16,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:29:16,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882654099] [2023-12-02 12:29:16,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:29:16,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:29:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:29:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:29:16,537 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:29:16,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882654099] [2023-12-02 12:29:16,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882654099] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:29:16,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:29:16,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 12:29:16,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475410624] [2023-12-02 12:29:16,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:29:16,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:29:16,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:29:16,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:29:16,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:29:16,542 INFO L87 Difference]: Start difference. First operand 119029 states and 530147 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:18,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:29:18,577 INFO L93 Difference]: Finished difference Result 119028 states and 530146 transitions. [2023-12-02 12:29:18,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:29:18,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-12-02 12:29:18,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:29:19,598 INFO L225 Difference]: With dead ends: 119028 [2023-12-02 12:29:19,598 INFO L226 Difference]: Without dead ends: 119028 [2023-12-02 12:29:19,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:29:19,606 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 62 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:29:19,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 37 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:29:19,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119028 states. [2023-12-02 12:29:23,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119028 to 119028. [2023-12-02 12:29:23,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119028 states, 118432 states have (on average 4.47637462847879) internal successors, (530146), 119027 states have internal predecessors, (530146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:24,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119028 states to 119028 states and 530146 transitions. [2023-12-02 12:29:24,379 INFO L78 Accepts]: Start accepts. Automaton has 119028 states and 530146 transitions. Word has length 2 [2023-12-02 12:29:24,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:29:24,379 INFO L495 AbstractCegarLoop]: Abstraction has 119028 states and 530146 transitions. [2023-12-02 12:29:24,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:24,380 INFO L276 IsEmpty]: Start isEmpty. Operand 119028 states and 530146 transitions. [2023-12-02 12:29:24,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 12:29:24,380 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:29:24,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 12:29:24,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 12:29:24,381 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:29:24,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:29:24,382 INFO L85 PathProgramCache]: Analyzing trace with hash 827755138, now seen corresponding path program 1 times [2023-12-02 12:29:24,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:29:24,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696085268] [2023-12-02 12:29:24,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:29:24,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:29:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:29:24,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:29:24,464 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:29:24,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696085268] [2023-12-02 12:29:24,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696085268] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:29:24,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:29:24,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:29:24,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441718807] [2023-12-02 12:29:24,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:29:24,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:29:24,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:29:24,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:29:24,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:29:24,467 INFO L87 Difference]: Start difference. First operand 119028 states and 530146 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:29:25,948 INFO L93 Difference]: Finished difference Result 119019 states and 530129 transitions. [2023-12-02 12:29:25,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:29:25,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-12-02 12:29:25,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:29:26,635 INFO L225 Difference]: With dead ends: 119019 [2023-12-02 12:29:26,635 INFO L226 Difference]: Without dead ends: 119019 [2023-12-02 12:29:26,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:29:26,637 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 59 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:29:26,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 40 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:29:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119019 states. [2023-12-02 12:29:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119019 to 119019. [2023-12-02 12:29:30,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119019 states, 118426 states have (on average 4.476457872426663) internal successors, (530129), 119018 states have internal predecessors, (530129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:31,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119019 states to 119019 states and 530129 transitions. [2023-12-02 12:29:31,233 INFO L78 Accepts]: Start accepts. Automaton has 119019 states and 530129 transitions. Word has length 5 [2023-12-02 12:29:31,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:29:31,234 INFO L495 AbstractCegarLoop]: Abstraction has 119019 states and 530129 transitions. [2023-12-02 12:29:31,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:31,234 INFO L276 IsEmpty]: Start isEmpty. Operand 119019 states and 530129 transitions. [2023-12-02 12:29:31,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 12:29:31,235 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:29:31,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 12:29:31,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 12:29:31,235 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:29:31,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:29:31,236 INFO L85 PathProgramCache]: Analyzing trace with hash 827755139, now seen corresponding path program 1 times [2023-12-02 12:29:31,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:29:31,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515246776] [2023-12-02 12:29:31,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:29:31,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:29:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:29:31,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:29:31,331 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:29:31,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515246776] [2023-12-02 12:29:31,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515246776] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:29:31,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:29:31,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:29:31,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911329267] [2023-12-02 12:29:31,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:29:31,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:29:31,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:29:31,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:29:31,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:29:31,333 INFO L87 Difference]: Start difference. First operand 119019 states and 530129 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:32,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:29:32,998 INFO L93 Difference]: Finished difference Result 119010 states and 530112 transitions. [2023-12-02 12:29:32,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:29:32,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-12-02 12:29:32,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:29:33,764 INFO L225 Difference]: With dead ends: 119010 [2023-12-02 12:29:33,765 INFO L226 Difference]: Without dead ends: 119010 [2023-12-02 12:29:33,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:29:33,766 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 58 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:29:33,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 41 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:29:34,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119010 states. [2023-12-02 12:29:38,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119010 to 119010. [2023-12-02 12:29:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119010 states, 118420 states have (on average 4.476541124809998) internal successors, (530112), 119009 states have internal predecessors, (530112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:38,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119010 states to 119010 states and 530112 transitions. [2023-12-02 12:29:38,744 INFO L78 Accepts]: Start accepts. Automaton has 119010 states and 530112 transitions. Word has length 5 [2023-12-02 12:29:38,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:29:38,745 INFO L495 AbstractCegarLoop]: Abstraction has 119010 states and 530112 transitions. [2023-12-02 12:29:38,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:38,745 INFO L276 IsEmpty]: Start isEmpty. Operand 119010 states and 530112 transitions. [2023-12-02 12:29:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 12:29:38,746 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:29:38,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 12:29:38,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 12:29:38,746 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:29:38,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:29:38,747 INFO L85 PathProgramCache]: Analyzing trace with hash 827757897, now seen corresponding path program 1 times [2023-12-02 12:29:38,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:29:38,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962533100] [2023-12-02 12:29:38,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:29:38,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:29:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:29:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:29:38,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:29:38,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962533100] [2023-12-02 12:29:38,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962533100] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:29:38,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:29:38,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:29:38,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220683275] [2023-12-02 12:29:38,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:29:38,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:29:38,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:29:38,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:29:38,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:29:38,869 INFO L87 Difference]: Start difference. First operand 119010 states and 530112 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:40,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:29:40,191 INFO L93 Difference]: Finished difference Result 86139 states and 366780 transitions. [2023-12-02 12:29:40,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:29:40,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-12-02 12:29:40,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:29:40,654 INFO L225 Difference]: With dead ends: 86139 [2023-12-02 12:29:40,654 INFO L226 Difference]: Without dead ends: 86139 [2023-12-02 12:29:40,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:29:40,656 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 127 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:29:40,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 61 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:29:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86139 states. [2023-12-02 12:29:43,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86139 to 79983. [2023-12-02 12:29:43,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79983 states, 79766 states have (on average 4.383597021287265) internal successors, (349662), 79982 states have internal predecessors, (349662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79983 states to 79983 states and 349662 transitions. [2023-12-02 12:29:43,934 INFO L78 Accepts]: Start accepts. Automaton has 79983 states and 349662 transitions. Word has length 5 [2023-12-02 12:29:43,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:29:43,934 INFO L495 AbstractCegarLoop]: Abstraction has 79983 states and 349662 transitions. [2023-12-02 12:29:43,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 79983 states and 349662 transitions. [2023-12-02 12:29:43,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 12:29:43,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:29:43,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 12:29:43,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 12:29:43,935 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:29:43,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:29:43,936 INFO L85 PathProgramCache]: Analyzing trace with hash 827757898, now seen corresponding path program 1 times [2023-12-02 12:29:43,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:29:43,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011138472] [2023-12-02 12:29:43,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:29:43,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:29:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:29:44,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:29:44,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:29:44,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011138472] [2023-12-02 12:29:44,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011138472] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:29:44,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:29:44,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 12:29:44,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811494215] [2023-12-02 12:29:44,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:29:44,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:29:44,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:29:44,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:29:44,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:29:44,032 INFO L87 Difference]: Start difference. First operand 79983 states and 349662 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:44,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:29:44,415 INFO L93 Difference]: Finished difference Result 40746 states and 170495 transitions. [2023-12-02 12:29:44,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:29:44,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-12-02 12:29:44,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:29:45,114 INFO L225 Difference]: With dead ends: 40746 [2023-12-02 12:29:45,115 INFO L226 Difference]: Without dead ends: 39414 [2023-12-02 12:29:45,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:29:45,116 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:29:45,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 21 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:29:45,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39414 states. [2023-12-02 12:29:46,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39414 to 39414. [2023-12-02 12:29:46,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39414 states, 39376 states have (on average 4.16611641609102) internal successors, (164045), 39413 states have internal predecessors, (164045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:46,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39414 states to 39414 states and 164045 transitions. [2023-12-02 12:29:46,585 INFO L78 Accepts]: Start accepts. Automaton has 39414 states and 164045 transitions. Word has length 5 [2023-12-02 12:29:46,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:29:46,585 INFO L495 AbstractCegarLoop]: Abstraction has 39414 states and 164045 transitions. [2023-12-02 12:29:46,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:46,585 INFO L276 IsEmpty]: Start isEmpty. Operand 39414 states and 164045 transitions. [2023-12-02 12:29:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 12:29:46,586 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:29:46,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:29:46,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 12:29:46,592 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:29:46,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:29:46,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2047957849, now seen corresponding path program 1 times [2023-12-02 12:29:46,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:29:46,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411618774] [2023-12-02 12:29:46,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:29:46,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:29:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:29:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:29:46,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:29:46,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411618774] [2023-12-02 12:29:46,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411618774] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:29:46,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:29:46,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:29:46,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911796075] [2023-12-02 12:29:46,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:29:46,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:29:46,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:29:46,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:29:46,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:29:46,697 INFO L87 Difference]: Start difference. First operand 39414 states and 164045 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:47,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:29:47,109 INFO L93 Difference]: Finished difference Result 39372 states and 163932 transitions. [2023-12-02 12:29:47,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:29:47,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-12-02 12:29:47,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:29:47,371 INFO L225 Difference]: With dead ends: 39372 [2023-12-02 12:29:47,371 INFO L226 Difference]: Without dead ends: 39372 [2023-12-02 12:29:47,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:29:47,373 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 41 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 44 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 [2023-12-02 12:29:47,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 44 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:29:47,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39372 states. [2023-12-02 12:29:48,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39372 to 39372. [2023-12-02 12:29:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39372 states, 39335 states have (on average 4.167586119232236) internal successors, (163932), 39371 states have internal predecessors, (163932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39372 states to 39372 states and 163932 transitions. [2023-12-02 12:29:48,916 INFO L78 Accepts]: Start accepts. Automaton has 39372 states and 163932 transitions. Word has length 8 [2023-12-02 12:29:48,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:29:48,917 INFO L495 AbstractCegarLoop]: Abstraction has 39372 states and 163932 transitions. [2023-12-02 12:29:48,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:48,917 INFO L276 IsEmpty]: Start isEmpty. Operand 39372 states and 163932 transitions. [2023-12-02 12:29:48,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 12:29:48,918 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:29:48,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:29:48,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 12:29:48,918 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:29:48,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:29:48,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2047957848, now seen corresponding path program 1 times [2023-12-02 12:29:48,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:29:48,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906956084] [2023-12-02 12:29:48,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:29:48,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:29:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:29:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:29:49,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:29:49,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906956084] [2023-12-02 12:29:49,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906956084] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:29:49,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:29:49,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:29:49,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242802087] [2023-12-02 12:29:49,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:29:49,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:29:49,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:29:49,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:29:49,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:29:49,030 INFO L87 Difference]: Start difference. First operand 39372 states and 163932 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:49,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:29:49,410 INFO L93 Difference]: Finished difference Result 39330 states and 163819 transitions. [2023-12-02 12:29:49,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:29:49,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-12-02 12:29:49,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:29:49,601 INFO L225 Difference]: With dead ends: 39330 [2023-12-02 12:29:49,601 INFO L226 Difference]: Without dead ends: 39330 [2023-12-02 12:29:49,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:29:49,602 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 40 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:29:49,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 45 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:29:49,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39330 states. [2023-12-02 12:29:50,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39330 to 39330. [2023-12-02 12:29:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39330 states, 39294 states have (on average 4.169058889397872) internal successors, (163819), 39329 states have internal predecessors, (163819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39330 states to 39330 states and 163819 transitions. [2023-12-02 12:29:50,986 INFO L78 Accepts]: Start accepts. Automaton has 39330 states and 163819 transitions. Word has length 8 [2023-12-02 12:29:50,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:29:50,987 INFO L495 AbstractCegarLoop]: Abstraction has 39330 states and 163819 transitions. [2023-12-02 12:29:50,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 39330 states and 163819 transitions. [2023-12-02 12:29:50,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 12:29:50,988 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:29:50,989 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:29:50,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 12:29:50,989 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:29:50,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:29:50,990 INFO L85 PathProgramCache]: Analyzing trace with hash -700901289, now seen corresponding path program 1 times [2023-12-02 12:29:50,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:29:50,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035107225] [2023-12-02 12:29:50,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:29:50,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:29:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:29:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:29:51,064 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:29:51,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035107225] [2023-12-02 12:29:51,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035107225] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:29:51,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:29:51,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:29:51,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955237351] [2023-12-02 12:29:51,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:29:51,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:29:51,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:29:51,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:29:51,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:29:51,068 INFO L87 Difference]: Start difference. First operand 39330 states and 163819 transitions. Second operand has 3 states, 2 states have (on average 5.5) 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) [2023-12-02 12:29:51,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:29:51,421 INFO L93 Difference]: Finished difference Result 39036 states and 162776 transitions. [2023-12-02 12:29:51,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:29:51,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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 [2023-12-02 12:29:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:29:51,956 INFO L225 Difference]: With dead ends: 39036 [2023-12-02 12:29:51,956 INFO L226 Difference]: Without dead ends: 39036 [2023-12-02 12:29:51,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:29:51,957 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 37 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:29:51,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 48 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:29:52,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39036 states. [2023-12-02 12:29:52,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39036 to 39036. [2023-12-02 12:29:52,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39036 states, 39001 states have (on average 4.173636573421194) internal successors, (162776), 39035 states have internal predecessors, (162776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:53,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39036 states to 39036 states and 162776 transitions. [2023-12-02 12:29:53,087 INFO L78 Accepts]: Start accepts. Automaton has 39036 states and 162776 transitions. Word has length 11 [2023-12-02 12:29:53,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:29:53,087 INFO L495 AbstractCegarLoop]: Abstraction has 39036 states and 162776 transitions. [2023-12-02 12:29:53,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) 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) [2023-12-02 12:29:53,088 INFO L276 IsEmpty]: Start isEmpty. Operand 39036 states and 162776 transitions. [2023-12-02 12:29:53,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 12:29:53,089 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:29:53,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:29:53,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 12:29:53,090 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:29:53,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:29:53,090 INFO L85 PathProgramCache]: Analyzing trace with hash -700901288, now seen corresponding path program 1 times [2023-12-02 12:29:53,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:29:53,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262577770] [2023-12-02 12:29:53,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:29:53,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:29:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:29:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:29:53,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:29:53,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262577770] [2023-12-02 12:29:53,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262577770] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:29:53,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:29:53,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:29:53,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206660922] [2023-12-02 12:29:53,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:29:53,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:29:53,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:29:53,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:29:53,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:29:53,219 INFO L87 Difference]: Start difference. First operand 39036 states and 162776 transitions. Second operand has 3 states, 2 states have (on average 5.5) 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) [2023-12-02 12:29:53,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:29:53,910 INFO L93 Difference]: Finished difference Result 38742 states and 161733 transitions. [2023-12-02 12:29:53,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:29:53,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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 [2023-12-02 12:29:53,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:29:54,153 INFO L225 Difference]: With dead ends: 38742 [2023-12-02 12:29:54,153 INFO L226 Difference]: Without dead ends: 38742 [2023-12-02 12:29:54,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:29:54,154 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 36 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 12:29:54,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 49 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 12:29:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38742 states. [2023-12-02 12:29:55,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38742 to 38742. [2023-12-02 12:29:55,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38742 states, 38708 states have (on average 4.178283558954221) internal successors, (161733), 38741 states have internal predecessors, (161733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:55,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38742 states to 38742 states and 161733 transitions. [2023-12-02 12:29:55,765 INFO L78 Accepts]: Start accepts. Automaton has 38742 states and 161733 transitions. Word has length 11 [2023-12-02 12:29:55,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:29:55,766 INFO L495 AbstractCegarLoop]: Abstraction has 38742 states and 161733 transitions. [2023-12-02 12:29:55,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) 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) [2023-12-02 12:29:55,766 INFO L276 IsEmpty]: Start isEmpty. Operand 38742 states and 161733 transitions. [2023-12-02 12:29:55,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 12:29:55,770 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:29:55,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:29:55,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 12:29:55,770 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:29:55,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:29:55,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1814347698, now seen corresponding path program 1 times [2023-12-02 12:29:55,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:29:55,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375540184] [2023-12-02 12:29:55,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:29:55,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:29:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:29:55,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:29:55,920 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:29:55,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375540184] [2023-12-02 12:29:55,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375540184] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:29:55,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:29:55,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 12:29:55,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486203825] [2023-12-02 12:29:55,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:29:55,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:29:55,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:29:55,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:29:55,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:29:55,923 INFO L87 Difference]: Start difference. First operand 38742 states and 161733 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:56,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:29:56,216 INFO L93 Difference]: Finished difference Result 37734 states and 157173 transitions. [2023-12-02 12:29:56,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:29:56,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 12:29:56,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:29:56,351 INFO L225 Difference]: With dead ends: 37734 [2023-12-02 12:29:56,351 INFO L226 Difference]: Without dead ends: 37734 [2023-12-02 12:29:56,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:29:56,352 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 31 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:29:56,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 44 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:29:56,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37734 states. [2023-12-02 12:29:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37734 to 37734. [2023-12-02 12:29:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37734 states, 37700 states have (on average 4.169045092838196) internal successors, (157173), 37733 states have internal predecessors, (157173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37734 states to 37734 states and 157173 transitions. [2023-12-02 12:29:57,575 INFO L78 Accepts]: Start accepts. Automaton has 37734 states and 157173 transitions. Word has length 17 [2023-12-02 12:29:57,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:29:57,575 INFO L495 AbstractCegarLoop]: Abstraction has 37734 states and 157173 transitions. [2023-12-02 12:29:57,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:57,575 INFO L276 IsEmpty]: Start isEmpty. Operand 37734 states and 157173 transitions. [2023-12-02 12:29:57,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 12:29:57,579 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:29:57,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:29:57,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 12:29:57,579 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:29:57,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:29:57,579 INFO L85 PathProgramCache]: Analyzing trace with hash -844368099, now seen corresponding path program 1 times [2023-12-02 12:29:57,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:29:57,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397543187] [2023-12-02 12:29:57,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:29:57,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:29:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:29:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:29:57,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:29:57,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397543187] [2023-12-02 12:29:57,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397543187] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:29:57,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:29:57,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 12:29:57,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240963369] [2023-12-02 12:29:57,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:29:57,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 12:29:57,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:29:57,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 12:29:57,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:29:57,703 INFO L87 Difference]: Start difference. First operand 37734 states and 157173 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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) [2023-12-02 12:29:58,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:29:58,166 INFO L93 Difference]: Finished difference Result 38814 states and 158997 transitions. [2023-12-02 12:29:58,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:29:58,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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 [2023-12-02 12:29:58,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:29:58,322 INFO L225 Difference]: With dead ends: 38814 [2023-12-02 12:29:58,323 INFO L226 Difference]: Without dead ends: 38814 [2023-12-02 12:29:58,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:29:58,323 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 154 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:29:58,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 81 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:29:58,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38814 states. [2023-12-02 12:29:59,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38814 to 36474. [2023-12-02 12:29:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36474 states, 36441 states have (on average 4.163579484646415) internal successors, (151725), 36473 states have internal predecessors, (151725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:29:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36474 states to 36474 states and 151725 transitions. [2023-12-02 12:29:59,556 INFO L78 Accepts]: Start accepts. Automaton has 36474 states and 151725 transitions. Word has length 19 [2023-12-02 12:29:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:29:59,556 INFO L495 AbstractCegarLoop]: Abstraction has 36474 states and 151725 transitions. [2023-12-02 12:29:59,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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) [2023-12-02 12:29:59,556 INFO L276 IsEmpty]: Start isEmpty. Operand 36474 states and 151725 transitions. [2023-12-02 12:29:59,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 12:29:59,560 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:29:59,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:29:59,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 12:29:59,561 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:29:59,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:29:59,561 INFO L85 PathProgramCache]: Analyzing trace with hash -844368098, now seen corresponding path program 1 times [2023-12-02 12:29:59,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:29:59,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066721736] [2023-12-02 12:29:59,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:29:59,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:29:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:29:59,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:29:59,869 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:29:59,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066721736] [2023-12-02 12:29:59,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066721736] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:29:59,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:29:59,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 12:29:59,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651329815] [2023-12-02 12:29:59,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:29:59,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:29:59,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:29:59,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:29:59,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:29:59,872 INFO L87 Difference]: Start difference. First operand 36474 states and 151725 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 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) [2023-12-02 12:30:00,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:30:00,532 INFO L93 Difference]: Finished difference Result 35214 states and 146277 transitions. [2023-12-02 12:30:00,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:30:00,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 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 [2023-12-02 12:30:00,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:30:00,676 INFO L225 Difference]: With dead ends: 35214 [2023-12-02 12:30:00,676 INFO L226 Difference]: Without dead ends: 35214 [2023-12-02 12:30:00,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:30:00,677 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 125 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:30:00,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 90 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:30:00,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35214 states. [2023-12-02 12:30:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35214 to 35214. [2023-12-02 12:30:01,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35214 states, 35182 states have (on average 4.157722699107498) internal successors, (146277), 35213 states have internal predecessors, (146277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35214 states to 35214 states and 146277 transitions. [2023-12-02 12:30:01,898 INFO L78 Accepts]: Start accepts. Automaton has 35214 states and 146277 transitions. Word has length 19 [2023-12-02 12:30:01,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:30:01,898 INFO L495 AbstractCegarLoop]: Abstraction has 35214 states and 146277 transitions. [2023-12-02 12:30:01,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 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) [2023-12-02 12:30:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand 35214 states and 146277 transitions. [2023-12-02 12:30:01,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 12:30:01,910 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:30:01,910 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:30:01,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 12:30:01,910 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:30:01,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:30:01,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1169260807, now seen corresponding path program 1 times [2023-12-02 12:30:01,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:30:01,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003568375] [2023-12-02 12:30:01,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:30:01,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:30:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:30:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:30:02,109 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:30:02,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003568375] [2023-12-02 12:30:02,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003568375] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:30:02,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:30:02,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:30:02,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789490551] [2023-12-02 12:30:02,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:30:02,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:30:02,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:30:02,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:30:02,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:30:02,111 INFO L87 Difference]: Start difference. First operand 35214 states and 146277 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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) [2023-12-02 12:30:02,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:30:02,485 INFO L93 Difference]: Finished difference Result 28110 states and 111961 transitions. [2023-12-02 12:30:02,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:30:02,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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 [2023-12-02 12:30:02,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:30:02,593 INFO L225 Difference]: With dead ends: 28110 [2023-12-02 12:30:02,593 INFO L226 Difference]: Without dead ends: 26346 [2023-12-02 12:30:02,594 INFO L412 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 [2023-12-02 12:30:02,594 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 77 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:30:02,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 53 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:30:02,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26346 states. [2023-12-02 12:30:03,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26346 to 26346. [2023-12-02 12:30:03,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26346 states, 26314 states have (on average 4.012958881203922) internal successors, (105597), 26345 states have internal predecessors, (105597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26346 states to 26346 states and 105597 transitions. [2023-12-02 12:30:03,317 INFO L78 Accepts]: Start accepts. Automaton has 26346 states and 105597 transitions. Word has length 21 [2023-12-02 12:30:03,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:30:03,318 INFO L495 AbstractCegarLoop]: Abstraction has 26346 states and 105597 transitions. [2023-12-02 12:30:03,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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) [2023-12-02 12:30:03,318 INFO L276 IsEmpty]: Start isEmpty. Operand 26346 states and 105597 transitions. [2023-12-02 12:30:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 12:30:03,335 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:30:03,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:30:03,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 12:30:03,336 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:30:03,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:30:03,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1675748791, now seen corresponding path program 1 times [2023-12-02 12:30:03,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:30:03,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78129379] [2023-12-02 12:30:03,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:30:03,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:30:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:30:03,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:30:03,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:30:03,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78129379] [2023-12-02 12:30:03,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78129379] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:30:03,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:30:03,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 12:30:03,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848203746] [2023-12-02 12:30:03,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:30:03,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 12:30:03,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:30:03,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 12:30:03,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:30:03,789 INFO L87 Difference]: Start difference. First operand 26346 states and 105597 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:04,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:30:04,077 INFO L93 Difference]: Finished difference Result 14924 states and 56310 transitions. [2023-12-02 12:30:04,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 12:30:04,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-02 12:30:04,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:30:04,125 INFO L225 Difference]: With dead ends: 14924 [2023-12-02 12:30:04,125 INFO L226 Difference]: Without dead ends: 13560 [2023-12-02 12:30:04,125 INFO L412 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 [2023-12-02 12:30:04,126 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 131 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:30:04,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 69 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:30:04,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13560 states. [2023-12-02 12:30:04,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13560 to 13560. [2023-12-02 12:30:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13560 states, 13534 states have (on average 3.7849859612826955) internal successors, (51226), 13559 states have internal predecessors, (51226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:04,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13560 states to 13560 states and 51226 transitions. [2023-12-02 12:30:04,477 INFO L78 Accepts]: Start accepts. Automaton has 13560 states and 51226 transitions. Word has length 25 [2023-12-02 12:30:04,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:30:04,477 INFO L495 AbstractCegarLoop]: Abstraction has 13560 states and 51226 transitions. [2023-12-02 12:30:04,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:04,477 INFO L276 IsEmpty]: Start isEmpty. Operand 13560 states and 51226 transitions. [2023-12-02 12:30:04,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-02 12:30:04,492 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:30:04,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:30:04,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 12:30:04,493 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:30:04,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:30:04,493 INFO L85 PathProgramCache]: Analyzing trace with hash -225747755, now seen corresponding path program 1 times [2023-12-02 12:30:04,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:30:04,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204094452] [2023-12-02 12:30:04,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:30:04,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:30:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:30:04,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:30:04,693 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:30:04,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204094452] [2023-12-02 12:30:04,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204094452] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:30:04,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:30:04,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:30:04,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099234786] [2023-12-02 12:30:04,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:30:04,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:30:04,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:30:04,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:30:04,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:30:04,696 INFO L87 Difference]: Start difference. First operand 13560 states and 51226 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:04,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:30:04,968 INFO L93 Difference]: Finished difference Result 7164 states and 26222 transitions. [2023-12-02 12:30:04,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:30:04,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-12-02 12:30:04,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:30:04,988 INFO L225 Difference]: With dead ends: 7164 [2023-12-02 12:30:04,988 INFO L226 Difference]: Without dead ends: 6520 [2023-12-02 12:30:04,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-02 12:30:04,989 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 205 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:30:04,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 76 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:30:05,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6520 states. [2023-12-02 12:30:05,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6520 to 6520. [2023-12-02 12:30:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6520 states, 6508 states have (on average 3.671481253841426) internal successors, (23894), 6519 states have internal predecessors, (23894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:05,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6520 states to 6520 states and 23894 transitions. [2023-12-02 12:30:05,144 INFO L78 Accepts]: Start accepts. Automaton has 6520 states and 23894 transitions. Word has length 29 [2023-12-02 12:30:05,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:30:05,144 INFO L495 AbstractCegarLoop]: Abstraction has 6520 states and 23894 transitions. [2023-12-02 12:30:05,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:05,144 INFO L276 IsEmpty]: Start isEmpty. Operand 6520 states and 23894 transitions. [2023-12-02 12:30:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 12:30:05,157 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:30:05,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:30:05,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 12:30:05,157 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:30:05,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:30:05,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1448709459, now seen corresponding path program 1 times [2023-12-02 12:30:05,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:30:05,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244550601] [2023-12-02 12:30:05,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:30:05,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:30:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:30:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:30:05,509 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:30:05,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244550601] [2023-12-02 12:30:05,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244550601] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:30:05,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:30:05,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 12:30:05,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636121690] [2023-12-02 12:30:05,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:30:05,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 12:30:05,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:30:05,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 12:30:05,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:30:05,511 INFO L87 Difference]: Start difference. First operand 6520 states and 23894 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:05,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:30:05,805 INFO L93 Difference]: Finished difference Result 4896 states and 18266 transitions. [2023-12-02 12:30:05,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 12:30:05,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-02 12:30:05,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:30:05,824 INFO L225 Difference]: With dead ends: 4896 [2023-12-02 12:30:05,824 INFO L226 Difference]: Without dead ends: 4736 [2023-12-02 12:30:05,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-02 12:30:05,825 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 217 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:30:05,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 70 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:30:05,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4736 states. [2023-12-02 12:30:06,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4736 to 4736. [2023-12-02 12:30:06,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4736 states, 4734 states have (on average 3.7452471482889735) internal successors, (17730), 4735 states have internal predecessors, (17730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:06,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4736 states to 4736 states and 17730 transitions. [2023-12-02 12:30:06,084 INFO L78 Accepts]: Start accepts. Automaton has 4736 states and 17730 transitions. Word has length 34 [2023-12-02 12:30:06,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:30:06,084 INFO L495 AbstractCegarLoop]: Abstraction has 4736 states and 17730 transitions. [2023-12-02 12:30:06,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:06,084 INFO L276 IsEmpty]: Start isEmpty. Operand 4736 states and 17730 transitions. [2023-12-02 12:30:06,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 12:30:06,100 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:30:06,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:30:06,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-02 12:30:06,100 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:30:06,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:30:06,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1440975746, now seen corresponding path program 1 times [2023-12-02 12:30:06,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:30:06,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549434948] [2023-12-02 12:30:06,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:30:06,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:30:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:30:07,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:30:07,080 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:30:07,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549434948] [2023-12-02 12:30:07,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549434948] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:30:07,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:30:07,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 12:30:07,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910643681] [2023-12-02 12:30:07,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:30:07,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 12:30:07,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:30:07,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 12:30:07,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 12:30:07,083 INFO L87 Difference]: Start difference. First operand 4736 states and 17730 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:07,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:30:07,451 INFO L93 Difference]: Finished difference Result 8912 states and 33070 transitions. [2023-12-02 12:30:07,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 12:30:07,451 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-12-02 12:30:07,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:30:07,484 INFO L225 Difference]: With dead ends: 8912 [2023-12-02 12:30:07,484 INFO L226 Difference]: Without dead ends: 8912 [2023-12-02 12:30:07,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-02 12:30:07,486 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 127 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:30:07,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 194 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:30:07,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8912 states. [2023-12-02 12:30:07,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8912 to 6880. [2023-12-02 12:30:07,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6880 states, 6878 states have (on average 3.74265774934574) internal successors, (25742), 6879 states have internal predecessors, (25742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:07,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6880 states to 6880 states and 25742 transitions. [2023-12-02 12:30:07,655 INFO L78 Accepts]: Start accepts. Automaton has 6880 states and 25742 transitions. Word has length 39 [2023-12-02 12:30:07,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:30:07,656 INFO L495 AbstractCegarLoop]: Abstraction has 6880 states and 25742 transitions. [2023-12-02 12:30:07,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:07,656 INFO L276 IsEmpty]: Start isEmpty. Operand 6880 states and 25742 transitions. [2023-12-02 12:30:07,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 12:30:07,673 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:30:07,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:30:07,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-02 12:30:07,673 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:30:07,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:30:07,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1440974614, now seen corresponding path program 1 times [2023-12-02 12:30:07,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:30:07,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921731217] [2023-12-02 12:30:07,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:30:07,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:30:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:30:10,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:30:10,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 12:30:10,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921731217] [2023-12-02 12:30:10,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921731217] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:30:10,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:30:10,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-02 12:30:10,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687061700] [2023-12-02 12:30:10,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:30:10,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 12:30:10,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 12:30:10,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 12:30:10,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-02 12:30:10,724 INFO L87 Difference]: Start difference. First operand 6880 states and 25742 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:11,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:30:11,267 INFO L93 Difference]: Finished difference Result 9008 states and 33374 transitions. [2023-12-02 12:30:11,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 12:30:11,268 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-12-02 12:30:11,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:30:11,282 INFO L225 Difference]: With dead ends: 9008 [2023-12-02 12:30:11,282 INFO L226 Difference]: Without dead ends: 5776 [2023-12-02 12:30:11,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-12-02 12:30:11,283 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 106 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 12:30:11,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 424 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 12:30:11,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5776 states. [2023-12-02 12:30:11,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5776 to 4688. [2023-12-02 12:30:11,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4688 states, 4687 states have (on average 3.6931939406870065) internal successors, (17310), 4687 states have internal predecessors, (17310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4688 states to 4688 states and 17310 transitions. [2023-12-02 12:30:11,390 INFO L78 Accepts]: Start accepts. Automaton has 4688 states and 17310 transitions. Word has length 39 [2023-12-02 12:30:11,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:30:11,390 INFO L495 AbstractCegarLoop]: Abstraction has 4688 states and 17310 transitions. [2023-12-02 12:30:11,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 4688 states and 17310 transitions. [2023-12-02 12:30:11,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 12:30:11,401 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:30:11,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:30:11,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-02 12:30:11,401 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:30:11,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:30:11,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1707307000, now seen corresponding path program 2 times [2023-12-02 12:30:11,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 12:30:11,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467674360] [2023-12-02 12:30:11,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:30:11,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 12:30:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 12:30:11,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 12:30:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 12:30:11,616 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 12:30:11,616 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 12:30:11,617 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (87 of 88 remaining) [2023-12-02 12:30:11,619 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 88 remaining) [2023-12-02 12:30:11,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 88 remaining) [2023-12-02 12:30:11,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 88 remaining) [2023-12-02 12:30:11,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 88 remaining) [2023-12-02 12:30:11,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 88 remaining) [2023-12-02 12:30:11,620 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 88 remaining) [2023-12-02 12:30:11,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 88 remaining) [2023-12-02 12:30:11,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 88 remaining) [2023-12-02 12:30:11,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 88 remaining) [2023-12-02 12:30:11,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 88 remaining) [2023-12-02 12:30:11,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 88 remaining) [2023-12-02 12:30:11,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 88 remaining) [2023-12-02 12:30:11,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 88 remaining) [2023-12-02 12:30:11,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 88 remaining) [2023-12-02 12:30:11,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 88 remaining) [2023-12-02 12:30:11,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 88 remaining) [2023-12-02 12:30:11,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 88 remaining) [2023-12-02 12:30:11,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 88 remaining) [2023-12-02 12:30:11,622 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 88 remaining) [2023-12-02 12:30:11,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 88 remaining) [2023-12-02 12:30:11,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 88 remaining) [2023-12-02 12:30:11,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 88 remaining) [2023-12-02 12:30:11,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 88 remaining) [2023-12-02 12:30:11,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 88 remaining) [2023-12-02 12:30:11,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 88 remaining) [2023-12-02 12:30:11,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 88 remaining) [2023-12-02 12:30:11,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 88 remaining) [2023-12-02 12:30:11,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 88 remaining) [2023-12-02 12:30:11,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 88 remaining) [2023-12-02 12:30:11,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 88 remaining) [2023-12-02 12:30:11,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 88 remaining) [2023-12-02 12:30:11,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 88 remaining) [2023-12-02 12:30:11,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 88 remaining) [2023-12-02 12:30:11,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 88 remaining) [2023-12-02 12:30:11,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 88 remaining) [2023-12-02 12:30:11,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 88 remaining) [2023-12-02 12:30:11,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 88 remaining) [2023-12-02 12:30:11,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 88 remaining) [2023-12-02 12:30:11,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 88 remaining) [2023-12-02 12:30:11,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 88 remaining) [2023-12-02 12:30:11,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 88 remaining) [2023-12-02 12:30:11,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 88 remaining) [2023-12-02 12:30:11,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 88 remaining) [2023-12-02 12:30:11,626 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 88 remaining) [2023-12-02 12:30:11,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 88 remaining) [2023-12-02 12:30:11,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 88 remaining) [2023-12-02 12:30:11,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 88 remaining) [2023-12-02 12:30:11,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 88 remaining) [2023-12-02 12:30:11,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (38 of 88 remaining) [2023-12-02 12:30:11,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 88 remaining) [2023-12-02 12:30:11,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 88 remaining) [2023-12-02 12:30:11,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 88 remaining) [2023-12-02 12:30:11,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 88 remaining) [2023-12-02 12:30:11,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 88 remaining) [2023-12-02 12:30:11,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 88 remaining) [2023-12-02 12:30:11,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 88 remaining) [2023-12-02 12:30:11,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 88 remaining) [2023-12-02 12:30:11,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 88 remaining) [2023-12-02 12:30:11,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 88 remaining) [2023-12-02 12:30:11,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 88 remaining) [2023-12-02 12:30:11,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 88 remaining) [2023-12-02 12:30:11,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 88 remaining) [2023-12-02 12:30:11,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 88 remaining) [2023-12-02 12:30:11,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 88 remaining) [2023-12-02 12:30:11,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 88 remaining) [2023-12-02 12:30:11,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 88 remaining) [2023-12-02 12:30:11,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 88 remaining) [2023-12-02 12:30:11,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 88 remaining) [2023-12-02 12:30:11,630 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 88 remaining) [2023-12-02 12:30:11,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 88 remaining) [2023-12-02 12:30:11,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 88 remaining) [2023-12-02 12:30:11,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 88 remaining) [2023-12-02 12:30:11,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 88 remaining) [2023-12-02 12:30:11,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 88 remaining) [2023-12-02 12:30:11,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 88 remaining) [2023-12-02 12:30:11,631 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 88 remaining) [2023-12-02 12:30:11,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 88 remaining) [2023-12-02 12:30:11,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 88 remaining) [2023-12-02 12:30:11,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 88 remaining) [2023-12-02 12:30:11,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 88 remaining) [2023-12-02 12:30:11,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 88 remaining) [2023-12-02 12:30:11,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 88 remaining) [2023-12-02 12:30:11,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 88 remaining) [2023-12-02 12:30:11,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 88 remaining) [2023-12-02 12:30:11,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 88 remaining) [2023-12-02 12:30:11,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 88 remaining) [2023-12-02 12:30:11,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 88 remaining) [2023-12-02 12:30:11,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-02 12:30:11,637 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:30:11,643 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-02 12:30:11,643 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 12:30:11,727 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated [2023-12-02 12:30:11,733 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated [2023-12-02 12:30:11,738 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre34 could not be translated [2023-12-02 12:30:11,741 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre36 could not be translated [2023-12-02 12:30:11,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:30:11 BasicIcfg [2023-12-02 12:30:11,767 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 12:30:11,768 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 12:30:11,768 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 12:30:11,768 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 12:30:11,768 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:28:44" (3/4) ... [2023-12-02 12:30:11,770 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 12:30:11,771 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 12:30:11,772 INFO L158 Benchmark]: Toolchain (without parser) took 89832.64ms. Allocated memory was 167.8MB in the beginning and 15.6GB in the end (delta: 15.5GB). Free memory was 132.5MB in the beginning and 11.4GB in the end (delta: -11.3GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. [2023-12-02 12:30:11,772 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 117.4MB. Free memory was 88.9MB in the beginning and 88.8MB in the end (delta: 114.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 12:30:11,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 693.54ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 131.3MB in the end (delta: 1.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-12-02 12:30:11,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.50ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 128.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 12:30:11,773 INFO L158 Benchmark]: Boogie Preprocessor took 42.15ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 126.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 12:30:11,774 INFO L158 Benchmark]: RCFGBuilder took 1502.86ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 126.1MB in the beginning and 172.0MB in the end (delta: -45.9MB). Peak memory consumption was 89.3MB. Max. memory is 16.1GB. [2023-12-02 12:30:11,774 INFO L158 Benchmark]: TraceAbstraction took 87527.32ms. Allocated memory was 218.1MB in the beginning and 15.6GB in the end (delta: 15.4GB). Free memory was 170.9MB in the beginning and 11.4GB in the end (delta: -11.2GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. [2023-12-02 12:30:11,775 INFO L158 Benchmark]: Witness Printer took 3.53ms. Allocated memory is still 15.6GB. Free memory is still 11.4GB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 12:30:11,777 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.22ms. Allocated memory is still 117.4MB. Free memory was 88.9MB in the beginning and 88.8MB in the end (delta: 114.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 693.54ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 131.3MB in the end (delta: 1.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.50ms. Allocated memory is still 167.8MB. Free memory was 131.2MB in the beginning and 128.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.15ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 126.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1502.86ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 126.1MB in the beginning and 172.0MB in the end (delta: -45.9MB). Peak memory consumption was 89.3MB. Max. memory is 16.1GB. * TraceAbstraction took 87527.32ms. Allocated memory was 218.1MB in the beginning and 15.6GB in the end (delta: 15.4GB). Free memory was 170.9MB in the beginning and 11.4GB in the end (delta: -11.2GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. * Witness Printer took 3.53ms. Allocated memory is still 15.6GB. Free memory is still 11.4GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre34 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre36 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L744] 0 _Bool y$flush_delayed; [L745] 0 int y$mem_tmp; [L746] 0 _Bool y$r_buff0_thd0; [L747] 0 _Bool y$r_buff0_thd1; [L748] 0 _Bool y$r_buff0_thd2; [L749] 0 _Bool y$r_buff0_thd3; [L750] 0 _Bool y$r_buff0_thd4; [L751] 0 _Bool y$r_buff1_thd0; [L752] 0 _Bool y$r_buff1_thd1; [L753] 0 _Bool y$r_buff1_thd2; [L754] 0 _Bool y$r_buff1_thd3; [L755] 0 _Bool y$r_buff1_thd4; [L756] 0 _Bool y$read_delayed; [L757] 0 int *y$read_delayed_var; [L758] 0 int y$w_buff0; [L759] 0 _Bool y$w_buff0_used; [L760] 0 int y$w_buff1; [L761] 0 _Bool y$w_buff1_used; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L864] 0 pthread_t t2417; [L865] FCALL, FORK 0 pthread_create(&t2417, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2417={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L866] 0 pthread_t t2418; [L768] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 1 y$flush_delayed = weak$$choice2 [L771] EXPR 1 \read(y) [L771] 1 y$mem_tmp = y [L772] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] EXPR 1 \read(y) [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L774] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L775] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L776] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L777] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L779] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L780] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L781] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L782] EXPR 1 \read(y) [L782] 1 __unbuffered_p0_EAX = y [L783] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L783] 1 y = y$flush_delayed ? y$mem_tmp : y [L784] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L787] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L867] FCALL, FORK 0 pthread_create(&t2418, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, t2417={7:0}, t2418={8:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L799] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L868] 0 pthread_t t2419; [L869] FCALL, FORK 0 pthread_create(&t2419, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2417={7:0}, t2418={8:0}, t2419={9:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L811] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L870] 0 pthread_t t2420; [L871] FCALL, FORK 0 pthread_create(&t2420, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2417={7:0}, t2418={8:0}, t2419={9:0}, t2420={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L814] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 3 y$flush_delayed = weak$$choice2 [L817] EXPR 3 \read(y) [L817] 3 y$mem_tmp = y [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] EXPR 3 \read(y) [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L819] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L820] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L821] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L822] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L824] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 \read(y) [L825] 3 __unbuffered_p2_EBX = y [L826] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L826] 3 y = y$flush_delayed ? y$mem_tmp : y [L827] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L839] 4 y = 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 \read(y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L843] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L844] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L845] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L846] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2417={7:0}, t2418={8:0}, t2419={9:0}, t2420={5:0}, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] EXPR 0 \read(y) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L878] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L879] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L880] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L881] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2417={7:0}, t2418={8:0}, t2419={9:0}, t2420={5:0}, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L884] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2417={7:0}, t2418={8:0}, t2419={9:0}, t2420={5:0}, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe027_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 867]: 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: 871]: 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: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 88 error locations. Started 1 CEGAR loops. OverallTime: 87.2s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 2.7s, AutomataDifference: 23.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1747 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1747 mSDsluCounter, 1523 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 989 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2015 IncrementalHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 534 mSDtfsCounter, 2015 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=674304occurred in iteration=0, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 35.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 11616 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 343 NumberOfCodeBlocks, 343 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 3105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 [2023-12-02 12:30:11,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh --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 a9d301fd24d7dbc3684a100e80ac453023513d8631f488025251adcc1a8646b5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 12:30:14,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 12:30:14,585 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 12:30:14,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 12:30:14,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 12:30:14,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 12:30:14,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 12:30:14,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 12:30:14,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 12:30:14,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 12:30:14,625 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 12:30:14,625 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 12:30:14,626 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 12:30:14,626 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 12:30:14,627 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 12:30:14,628 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 12:30:14,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 12:30:14,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 12:30:14,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 12:30:14,630 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 12:30:14,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 12:30:14,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 12:30:14,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 12:30:14,633 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 12:30:14,633 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 12:30:14,634 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 12:30:14,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 12:30:14,634 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 12:30:14,635 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 12:30:14,635 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 12:30:14,636 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 12:30:14,636 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 12:30:14,636 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 12:30:14,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 12:30:14,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 12:30:14,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 12:30:14,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 12:30:14,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:30:14,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 12:30:14,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 12:30:14,639 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 12:30:14,639 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 12:30:14,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 12:30:14,639 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 12:30:14,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 12:30:14,640 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh 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 -> a9d301fd24d7dbc3684a100e80ac453023513d8631f488025251adcc1a8646b5 [2023-12-02 12:30:14,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 12:30:15,003 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 12:30:15,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 12:30:15,008 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 12:30:15,008 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 12:30:15,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i [2023-12-02 12:30:17,869 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 12:30:18,131 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 12:30:18,131 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/sv-benchmarks/c/pthread-wmm/safe027_power.oepc.i [2023-12-02 12:30:18,151 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/data/fd6dce720/a4041f04f9054b4cbe5c9cb5b2a8540b/FLAGac7dc1547 [2023-12-02 12:30:18,165 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/data/fd6dce720/a4041f04f9054b4cbe5c9cb5b2a8540b [2023-12-02 12:30:18,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 12:30:18,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 12:30:18,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 12:30:18,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 12:30:18,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 12:30:18,174 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:30:18" (1/1) ... [2023-12-02 12:30:18,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a0d79f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:18, skipping insertion in model container [2023-12-02 12:30:18,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:30:18" (1/1) ... [2023-12-02 12:30:18,242 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 12:30:18,671 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:30:18,688 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 12:30:18,750 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:30:18,794 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 12:30:18,794 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 12:30:18,804 INFO L206 MainTranslator]: Completed translation [2023-12-02 12:30:18,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:18 WrapperNode [2023-12-02 12:30:18,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 12:30:18,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 12:30:18,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 12:30:18,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 12:30:18,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:18" (1/1) ... [2023-12-02 12:30:18,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:18" (1/1) ... [2023-12-02 12:30:18,881 INFO L138 Inliner]: procedures = 181, calls = 85, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 156 [2023-12-02 12:30:18,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 12:30:18,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 12:30:18,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 12:30:18,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 12:30:18,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:18" (1/1) ... [2023-12-02 12:30:18,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:18" (1/1) ... [2023-12-02 12:30:18,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:18" (1/1) ... [2023-12-02 12:30:18,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:18" (1/1) ... [2023-12-02 12:30:18,917 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:18" (1/1) ... [2023-12-02 12:30:18,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:18" (1/1) ... [2023-12-02 12:30:18,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:18" (1/1) ... [2023-12-02 12:30:18,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:18" (1/1) ... [2023-12-02 12:30:18,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 12:30:18,938 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 12:30:18,938 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 12:30:18,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 12:30:18,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:18" (1/1) ... [2023-12-02 12:30:18,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:30:18,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:30:18,982 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 12:30:18,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 12:30:19,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 12:30:19,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 12:30:19,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 12:30:19,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 12:30:19,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 12:30:19,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 12:30:19,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 12:30:19,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-12-02 12:30:19,026 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-02 12:30:19,027 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-02 12:30:19,027 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-02 12:30:19,027 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-02 12:30:19,028 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-02 12:30:19,028 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-02 12:30:19,028 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-12-02 12:30:19,029 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-12-02 12:30:19,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 12:30:19,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 12:30:19,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 12:30:19,031 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 12:30:19,227 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 12:30:19,229 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 12:30:19,909 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 12:30:20,674 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 12:30:20,674 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 12:30:20,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:30:20 BoogieIcfgContainer [2023-12-02 12:30:20,675 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 12:30:20,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 12:30:20,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 12:30:20,682 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 12:30:20,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:30:18" (1/3) ... [2023-12-02 12:30:20,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f9cc4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:30:20, skipping insertion in model container [2023-12-02 12:30:20,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:30:18" (2/3) ... [2023-12-02 12:30:20,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f9cc4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:30:20, skipping insertion in model container [2023-12-02 12:30:20,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:30:20" (3/3) ... [2023-12-02 12:30:20,685 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.oepc.i [2023-12-02 12:30:20,706 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 12:30:20,707 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2023-12-02 12:30:20,707 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 12:30:20,872 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 12:30:20,895 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 102 transitions, 220 flow [2023-12-02 12:30:40,822 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 674304 states, 659870 states have (on average 4.782614757452225) internal successors, (3155904), 674303 states have internal predecessors, (3155904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:40,877 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 12:30:40,887 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b9251a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 12:30:40,887 INFO L358 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2023-12-02 12:30:42,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 674304 states, 659870 states have (on average 4.782614757452225) internal successors, (3155904), 674303 states have internal predecessors, (3155904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 12:30:42,073 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:30:42,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 12:30:42,074 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:30:42,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:30:42,078 INFO L85 PathProgramCache]: Analyzing trace with hash 27819, now seen corresponding path program 1 times [2023-12-02 12:30:42,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:30:42,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38635107] [2023-12-02 12:30:42,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:30:42,087 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 [2023-12-02 12:30:42,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:30:42,089 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 12:30:42,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 12:30:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:30:42,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 12:30:42,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:30:42,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 12:30:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:30:42,324 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:30:42,325 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:30:42,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38635107] [2023-12-02 12:30:42,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38635107] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:30:42,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:30:42,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 12:30:42,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987958662] [2023-12-02 12:30:42,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:30:42,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:30:42,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:30:42,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:30:42,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:30:43,339 INFO L87 Difference]: Start difference. First operand has 674304 states, 659870 states have (on average 4.782614757452225) internal successors, (3155904), 674303 states have internal predecessors, (3155904), 0 states have call successors, (0), 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 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:46,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:30:46,029 INFO L93 Difference]: Finished difference Result 119029 states and 530147 transitions. [2023-12-02 12:30:46,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:30:46,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-12-02 12:30:46,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:30:47,741 INFO L225 Difference]: With dead ends: 119029 [2023-12-02 12:30:47,741 INFO L226 Difference]: Without dead ends: 119029 [2023-12-02 12:30:47,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:30:47,746 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 63 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 12:30:47,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 37 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 12:30:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119029 states. [2023-12-02 12:30:52,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119029 to 119029. [2023-12-02 12:30:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119029 states, 118432 states have (on average 4.4763830721426645) internal successors, (530147), 119028 states have internal predecessors, (530147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:53,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119029 states to 119029 states and 530147 transitions. [2023-12-02 12:30:53,884 INFO L78 Accepts]: Start accepts. Automaton has 119029 states and 530147 transitions. Word has length 2 [2023-12-02 12:30:53,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:30:53,885 INFO L495 AbstractCegarLoop]: Abstraction has 119029 states and 530147 transitions. [2023-12-02 12:30:53,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:53,885 INFO L276 IsEmpty]: Start isEmpty. Operand 119029 states and 530147 transitions. [2023-12-02 12:30:53,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 12:30:53,886 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:30:53,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 12:30:53,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 12:30:54,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:30:54,088 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:30:54,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:30:54,089 INFO L85 PathProgramCache]: Analyzing trace with hash 27818, now seen corresponding path program 1 times [2023-12-02 12:30:54,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:30:54,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324865899] [2023-12-02 12:30:54,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:30:54,090 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 [2023-12-02 12:30:54,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:30:54,091 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 12:30:54,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 12:30:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:30:54,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 12:30:54,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:30:54,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 12:30:54,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:30:54,234 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:30:54,234 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:30:54,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324865899] [2023-12-02 12:30:54,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324865899] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:30:54,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:30:54,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 12:30:54,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208786867] [2023-12-02 12:30:54,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:30:54,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:30:54,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:30:54,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:30:54,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:30:54,239 INFO L87 Difference]: Start difference. First operand 119029 states and 530147 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:30:56,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:30:56,077 INFO L93 Difference]: Finished difference Result 119028 states and 530146 transitions. [2023-12-02 12:30:56,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:30:56,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-12-02 12:30:56,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:30:57,157 INFO L225 Difference]: With dead ends: 119028 [2023-12-02 12:30:57,157 INFO L226 Difference]: Without dead ends: 119028 [2023-12-02 12:30:57,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:30:57,158 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 62 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:30:57,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 36 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:30:57,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119028 states. [2023-12-02 12:31:00,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119028 to 119028. [2023-12-02 12:31:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119028 states, 118432 states have (on average 4.47637462847879) internal successors, (530146), 119027 states have internal predecessors, (530146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:02,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119028 states to 119028 states and 530146 transitions. [2023-12-02 12:31:02,269 INFO L78 Accepts]: Start accepts. Automaton has 119028 states and 530146 transitions. Word has length 2 [2023-12-02 12:31:02,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:31:02,270 INFO L495 AbstractCegarLoop]: Abstraction has 119028 states and 530146 transitions. [2023-12-02 12:31:02,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:02,270 INFO L276 IsEmpty]: Start isEmpty. Operand 119028 states and 530146 transitions. [2023-12-02 12:31:02,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 12:31:02,270 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:31:02,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 12:31:02,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 12:31:02,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:31:02,471 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:31:02,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:31:02,472 INFO L85 PathProgramCache]: Analyzing trace with hash 829663748, now seen corresponding path program 1 times [2023-12-02 12:31:02,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:31:02,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61243486] [2023-12-02 12:31:02,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:31:02,473 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 [2023-12-02 12:31:02,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:31:02,474 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 12:31:02,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 12:31:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:31:02,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 12:31:02,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:31:02,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 12:31:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:31:02,638 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:31:02,639 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:31:02,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61243486] [2023-12-02 12:31:02,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [61243486] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:31:02,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:31:02,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:31:02,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615719561] [2023-12-02 12:31:02,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:31:02,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:31:02,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:31:02,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:31:02,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:31:02,642 INFO L87 Difference]: Start difference. First operand 119028 states and 530146 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:04,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:31:04,397 INFO L93 Difference]: Finished difference Result 119019 states and 530129 transitions. [2023-12-02 12:31:04,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:31:04,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-12-02 12:31:04,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:31:05,208 INFO L225 Difference]: With dead ends: 119019 [2023-12-02 12:31:05,208 INFO L226 Difference]: Without dead ends: 119019 [2023-12-02 12:31:05,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:31:05,209 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 59 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:31:05,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 40 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:31:05,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119019 states. [2023-12-02 12:31:09,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119019 to 119019. [2023-12-02 12:31:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119019 states, 118426 states have (on average 4.476457872426663) internal successors, (530129), 119018 states have internal predecessors, (530129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:10,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119019 states to 119019 states and 530129 transitions. [2023-12-02 12:31:10,322 INFO L78 Accepts]: Start accepts. Automaton has 119019 states and 530129 transitions. Word has length 5 [2023-12-02 12:31:10,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:31:10,322 INFO L495 AbstractCegarLoop]: Abstraction has 119019 states and 530129 transitions. [2023-12-02 12:31:10,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:10,323 INFO L276 IsEmpty]: Start isEmpty. Operand 119019 states and 530129 transitions. [2023-12-02 12:31:10,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 12:31:10,323 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:31:10,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 12:31:10,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 12:31:10,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:31:10,524 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:31:10,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:31:10,525 INFO L85 PathProgramCache]: Analyzing trace with hash 829663749, now seen corresponding path program 1 times [2023-12-02 12:31:10,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:31:10,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127185011] [2023-12-02 12:31:10,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:31:10,525 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 [2023-12-02 12:31:10,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:31:10,526 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 12:31:10,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 12:31:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:31:10,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 12:31:10,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:31:10,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 12:31:10,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:31:10,653 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:31:10,654 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:31:10,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127185011] [2023-12-02 12:31:10,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127185011] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:31:10,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:31:10,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:31:10,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018228332] [2023-12-02 12:31:10,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:31:10,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:31:10,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:31:10,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:31:10,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:31:10,656 INFO L87 Difference]: Start difference. First operand 119019 states and 530129 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:12,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:31:12,432 INFO L93 Difference]: Finished difference Result 119010 states and 530112 transitions. [2023-12-02 12:31:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:31:12,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-12-02 12:31:12,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:31:13,167 INFO L225 Difference]: With dead ends: 119010 [2023-12-02 12:31:13,167 INFO L226 Difference]: Without dead ends: 119010 [2023-12-02 12:31:13,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:31:13,168 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 58 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:31:13,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 41 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:31:13,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119010 states. [2023-12-02 12:31:17,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119010 to 119010. [2023-12-02 12:31:17,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119010 states, 118420 states have (on average 4.476541124809998) internal successors, (530112), 119009 states have internal predecessors, (530112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119010 states to 119010 states and 530112 transitions. [2023-12-02 12:31:18,368 INFO L78 Accepts]: Start accepts. Automaton has 119010 states and 530112 transitions. Word has length 5 [2023-12-02 12:31:18,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:31:18,368 INFO L495 AbstractCegarLoop]: Abstraction has 119010 states and 530112 transitions. [2023-12-02 12:31:18,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 119010 states and 530112 transitions. [2023-12-02 12:31:18,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 12:31:18,368 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:31:18,369 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 12:31:18,371 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-02 12:31:18,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:31:18,569 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:31:18,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:31:18,570 INFO L85 PathProgramCache]: Analyzing trace with hash 829666507, now seen corresponding path program 1 times [2023-12-02 12:31:18,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:31:18,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984045387] [2023-12-02 12:31:18,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:31:18,570 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 [2023-12-02 12:31:18,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:31:18,571 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 12:31:18,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 12:31:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:31:18,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 12:31:18,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:31:18,711 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 12:31:18,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-12-02 12:31:18,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:31:18,779 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:31:18,779 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:31:18,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984045387] [2023-12-02 12:31:18,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984045387] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:31:18,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:31:18,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 12:31:18,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642860063] [2023-12-02 12:31:18,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:31:18,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:31:18,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:31:18,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:31:18,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:31:18,782 INFO L87 Difference]: Start difference. First operand 119010 states and 530112 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:20,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:31:20,095 INFO L93 Difference]: Finished difference Result 71163 states and 311064 transitions. [2023-12-02 12:31:20,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:31:20,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-12-02 12:31:20,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:31:20,459 INFO L225 Difference]: With dead ends: 71163 [2023-12-02 12:31:20,459 INFO L226 Difference]: Without dead ends: 71163 [2023-12-02 12:31:20,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:31:20,460 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 50 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 12:31:20,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 35 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 12:31:20,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71163 states. [2023-12-02 12:31:22,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71163 to 71163. [2023-12-02 12:31:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71163 states, 70946 states have (on average 4.384517802272151) internal successors, (311064), 71162 states have internal predecessors, (311064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71163 states to 71163 states and 311064 transitions. [2023-12-02 12:31:23,296 INFO L78 Accepts]: Start accepts. Automaton has 71163 states and 311064 transitions. Word has length 5 [2023-12-02 12:31:23,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:31:23,296 INFO L495 AbstractCegarLoop]: Abstraction has 71163 states and 311064 transitions. [2023-12-02 12:31:23,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 71163 states and 311064 transitions. [2023-12-02 12:31:23,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 12:31:23,297 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:31:23,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 12:31:23,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-02 12:31:23,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:31:23,498 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:31:23,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:31:23,498 INFO L85 PathProgramCache]: Analyzing trace with hash 829666508, now seen corresponding path program 1 times [2023-12-02 12:31:23,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:31:23,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168928127] [2023-12-02 12:31:23,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:31:23,499 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 [2023-12-02 12:31:23,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:31:23,500 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 12:31:23,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 12:31:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:31:23,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 12:31:23,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:31:23,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:31:23,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 12:31:23,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:31:23,691 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:31:23,691 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:31:23,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168928127] [2023-12-02 12:31:23,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168928127] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:31:23,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:31:23,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 12:31:23,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898306326] [2023-12-02 12:31:23,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:31:23,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:31:23,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:31:23,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:31:23,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:31:23,693 INFO L87 Difference]: Start difference. First operand 71163 states and 311064 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:24,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:31:24,159 INFO L93 Difference]: Finished difference Result 34644 states and 147458 transitions. [2023-12-02 12:31:24,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:31:24,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2023-12-02 12:31:24,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:31:24,315 INFO L225 Difference]: With dead ends: 34644 [2023-12-02 12:31:24,315 INFO L226 Difference]: Without dead ends: 34644 [2023-12-02 12:31:24,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:31:24,316 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:31:24,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 21 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:31:24,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34644 states. [2023-12-02 12:31:25,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34644 to 34644. [2023-12-02 12:31:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34644 states, 34606 states have (on average 4.261052996590187) internal successors, (147458), 34643 states have internal predecessors, (147458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34644 states to 34644 states and 147458 transitions. [2023-12-02 12:31:25,673 INFO L78 Accepts]: Start accepts. Automaton has 34644 states and 147458 transitions. Word has length 5 [2023-12-02 12:31:25,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:31:25,673 INFO L495 AbstractCegarLoop]: Abstraction has 34644 states and 147458 transitions. [2023-12-02 12:31:25,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:25,673 INFO L276 IsEmpty]: Start isEmpty. Operand 34644 states and 147458 transitions. [2023-12-02 12:31:25,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 12:31:25,673 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:31:25,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:31:25,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 12:31:25,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:31:25,874 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:31:25,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:31:25,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1023130201, now seen corresponding path program 1 times [2023-12-02 12:31:25,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:31:25,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955678164] [2023-12-02 12:31:25,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:31:25,875 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 [2023-12-02 12:31:25,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:31:25,876 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 12:31:25,877 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 12:31:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:31:25,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 12:31:25,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:31:25,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 12:31:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:31:25,990 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:31:25,991 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:31:25,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955678164] [2023-12-02 12:31:25,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [955678164] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:31:25,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:31:25,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:31:25,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982108462] [2023-12-02 12:31:25,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:31:25,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:31:25,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:31:25,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:31:25,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:31:25,992 INFO L87 Difference]: Start difference. First operand 34644 states and 147458 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:26,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:31:26,377 INFO L93 Difference]: Finished difference Result 34602 states and 147345 transitions. [2023-12-02 12:31:26,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:31:26,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-12-02 12:31:26,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:31:26,542 INFO L225 Difference]: With dead ends: 34602 [2023-12-02 12:31:26,542 INFO L226 Difference]: Without dead ends: 34602 [2023-12-02 12:31:26,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:31:26,543 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 41 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 44 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 [2023-12-02 12:31:26,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 44 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:31:26,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34602 states. [2023-12-02 12:31:27,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34602 to 34602. [2023-12-02 12:31:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34602 states, 34565 states have (on average 4.262838131057428) internal successors, (147345), 34601 states have internal predecessors, (147345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:27,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34602 states to 34602 states and 147345 transitions. [2023-12-02 12:31:27,836 INFO L78 Accepts]: Start accepts. Automaton has 34602 states and 147345 transitions. Word has length 8 [2023-12-02 12:31:27,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:31:27,837 INFO L495 AbstractCegarLoop]: Abstraction has 34602 states and 147345 transitions. [2023-12-02 12:31:27,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:27,838 INFO L276 IsEmpty]: Start isEmpty. Operand 34602 states and 147345 transitions. [2023-12-02 12:31:27,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 12:31:27,838 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:31:27,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:31:27,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 12:31:28,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:31:28,039 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:31:28,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:31:28,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1023130200, now seen corresponding path program 1 times [2023-12-02 12:31:28,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:31:28,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000994603] [2023-12-02 12:31:28,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:31:28,040 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 [2023-12-02 12:31:28,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:31:28,041 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 12:31:28,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 12:31:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:31:28,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 12:31:28,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:31:28,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 12:31:28,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:31:28,171 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:31:28,171 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:31:28,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000994603] [2023-12-02 12:31:28,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000994603] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:31:28,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:31:28,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:31:28,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153068611] [2023-12-02 12:31:28,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:31:28,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:31:28,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:31:28,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:31:28,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:31:28,172 INFO L87 Difference]: Start difference. First operand 34602 states and 147345 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:28,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:31:28,531 INFO L93 Difference]: Finished difference Result 34560 states and 147232 transitions. [2023-12-02 12:31:28,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:31:28,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-12-02 12:31:28,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:31:28,685 INFO L225 Difference]: With dead ends: 34560 [2023-12-02 12:31:28,685 INFO L226 Difference]: Without dead ends: 34560 [2023-12-02 12:31:28,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:31:28,686 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 40 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:31:28,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 45 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:31:29,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34560 states. [2023-12-02 12:31:29,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34560 to 34560. [2023-12-02 12:31:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34560 states, 34524 states have (on average 4.264627505503418) internal successors, (147232), 34559 states have internal predecessors, (147232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:30,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34560 states to 34560 states and 147232 transitions. [2023-12-02 12:31:30,061 INFO L78 Accepts]: Start accepts. Automaton has 34560 states and 147232 transitions. Word has length 8 [2023-12-02 12:31:30,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:31:30,061 INFO L495 AbstractCegarLoop]: Abstraction has 34560 states and 147232 transitions. [2023-12-02 12:31:30,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:30,061 INFO L276 IsEmpty]: Start isEmpty. Operand 34560 states and 147232 transitions. [2023-12-02 12:31:30,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 12:31:30,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:31:30,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:31:30,065 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 12:31:30,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:31:30,264 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:31:30,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:31:30,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1312022297, now seen corresponding path program 1 times [2023-12-02 12:31:30,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:31:30,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [384182315] [2023-12-02 12:31:30,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:31:30,264 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 [2023-12-02 12:31:30,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:31:30,265 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 12:31:30,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 12:31:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:31:30,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 12:31:30,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:31:30,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 12:31:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:31:30,407 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:31:30,407 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:31:30,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [384182315] [2023-12-02 12:31:30,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [384182315] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:31:30,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:31:30,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:31:30,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250537856] [2023-12-02 12:31:30,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:31:30,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:31:30,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:31:30,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:31:30,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:31:30,409 INFO L87 Difference]: Start difference. First operand 34560 states and 147232 transitions. Second operand has 3 states, 2 states have (on average 5.5) 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) [2023-12-02 12:31:31,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:31:31,102 INFO L93 Difference]: Finished difference Result 34266 states and 146189 transitions. [2023-12-02 12:31:31,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:31:31,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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 [2023-12-02 12:31:31,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:31:31,285 INFO L225 Difference]: With dead ends: 34266 [2023-12-02 12:31:31,285 INFO L226 Difference]: Without dead ends: 34266 [2023-12-02 12:31:31,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:31:31,286 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 37 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:31:31,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 48 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:31:31,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34266 states. [2023-12-02 12:31:32,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34266 to 34266. [2023-12-02 12:31:32,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34266 states, 34231 states have (on average 4.270661096666764) internal successors, (146189), 34265 states have internal predecessors, (146189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:32,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34266 states to 34266 states and 146189 transitions. [2023-12-02 12:31:32,334 INFO L78 Accepts]: Start accepts. Automaton has 34266 states and 146189 transitions. Word has length 11 [2023-12-02 12:31:32,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:31:32,335 INFO L495 AbstractCegarLoop]: Abstraction has 34266 states and 146189 transitions. [2023-12-02 12:31:32,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) 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) [2023-12-02 12:31:32,335 INFO L276 IsEmpty]: Start isEmpty. Operand 34266 states and 146189 transitions. [2023-12-02 12:31:32,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 12:31:32,336 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:31:32,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:31:32,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 12:31:32,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:31:32,537 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:31:32,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:31:32,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1312022298, now seen corresponding path program 1 times [2023-12-02 12:31:32,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:31:32,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050335645] [2023-12-02 12:31:32,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:31:32,538 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 [2023-12-02 12:31:32,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:31:32,539 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 12:31:32,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 12:31:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:31:32,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 12:31:32,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:31:32,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 12:31:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:31:32,913 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:31:32,914 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:31:32,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050335645] [2023-12-02 12:31:32,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050335645] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:31:32,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:31:32,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:31:32,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222551850] [2023-12-02 12:31:32,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:31:32,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:31:32,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:31:32,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:31:32,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:31:32,916 INFO L87 Difference]: Start difference. First operand 34266 states and 146189 transitions. Second operand has 3 states, 2 states have (on average 5.5) 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) [2023-12-02 12:31:33,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:31:33,285 INFO L93 Difference]: Finished difference Result 33972 states and 145146 transitions. [2023-12-02 12:31:33,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:31:33,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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 [2023-12-02 12:31:33,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:31:33,470 INFO L225 Difference]: With dead ends: 33972 [2023-12-02 12:31:33,470 INFO L226 Difference]: Without dead ends: 33972 [2023-12-02 12:31:33,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:31:33,471 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 36 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:31:33,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 49 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:31:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33972 states. [2023-12-02 12:31:34,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33972 to 33972. [2023-12-02 12:31:34,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33972 states, 33938 states have (on average 4.276798868524957) internal successors, (145146), 33971 states have internal predecessors, (145146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33972 states to 33972 states and 145146 transitions. [2023-12-02 12:31:34,864 INFO L78 Accepts]: Start accepts. Automaton has 33972 states and 145146 transitions. Word has length 11 [2023-12-02 12:31:34,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:31:34,865 INFO L495 AbstractCegarLoop]: Abstraction has 33972 states and 145146 transitions. [2023-12-02 12:31:34,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) 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) [2023-12-02 12:31:34,865 INFO L276 IsEmpty]: Start isEmpty. Operand 33972 states and 145146 transitions. [2023-12-02 12:31:34,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 12:31:34,871 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:31:34,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:31:34,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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 [2023-12-02 12:31:35,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:31:35,072 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:31:35,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:31:35,073 INFO L85 PathProgramCache]: Analyzing trace with hash -735494576, now seen corresponding path program 1 times [2023-12-02 12:31:35,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:31:35,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641086839] [2023-12-02 12:31:35,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:31:35,074 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 [2023-12-02 12:31:35,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:31:35,075 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 12:31:35,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-02 12:31:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:31:35,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 12:31:35,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:31:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:31:35,281 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:31:35,281 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:31:35,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641086839] [2023-12-02 12:31:35,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641086839] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:31:35,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:31:35,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:31:35,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208701306] [2023-12-02 12:31:35,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:31:35,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:31:35,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:31:35,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:31:35,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:31:35,283 INFO L87 Difference]: Start difference. First operand 33972 states and 145146 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:35,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:31:35,793 INFO L93 Difference]: Finished difference Result 28336 states and 115162 transitions. [2023-12-02 12:31:35,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:31:35,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 12:31:35,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:31:35,938 INFO L225 Difference]: With dead ends: 28336 [2023-12-02 12:31:35,938 INFO L226 Difference]: Without dead ends: 26572 [2023-12-02 12:31:35,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:31:35,939 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 77 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:31:35,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 53 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:31:36,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26572 states. [2023-12-02 12:31:36,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26572 to 26572. [2023-12-02 12:31:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26572 states, 26538 states have (on average 4.099706081844902) internal successors, (108798), 26571 states have internal predecessors, (108798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:37,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26572 states to 26572 states and 108798 transitions. [2023-12-02 12:31:37,045 INFO L78 Accepts]: Start accepts. Automaton has 26572 states and 108798 transitions. Word has length 17 [2023-12-02 12:31:37,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:31:37,045 INFO L495 AbstractCegarLoop]: Abstraction has 26572 states and 108798 transitions. [2023-12-02 12:31:37,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:37,045 INFO L276 IsEmpty]: Start isEmpty. Operand 26572 states and 108798 transitions. [2023-12-02 12:31:37,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 12:31:37,056 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:31:37,056 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:31:37,060 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-02 12:31:37,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:31:37,259 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:31:37,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:31:37,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2117083382, now seen corresponding path program 1 times [2023-12-02 12:31:37,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:31:37,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990791304] [2023-12-02 12:31:37,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:31:37,261 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 [2023-12-02 12:31:37,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:31:37,262 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 12:31:37,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-02 12:31:37,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:31:37,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 12:31:37,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:31:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:31:37,504 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:31:37,504 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:31:37,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990791304] [2023-12-02 12:31:37,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990791304] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:31:37,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:31:37,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 12:31:37,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93307131] [2023-12-02 12:31:37,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:31:37,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 12:31:37,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:31:37,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 12:31:37,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:31:37,506 INFO L87 Difference]: Start difference. First operand 26572 states and 108798 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) [2023-12-02 12:31:37,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:31:37,880 INFO L93 Difference]: Finished difference Result 15724 states and 59790 transitions. [2023-12-02 12:31:37,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 12:31:37,881 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 [2023-12-02 12:31:37,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:31:37,950 INFO L225 Difference]: With dead ends: 15724 [2023-12-02 12:31:37,950 INFO L226 Difference]: Without dead ends: 14360 [2023-12-02 12:31:37,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:31:37,951 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 131 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:31:37,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 84 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:31:37,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14360 states. [2023-12-02 12:31:38,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14360 to 14360. [2023-12-02 12:31:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14360 states, 14332 states have (on average 3.8170527490929387) internal successors, (54706), 14359 states have internal predecessors, (54706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:38,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14360 states to 14360 states and 54706 transitions. [2023-12-02 12:31:38,375 INFO L78 Accepts]: Start accepts. Automaton has 14360 states and 54706 transitions. Word has length 21 [2023-12-02 12:31:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:31:38,376 INFO L495 AbstractCegarLoop]: Abstraction has 14360 states and 54706 transitions. [2023-12-02 12:31:38,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 14360 states and 54706 transitions. [2023-12-02 12:31:38,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 12:31:38,390 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:31:38,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:31:38,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-02 12:31:38,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:31:38,591 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:31:38,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:31:38,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1543461460, now seen corresponding path program 1 times [2023-12-02 12:31:38,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:31:38,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35521766] [2023-12-02 12:31:38,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:31:38,592 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 [2023-12-02 12:31:38,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:31:38,593 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 12:31:38,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-02 12:31:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:31:38,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 12:31:38,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:31:38,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:31:38,847 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:31:38,847 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:31:38,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35521766] [2023-12-02 12:31:38,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35521766] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:31:38,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:31:38,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:31:38,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399030354] [2023-12-02 12:31:38,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:31:38,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:31:38,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:31:38,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:31:38,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:31:38,849 INFO L87 Difference]: Start difference. First operand 14360 states and 54706 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:31:39,272 INFO L93 Difference]: Finished difference Result 7468 states and 27286 transitions. [2023-12-02 12:31:39,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:31:39,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-02 12:31:39,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:31:39,292 INFO L225 Difference]: With dead ends: 7468 [2023-12-02 12:31:39,292 INFO L226 Difference]: Without dead ends: 6824 [2023-12-02 12:31:39,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-02 12:31:39,293 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 179 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 12:31:39,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 151 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 12:31:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6824 states. [2023-12-02 12:31:39,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6824 to 6824. [2023-12-02 12:31:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6824 states, 6810 states have (on average 3.664904552129222) internal successors, (24958), 6823 states have internal predecessors, (24958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:39,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6824 states to 6824 states and 24958 transitions. [2023-12-02 12:31:39,487 INFO L78 Accepts]: Start accepts. Automaton has 6824 states and 24958 transitions. Word has length 25 [2023-12-02 12:31:39,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:31:39,488 INFO L495 AbstractCegarLoop]: Abstraction has 6824 states and 24958 transitions. [2023-12-02 12:31:39,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:39,488 INFO L276 IsEmpty]: Start isEmpty. Operand 6824 states and 24958 transitions. [2023-12-02 12:31:39,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 12:31:39,504 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:31:39,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:31:39,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-12-02 12:31:39,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:31:39,705 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:31:39,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:31:39,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2050625564, now seen corresponding path program 1 times [2023-12-02 12:31:39,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:31:39,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181302867] [2023-12-02 12:31:39,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:31:39,706 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 [2023-12-02 12:31:39,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:31:39,708 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 12:31:39,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-02 12:31:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:31:39,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 12:31:39,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:31:39,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:31:39,972 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:31:39,972 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:31:39,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181302867] [2023-12-02 12:31:39,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181302867] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:31:39,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:31:39,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 12:31:39,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419050258] [2023-12-02 12:31:39,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:31:39,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 12:31:39,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:31:39,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 12:31:39,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-02 12:31:39,974 INFO L87 Difference]: Start difference. First operand 6824 states and 24958 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:40,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:31:40,401 INFO L93 Difference]: Finished difference Result 4928 states and 18362 transitions. [2023-12-02 12:31:40,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 12:31:40,402 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-02 12:31:40,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:31:40,417 INFO L225 Difference]: With dead ends: 4928 [2023-12-02 12:31:40,417 INFO L226 Difference]: Without dead ends: 4768 [2023-12-02 12:31:40,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-12-02 12:31:40,418 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 202 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 12:31:40,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 224 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-02 12:31:40,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4768 states. [2023-12-02 12:31:40,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4768 to 4768. [2023-12-02 12:31:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4768 states, 4764 states have (on average 3.7418136020151134) internal successors, (17826), 4767 states have internal predecessors, (17826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:40,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4768 states to 4768 states and 17826 transitions. [2023-12-02 12:31:40,638 INFO L78 Accepts]: Start accepts. Automaton has 4768 states and 17826 transitions. Word has length 30 [2023-12-02 12:31:40,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:31:40,639 INFO L495 AbstractCegarLoop]: Abstraction has 4768 states and 17826 transitions. [2023-12-02 12:31:40,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:40,639 INFO L276 IsEmpty]: Start isEmpty. Operand 4768 states and 17826 transitions. [2023-12-02 12:31:40,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 12:31:40,652 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:31:40,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:31:40,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-12-02 12:31:40,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:31:40,852 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:31:40,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:31:40,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1403557991, now seen corresponding path program 1 times [2023-12-02 12:31:40,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:31:40,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449658189] [2023-12-02 12:31:40,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:31:40,854 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 [2023-12-02 12:31:40,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:31:40,855 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 12:31:40,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-02 12:31:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:31:41,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 12:31:41,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:31:41,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:31:41,115 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:31:41,115 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:31:41,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449658189] [2023-12-02 12:31:41,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449658189] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:31:41,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:31:41,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:31:41,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589743698] [2023-12-02 12:31:41,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:31:41,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:31:41,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:31:41,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:31:41,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:31:41,116 INFO L87 Difference]: Start difference. First operand 4768 states and 17826 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:41,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:31:41,302 INFO L93 Difference]: Finished difference Result 4752 states and 17778 transitions. [2023-12-02 12:31:41,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:31:41,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2023-12-02 12:31:41,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:31:41,316 INFO L225 Difference]: With dead ends: 4752 [2023-12-02 12:31:41,317 INFO L226 Difference]: Without dead ends: 4752 [2023-12-02 12:31:41,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:31:41,318 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 55 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:31:41,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 59 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:31:41,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4752 states. [2023-12-02 12:31:41,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4752 to 4752. [2023-12-02 12:31:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4752 states, 4749 states have (on average 3.7435249526216046) internal successors, (17778), 4751 states have internal predecessors, (17778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4752 states to 4752 states and 17778 transitions. [2023-12-02 12:31:41,440 INFO L78 Accepts]: Start accepts. Automaton has 4752 states and 17778 transitions. Word has length 35 [2023-12-02 12:31:41,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:31:41,441 INFO L495 AbstractCegarLoop]: Abstraction has 4752 states and 17778 transitions. [2023-12-02 12:31:41,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:41,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4752 states and 17778 transitions. [2023-12-02 12:31:41,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 12:31:41,452 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:31:41,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:31:41,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-12-02 12:31:41,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:31:41,653 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:31:41,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:31:41,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1403557990, now seen corresponding path program 1 times [2023-12-02 12:31:41,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:31:41,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565559849] [2023-12-02 12:31:41,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:31:41,654 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 [2023-12-02 12:31:41,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:31:41,655 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 12:31:41,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-02 12:31:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:31:41,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 12:31:41,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:31:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:31:42,092 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:31:42,093 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:31:42,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565559849] [2023-12-02 12:31:42,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565559849] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:31:42,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:31:42,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 12:31:42,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493327192] [2023-12-02 12:31:42,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:31:42,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 12:31:42,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:31:42,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 12:31:42,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 12:31:42,094 INFO L87 Difference]: Start difference. First operand 4752 states and 17778 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:42,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:31:42,269 INFO L93 Difference]: Finished difference Result 4736 states and 17730 transitions. [2023-12-02 12:31:42,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:31:42,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2023-12-02 12:31:42,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:31:42,281 INFO L225 Difference]: With dead ends: 4736 [2023-12-02 12:31:42,281 INFO L226 Difference]: Without dead ends: 4736 [2023-12-02 12:31:42,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:31:42,282 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 76 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:31:42,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 59 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 12:31:42,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4736 states. [2023-12-02 12:31:42,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4736 to 4736. [2023-12-02 12:31:42,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4736 states, 4734 states have (on average 3.7452471482889735) internal successors, (17730), 4735 states have internal predecessors, (17730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:42,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4736 states to 4736 states and 17730 transitions. [2023-12-02 12:31:42,382 INFO L78 Accepts]: Start accepts. Automaton has 4736 states and 17730 transitions. Word has length 35 [2023-12-02 12:31:42,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:31:42,382 INFO L495 AbstractCegarLoop]: Abstraction has 4736 states and 17730 transitions. [2023-12-02 12:31:42,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:31:42,382 INFO L276 IsEmpty]: Start isEmpty. Operand 4736 states and 17730 transitions. [2023-12-02 12:31:42,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 12:31:42,393 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:31:42,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:31:42,398 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-12-02 12:31:42,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:31:42,594 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:31:42,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:31:42,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1585509592, now seen corresponding path program 1 times [2023-12-02 12:31:42,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:31:42,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608274922] [2023-12-02 12:31:42,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:31:42,595 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 [2023-12-02 12:31:42,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:31:42,596 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 12:31:42,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-02 12:31:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:31:42,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 12:31:42,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:32:05,581 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ BitVec 32))) (and (exists ((|v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ BitVec 32))) (and (exists ((|v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ BitVec 32))) (and (exists ((|v_ULTIMATE.start_main_~#t2420~0#1.base_41| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~#t2420~0#1.base_41| |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) (not (= |v_ULTIMATE.start_main_~#t2420~0#1.base_41| |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2420~0#1.base_41| (_ bv0 1))) (exists ((v_DerPreprocessor_33 (_ BitVec 1)) (v_DerPreprocessor_11 (_ BitVec 1)) (v_DerPreprocessor_34 (_ BitVec 1)) (v_DerPreprocessor_35 (_ BitVec 1))) (let ((.cse0 (store (let ((.cse2 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| v_DerPreprocessor_33) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| v_DerPreprocessor_34) |v_ULTIMATE.start_main_~#t2420~0#1.base_41| v_DerPreprocessor_35))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (select .cse2 |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (select .cse2 |v_ULTIMATE.start_main_~#t2418~0#1.base_57|))) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| v_DerPreprocessor_11))) (let ((.cse1 (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (select .cse0 |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (select .cse0 |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)))) (and (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t2420~0#1.base_41|)) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (select .cse1 |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)))))))) (not (= |v_ULTIMATE.start_main_~#t2418~0#1.base_57| |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) (not (= |v_ULTIMATE.start_main_~#t2417~0#1.base_61| |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)))) (not (= |v_ULTIMATE.start_main_~#t2417~0#1.base_61| |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)))) (exists ((|v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) (exists ((|v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 1))) (and (exists ((|v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2418~0#1.base_57| v_DerPreprocessor_4) |v_ULTIMATE.start_main_~#t2419~0#1.base_49|) (_ bv0 1)) (exists ((|v_ULTIMATE.start_main_~#t2420~0#1.base_41| (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 1))) (and (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2420~0#1.base_41| (_ bv0 1))) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2419~0#1.base_49| v_DerPreprocessor_12) |v_ULTIMATE.start_main_~#t2420~0#1.base_41|)))))) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| v_DerPreprocessor_1) |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)))))) (exists ((|v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) (exists ((|v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ BitVec 32))) (and (exists ((|v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~#t2418~0#1.base_57| |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) (not (= |v_ULTIMATE.start_main_~#t2417~0#1.base_61| |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) (exists ((|v_ULTIMATE.start_main_~#t2420~0#1.base_41| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~#t2420~0#1.base_41| |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) (not (= |v_ULTIMATE.start_main_~#t2420~0#1.base_41| |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2420~0#1.base_41| (_ bv0 1))) (not (= |v_ULTIMATE.start_main_~#t2420~0#1.base_41| |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) (exists ((v_DerPreprocessor_36 (_ BitVec 1)) (v_DerPreprocessor_37 (_ BitVec 1)) (v_DerPreprocessor_38 (_ BitVec 1)) (v_DerPreprocessor_39 (_ BitVec 1))) (let ((.cse4 (let ((.cse5 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| v_DerPreprocessor_36) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| v_DerPreprocessor_37) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| v_DerPreprocessor_38) |v_ULTIMATE.start_main_~#t2420~0#1.base_41| v_DerPreprocessor_39))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (select .cse5 |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (select .cse5 |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| (select .cse5 |v_ULTIMATE.start_main_~#t2419~0#1.base_49|))))) (let ((.cse3 (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (select .cse4 |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (select .cse4 |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)))) (and (= (select .cse3 |v_ULTIMATE.start_main_~#t2419~0#1.base_49|) (_ bv0 1)) (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_~#t2420~0#1.base_41|)) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (select .cse3 |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)))))))))) (not (= |v_ULTIMATE.start_main_~#t2417~0#1.base_61| |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)))))) (exists ((|v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) (exists ((|v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ BitVec 32))) (and (exists ((|v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~#t2418~0#1.base_57| |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) (not (= |v_ULTIMATE.start_main_~#t2417~0#1.base_61| |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) (exists ((v_DerPreprocessor_40 (_ BitVec 1)) (v_DerPreprocessor_41 (_ BitVec 1)) (v_DerPreprocessor_42 (_ BitVec 1)) (v_DerPreprocessor_10 (_ BitVec 1))) (let ((.cse7 (let ((.cse8 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| v_DerPreprocessor_40) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| v_DerPreprocessor_41) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| v_DerPreprocessor_42))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (select .cse8 |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| v_DerPreprocessor_10) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| (select .cse8 |v_ULTIMATE.start_main_~#t2419~0#1.base_49|))))) (let ((.cse6 (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (select .cse7 |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ bv0 1)))) (and (= (_ bv0 1) (select .cse6 |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (select .cse6 |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57|) (_ bv0 1)) (= (select .cse7 |v_ULTIMATE.start_main_~#t2418~0#1.base_57|) (_ bv0 1)))))) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ bv0 1))))) (not (= |v_ULTIMATE.start_main_~#t2417~0#1.base_61| |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)))))) (exists ((|v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) (exists ((|v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 1))) (and (exists ((|v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~#t2418~0#1.base_57| |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) (exists ((|v_ULTIMATE.start_main_~#t2420~0#1.base_41| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~#t2420~0#1.base_41| |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2420~0#1.base_41| (_ bv0 1))) (exists ((v_DerPreprocessor_14 (_ BitVec 1)) (v_DerPreprocessor_20 (_ BitVec 1)) (v_DerPreprocessor_21 (_ BitVec 1))) (let ((.cse9 (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2418~0#1.base_57| v_DerPreprocessor_20) |v_ULTIMATE.start_main_~#t2420~0#1.base_41| v_DerPreprocessor_21) |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| v_DerPreprocessor_14))) (and (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (select .cse9 |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) (= (_ bv0 1) (select .cse9 |v_ULTIMATE.start_main_~#t2420~0#1.base_41|))))))))) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| v_DerPreprocessor_1) |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)))))) (exists ((|v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) (exists ((|v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 1))) (and (exists ((|v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~#t2418~0#1.base_57| |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) (exists ((v_DerPreprocessor_13 (_ BitVec 1)) (v_DerPreprocessor_15 (_ BitVec 1)) (v_DerPreprocessor_16 (_ BitVec 1))) (= (_ bv0 1) (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2418~0#1.base_57| v_DerPreprocessor_13) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2419~0#1.base_49| v_DerPreprocessor_15) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| v_DerPreprocessor_16) |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57|))) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2419~0#1.base_49|) (_ bv0 1)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ bv0 1))))) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| v_DerPreprocessor_1) |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)))))) (exists ((|v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) (exists ((|v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ BitVec 32))) (and (exists ((v_DerPreprocessor_48 (_ BitVec 1)) (v_DerPreprocessor_49 (_ BitVec 1)) (v_DerPreprocessor_2 (_ BitVec 1))) (= (_ bv0 1) (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| v_DerPreprocessor_2) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2418~0#1.base_57| v_DerPreprocessor_48) |v_ULTIMATE.start_main_~#t2417~0#1.base_61| v_DerPreprocessor_49) |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) |v_ULTIMATE.start_main_~#t2417~0#1.base_61|))) (not (= |v_ULTIMATE.start_main_~#t2417~0#1.base_61| |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ bv0 1))))))) (exists ((|v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) (exists ((|v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 1))) (and (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| v_DerPreprocessor_1) |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) (exists ((|v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2418~0#1.base_57| v_DerPreprocessor_4) |v_ULTIMATE.start_main_~#t2419~0#1.base_49|) (_ bv0 1)) (exists ((|v_ULTIMATE.start_main_~#t2420~0#1.base_41| (_ BitVec 32)) (v_DerPreprocessor_23 (_ BitVec 1)) (v_DerPreprocessor_24 (_ BitVec 1))) (and (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2419~0#1.base_49| (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2419~0#1.base_49| v_DerPreprocessor_23) |v_ULTIMATE.start_main_~#t2420~0#1.base_41| v_DerPreprocessor_24) |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) |v_ULTIMATE.start_main_~#t2420~0#1.base_41|)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2420~0#1.base_41| (_ bv0 1))) (not (= |v_ULTIMATE.start_main_~#t2420~0#1.base_41| |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)))))))))) (exists ((|v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) (exists ((|v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~#t2417~0#1.base_61| |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) (exists ((|v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~#t2418~0#1.base_57| |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) (exists ((v_DerPreprocessor_9 (_ BitVec 1)) (v_DerPreprocessor_30 (_ BitVec 1)) (v_DerPreprocessor_31 (_ BitVec 1)) (v_DerPreprocessor_32 (_ BitVec 1))) (let ((.cse11 (let ((.cse12 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2418~0#1.base_57| v_DerPreprocessor_30) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| v_DerPreprocessor_31) |v_ULTIMATE.start_main_~#t2417~0#1.base_61| v_DerPreprocessor_32))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| v_DerPreprocessor_9) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (select .cse12 |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| (select .cse12 |v_ULTIMATE.start_main_~#t2419~0#1.base_49|))))) (let ((.cse10 (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (select .cse11 |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)))) (and (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (select .cse10 |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) (= (_ bv0 1) (select .cse11 |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) (= (select .cse10 |v_ULTIMATE.start_main_~#t2419~0#1.base_49|) (_ bv0 1)))))) (not (= |v_ULTIMATE.start_main_~#t2417~0#1.base_61| |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ bv0 1))))))))) (exists ((|v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) (exists ((|v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~#t2417~0#1.base_61| |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) (exists ((v_DerPreprocessor_45 (_ BitVec 1)) (|v_ULTIMATE.start_main_~#t2420~0#1.base_41| (_ BitVec 32)) (v_DerPreprocessor_46 (_ BitVec 1)) (v_DerPreprocessor_47 (_ BitVec 1)) (v_DerPreprocessor_2 (_ BitVec 1))) (let ((.cse13 (let ((.cse14 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2418~0#1.base_57| v_DerPreprocessor_45) |v_ULTIMATE.start_main_~#t2417~0#1.base_61| v_DerPreprocessor_46) |v_ULTIMATE.start_main_~#t2420~0#1.base_41| v_DerPreprocessor_47))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (select .cse14 |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (select .cse14 |v_ULTIMATE.start_main_~#t2417~0#1.base_61|))))) (and (not (= |v_ULTIMATE.start_main_~#t2420~0#1.base_41| |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) (not (= |v_ULTIMATE.start_main_~#t2420~0#1.base_41| |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2420~0#1.base_41| (_ bv0 1))) (= (_ bv0 1) (select .cse13 |v_ULTIMATE.start_main_~#t2420~0#1.base_41|)) (= (_ bv0 1) (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| v_DerPreprocessor_2) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (select .cse13 |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) |v_ULTIMATE.start_main_~#t2417~0#1.base_61|))))))))) (exists ((|v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) (exists ((|v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ BitVec 32))) (and (exists ((|v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~#t2417~0#1.base_61| |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) (exists ((|v_ULTIMATE.start_main_~#t2420~0#1.base_41| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~#t2420~0#1.base_41| |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2420~0#1.base_41| (_ bv0 1))) (not (= |v_ULTIMATE.start_main_~#t2420~0#1.base_41| |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) (exists ((v_DerPreprocessor_27 (_ BitVec 1)) (v_DerPreprocessor_28 (_ BitVec 1)) (v_DerPreprocessor_29 (_ BitVec 1)) (v_DerPreprocessor_3 (_ BitVec 1))) (let ((.cse15 (let ((.cse17 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| v_DerPreprocessor_27) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| v_DerPreprocessor_28) |v_ULTIMATE.start_main_~#t2420~0#1.base_41| v_DerPreprocessor_29))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (select .cse17 |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| (select .cse17 |v_ULTIMATE.start_main_~#t2419~0#1.base_49|))))) (let ((.cse16 (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (select .cse15 |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| v_DerPreprocessor_3))) (and (= (_ bv0 1) (select .cse15 |v_ULTIMATE.start_main_~#t2420~0#1.base_41|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (select .cse16 |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57|) (_ bv0 1)) (= (select .cse16 |v_ULTIMATE.start_main_~#t2419~0#1.base_49|) (_ bv0 1)))))))))) (not (= |v_ULTIMATE.start_main_~#t2417~0#1.base_61| |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)))))) (exists ((|v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ BitVec 32))) (and (exists ((|v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~#t2417~0#1.base_61| |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) (exists ((|v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~#t2417~0#1.base_61| |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) (exists ((v_DerPreprocessor_3 (_ BitVec 1))) (let ((.cse18 (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| v_DerPreprocessor_3))) (and (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (select .cse18 |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) (= (select .cse18 |v_ULTIMATE.start_main_~#t2419~0#1.base_49|) (_ bv0 1))))) (exists ((v_DerPreprocessor_44 (_ BitVec 1)) (v_DerPreprocessor_7 (_ BitVec 1)) (v_DerPreprocessor_43 (_ BitVec 1))) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| v_DerPreprocessor_7) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2419~0#1.base_49| v_DerPreprocessor_43) |v_ULTIMATE.start_main_~#t2417~0#1.base_61| v_DerPreprocessor_44) |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) |v_ULTIMATE.start_main_~#t2417~0#1.base_61|) (_ bv0 1))) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ bv0 1))))))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)))) (exists ((|v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) (exists ((|v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 1))) (and (exists ((|v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~#t2418~0#1.base_57| |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) (exists ((|v_ULTIMATE.start_main_~#t2420~0#1.base_41| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~#t2420~0#1.base_41| |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2420~0#1.base_41| (_ bv0 1))) (not (= |v_ULTIMATE.start_main_~#t2420~0#1.base_41| |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) (exists ((v_DerPreprocessor_17 (_ BitVec 1)) (v_DerPreprocessor_18 (_ BitVec 1)) (v_DerPreprocessor_19 (_ BitVec 1))) (let ((.cse19 (let ((.cse20 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2418~0#1.base_57| v_DerPreprocessor_17) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| v_DerPreprocessor_18) |v_ULTIMATE.start_main_~#t2420~0#1.base_41| v_DerPreprocessor_19))) (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (select .cse20 |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| (select .cse20 |v_ULTIMATE.start_main_~#t2419~0#1.base_49|))))) (and (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (select .cse19 |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) (= (_ bv0 1) (select .cse19 |v_ULTIMATE.start_main_~#t2420~0#1.base_41|))))))))) (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| v_DerPreprocessor_1) |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)))))) (exists ((|v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) (exists ((|v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~#t2417~0#1.base_61| |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) (exists ((|v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~#t2417~0#1.base_61| |v_ULTIMATE.start_main_~#t2419~0#1.base_49|)) (exists ((v_DerPreprocessor_25 (_ BitVec 1)) (v_DerPreprocessor_26 (_ BitVec 1)) (v_DerPreprocessor_3 (_ BitVec 1))) (let ((.cse21 (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| v_DerPreprocessor_25) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| v_DerPreprocessor_26) |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| v_DerPreprocessor_3))) (and (= (_ bv0 1) (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (select .cse21 |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) (= (_ bv0 1) (select .cse21 |v_ULTIMATE.start_main_~#t2419~0#1.base_49|))))) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2419~0#1.base_49| (_ bv0 1))))))))) (exists ((|v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) (exists ((|v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ BitVec 32))) (let ((.cse22 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (_ bv0 1)))) (and (= |c_#valid| (store .cse22 |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ bv0 1))) (exists ((v_DerPreprocessor_5 (_ BitVec 1)) (v_DerPreprocessor_50 (_ BitVec 1)) (v_DerPreprocessor_51 (_ BitVec 1))) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2418~0#1.base_57| v_DerPreprocessor_5) |v_ULTIMATE.start_main_~#t2417~0#1.base_61| (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| v_DerPreprocessor_50) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| v_DerPreprocessor_51) |v_ULTIMATE.start_main_~#t2417~0#1.base_61|)) |v_ULTIMATE.start_main_~#t2418~0#1.base_57|) (_ bv0 1))) (exists ((v_DerPreprocessor_2 (_ BitVec 1))) (= (_ bv0 1) (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2417~0#1.base_61| v_DerPreprocessor_2) |v_ULTIMATE.start_main_~#t2418~0#1.base_57| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2417~0#1.base_61|))) (not (= |v_ULTIMATE.start_main_~#t2417~0#1.base_61| |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)) (= (_ bv0 1) (select .cse22 |v_ULTIMATE.start_main_~#t2418~0#1.base_57|)))))))) is different from false [2023-12-02 12:32:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:32:05,622 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:32:05,623 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:32:05,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608274922] [2023-12-02 12:32:05,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608274922] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:32:05,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:32:05,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:32:05,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859869367] [2023-12-02 12:32:05,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:32:05,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 12:32:05,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:32:05,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 12:32:05,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=21, Unknown=2, NotChecked=8, Total=42 [2023-12-02 12:32:05,625 INFO L87 Difference]: Start difference. First operand 4736 states and 17730 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:32:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:32:08,208 INFO L93 Difference]: Finished difference Result 4750 states and 17753 transitions. [2023-12-02 12:32:08,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 12:32:08,209 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-12-02 12:32:08,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:32:08,220 INFO L225 Difference]: With dead ends: 4750 [2023-12-02 12:32:08,220 INFO L226 Difference]: Without dead ends: 4748 [2023-12-02 12:32:08,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=11, Invalid=21, Unknown=2, NotChecked=8, Total=42 [2023-12-02 12:32:08,220 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 41 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-02 12:32:08,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 161 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 107 Unchecked, 2.6s Time] [2023-12-02 12:32:08,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4748 states. [2023-12-02 12:32:08,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4748 to 4748. [2023-12-02 12:32:08,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4748 states, 4746 states have (on average 3.739359460598399) internal successors, (17747), 4747 states have internal predecessors, (17747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:32:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4748 states to 4748 states and 17747 transitions. [2023-12-02 12:32:08,318 INFO L78 Accepts]: Start accepts. Automaton has 4748 states and 17747 transitions. Word has length 39 [2023-12-02 12:32:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:32:08,319 INFO L495 AbstractCegarLoop]: Abstraction has 4748 states and 17747 transitions. [2023-12-02 12:32:08,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:32:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 4748 states and 17747 transitions. [2023-12-02 12:32:08,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 12:32:08,329 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:32:08,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:32:08,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-12-02 12:32:08,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:32:08,530 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:32:08,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:32:08,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1585510724, now seen corresponding path program 1 times [2023-12-02 12:32:08,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:32:08,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542510210] [2023-12-02 12:32:08,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:32:08,531 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 [2023-12-02 12:32:08,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:32:08,531 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 12:32:08,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-02 12:32:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:32:08,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 12:32:08,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:32:08,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:32:08,788 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:32:08,788 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:32:08,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542510210] [2023-12-02 12:32:08,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542510210] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:32:08,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:32:08,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 12:32:08,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218046482] [2023-12-02 12:32:08,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:32:08,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 12:32:08,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:32:08,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 12:32:08,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 12:32:08,791 INFO L87 Difference]: Start difference. First operand 4748 states and 17747 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:32:09,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:32:09,044 INFO L93 Difference]: Finished difference Result 6988 states and 25863 transitions. [2023-12-02 12:32:09,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 12:32:09,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-12-02 12:32:09,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:32:09,065 INFO L225 Difference]: With dead ends: 6988 [2023-12-02 12:32:09,065 INFO L226 Difference]: Without dead ends: 6981 [2023-12-02 12:32:09,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-02 12:32:09,066 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 62 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:32:09,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 93 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 12:32:09,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6981 states. [2023-12-02 12:32:09,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6981 to 6921. [2023-12-02 12:32:09,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6921 states, 6919 states have (on average 3.7119525943055356) internal successors, (25683), 6920 states have internal predecessors, (25683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:32:09,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6921 states to 6921 states and 25683 transitions. [2023-12-02 12:32:09,303 INFO L78 Accepts]: Start accepts. Automaton has 6921 states and 25683 transitions. Word has length 39 [2023-12-02 12:32:09,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:32:09,304 INFO L495 AbstractCegarLoop]: Abstraction has 6921 states and 25683 transitions. [2023-12-02 12:32:09,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:32:09,304 INFO L276 IsEmpty]: Start isEmpty. Operand 6921 states and 25683 transitions. [2023-12-02 12:32:09,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 12:32:09,319 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:32:09,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:32:09,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-12-02 12:32:09,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:32:09,520 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:32:09,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:32:09,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1143238332, now seen corresponding path program 2 times [2023-12-02 12:32:09,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:32:09,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629294582] [2023-12-02 12:32:09,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 12:32:09,524 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 [2023-12-02 12:32:09,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:32:09,525 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 12:32:09,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-02 12:32:09,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-02 12:32:09,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 12:32:09,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 12:32:09,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:32:09,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 12:32:09,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 12:32:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:32:10,228 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:32:10,229 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:32:10,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629294582] [2023-12-02 12:32:10,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629294582] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:32:10,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:32:10,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 12:32:10,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016329754] [2023-12-02 12:32:10,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:32:10,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 12:32:10,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:32:10,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 12:32:10,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-02 12:32:10,231 INFO L87 Difference]: Start difference. First operand 6921 states and 25683 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:32:10,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:32:10,941 INFO L93 Difference]: Finished difference Result 13574 states and 49829 transitions. [2023-12-02 12:32:10,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 12:32:10,942 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-12-02 12:32:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:32:10,989 INFO L225 Difference]: With dead ends: 13574 [2023-12-02 12:32:10,989 INFO L226 Difference]: Without dead ends: 13563 [2023-12-02 12:32:10,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-12-02 12:32:10,990 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 106 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-02 12:32:10,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 237 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-02 12:32:11,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13563 states. [2023-12-02 12:32:11,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13563 to 7401. [2023-12-02 12:32:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7401 states, 7399 states have (on average 3.7230706852277335) internal successors, (27547), 7400 states have internal predecessors, (27547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:32:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7401 states to 7401 states and 27547 transitions. [2023-12-02 12:32:11,215 INFO L78 Accepts]: Start accepts. Automaton has 7401 states and 27547 transitions. Word has length 39 [2023-12-02 12:32:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:32:11,216 INFO L495 AbstractCegarLoop]: Abstraction has 7401 states and 27547 transitions. [2023-12-02 12:32:11,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:32:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 7401 states and 27547 transitions. [2023-12-02 12:32:11,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-02 12:32:11,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:32:11,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:32:11,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-12-02 12:32:11,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:32:11,434 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2023-12-02 12:32:11,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:32:11,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1887211454, now seen corresponding path program 3 times [2023-12-02 12:32:11,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:32:11,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966907009] [2023-12-02 12:32:11,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 12:32:11,435 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 [2023-12-02 12:32:11,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:32:11,436 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -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) [2023-12-02 12:32:11,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-02 12:32:11,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-12-02 12:32:11,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-02 12:32:11,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 12:32:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 12:32:12,059 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2023-12-02 12:32:12,059 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 12:32:12,060 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (87 of 88 remaining) [2023-12-02 12:32:12,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 88 remaining) [2023-12-02 12:32:12,061 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 88 remaining) [2023-12-02 12:32:12,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 88 remaining) [2023-12-02 12:32:12,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 88 remaining) [2023-12-02 12:32:12,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 88 remaining) [2023-12-02 12:32:12,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 88 remaining) [2023-12-02 12:32:12,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 88 remaining) [2023-12-02 12:32:12,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 88 remaining) [2023-12-02 12:32:12,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 88 remaining) [2023-12-02 12:32:12,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 88 remaining) [2023-12-02 12:32:12,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 88 remaining) [2023-12-02 12:32:12,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 88 remaining) [2023-12-02 12:32:12,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 88 remaining) [2023-12-02 12:32:12,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 88 remaining) [2023-12-02 12:32:12,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 88 remaining) [2023-12-02 12:32:12,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 88 remaining) [2023-12-02 12:32:12,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 88 remaining) [2023-12-02 12:32:12,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 88 remaining) [2023-12-02 12:32:12,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 88 remaining) [2023-12-02 12:32:12,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 88 remaining) [2023-12-02 12:32:12,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 88 remaining) [2023-12-02 12:32:12,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 88 remaining) [2023-12-02 12:32:12,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 88 remaining) [2023-12-02 12:32:12,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 88 remaining) [2023-12-02 12:32:12,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 88 remaining) [2023-12-02 12:32:12,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 88 remaining) [2023-12-02 12:32:12,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 88 remaining) [2023-12-02 12:32:12,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 88 remaining) [2023-12-02 12:32:12,065 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 88 remaining) [2023-12-02 12:32:12,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 88 remaining) [2023-12-02 12:32:12,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 88 remaining) [2023-12-02 12:32:12,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 88 remaining) [2023-12-02 12:32:12,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 88 remaining) [2023-12-02 12:32:12,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 88 remaining) [2023-12-02 12:32:12,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 88 remaining) [2023-12-02 12:32:12,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 88 remaining) [2023-12-02 12:32:12,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 88 remaining) [2023-12-02 12:32:12,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 88 remaining) [2023-12-02 12:32:12,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 88 remaining) [2023-12-02 12:32:12,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 88 remaining) [2023-12-02 12:32:12,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 88 remaining) [2023-12-02 12:32:12,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 88 remaining) [2023-12-02 12:32:12,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 88 remaining) [2023-12-02 12:32:12,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 88 remaining) [2023-12-02 12:32:12,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 88 remaining) [2023-12-02 12:32:12,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 88 remaining) [2023-12-02 12:32:12,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 88 remaining) [2023-12-02 12:32:12,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 88 remaining) [2023-12-02 12:32:12,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (38 of 88 remaining) [2023-12-02 12:32:12,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 88 remaining) [2023-12-02 12:32:12,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 88 remaining) [2023-12-02 12:32:12,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 88 remaining) [2023-12-02 12:32:12,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 88 remaining) [2023-12-02 12:32:12,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 88 remaining) [2023-12-02 12:32:12,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 88 remaining) [2023-12-02 12:32:12,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 88 remaining) [2023-12-02 12:32:12,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 88 remaining) [2023-12-02 12:32:12,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 88 remaining) [2023-12-02 12:32:12,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 88 remaining) [2023-12-02 12:32:12,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 88 remaining) [2023-12-02 12:32:12,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 88 remaining) [2023-12-02 12:32:12,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 88 remaining) [2023-12-02 12:32:12,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 88 remaining) [2023-12-02 12:32:12,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 88 remaining) [2023-12-02 12:32:12,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 88 remaining) [2023-12-02 12:32:12,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 88 remaining) [2023-12-02 12:32:12,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 88 remaining) [2023-12-02 12:32:12,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 88 remaining) [2023-12-02 12:32:12,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 88 remaining) [2023-12-02 12:32:12,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 88 remaining) [2023-12-02 12:32:12,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 88 remaining) [2023-12-02 12:32:12,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 88 remaining) [2023-12-02 12:32:12,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 88 remaining) [2023-12-02 12:32:12,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 88 remaining) [2023-12-02 12:32:12,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 88 remaining) [2023-12-02 12:32:12,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 88 remaining) [2023-12-02 12:32:12,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 88 remaining) [2023-12-02 12:32:12,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 88 remaining) [2023-12-02 12:32:12,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 88 remaining) [2023-12-02 12:32:12,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 88 remaining) [2023-12-02 12:32:12,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 88 remaining) [2023-12-02 12:32:12,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 88 remaining) [2023-12-02 12:32:12,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 88 remaining) [2023-12-02 12:32:12,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 88 remaining) [2023-12-02 12:32:12,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 88 remaining) [2023-12-02 12:32:12,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 88 remaining) [2023-12-02 12:32:12,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 88 remaining) [2023-12-02 12:32:12,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-12-02 12:32:12,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 12:32:12,277 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:32:12,282 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-02 12:32:12,282 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 12:32:12,370 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated [2023-12-02 12:32:12,376 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated [2023-12-02 12:32:12,378 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre34 could not be translated [2023-12-02 12:32:12,381 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre36 could not be translated [2023-12-02 12:32:12,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:32:12 BasicIcfg [2023-12-02 12:32:12,415 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 12:32:12,416 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 12:32:12,416 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 12:32:12,416 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 12:32:12,416 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:30:20" (3/4) ... [2023-12-02 12:32:12,418 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 12:32:12,418 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 12:32:12,419 INFO L158 Benchmark]: Toolchain (without parser) took 114250.97ms. Allocated memory was 67.1MB in the beginning and 15.5GB in the end (delta: 15.4GB). Free memory was 34.6MB in the beginning and 11.8GB in the end (delta: -11.8GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. [2023-12-02 12:32:12,419 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 67.1MB. Free memory was 43.7MB in the beginning and 43.6MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 12:32:12,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 636.10ms. Allocated memory was 67.1MB in the beginning and 109.1MB in the end (delta: 41.9MB). Free memory was 34.4MB in the beginning and 69.4MB in the end (delta: -34.9MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2023-12-02 12:32:12,420 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.33ms. Allocated memory is still 109.1MB. Free memory was 69.4MB in the beginning and 66.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 12:32:12,420 INFO L158 Benchmark]: Boogie Preprocessor took 54.30ms. Allocated memory is still 109.1MB. Free memory was 66.6MB in the beginning and 63.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 12:32:12,421 INFO L158 Benchmark]: RCFGBuilder took 1737.60ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 63.7MB in the beginning and 52.9MB in the end (delta: 10.8MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2023-12-02 12:32:12,421 INFO L158 Benchmark]: TraceAbstraction took 111737.12ms. Allocated memory was 132.1MB in the beginning and 15.5GB in the end (delta: 15.4GB). Free memory was 51.9MB in the beginning and 11.8GB in the end (delta: -11.7GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. [2023-12-02 12:32:12,421 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 15.5GB. Free memory is still 11.8GB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 12:32:12,423 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.28ms. Allocated memory is still 67.1MB. Free memory was 43.7MB in the beginning and 43.6MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 636.10ms. Allocated memory was 67.1MB in the beginning and 109.1MB in the end (delta: 41.9MB). Free memory was 34.4MB in the beginning and 69.4MB in the end (delta: -34.9MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.33ms. Allocated memory is still 109.1MB. Free memory was 69.4MB in the beginning and 66.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.30ms. Allocated memory is still 109.1MB. Free memory was 66.6MB in the beginning and 63.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1737.60ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 63.7MB in the beginning and 52.9MB in the end (delta: 10.8MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. * TraceAbstraction took 111737.12ms. Allocated memory was 132.1MB in the beginning and 15.5GB in the end (delta: 15.4GB). Free memory was 51.9MB in the beginning and 11.8GB in the end (delta: -11.7GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 15.5GB. Free memory is still 11.8GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre34 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre36 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L744] 0 _Bool y$flush_delayed; [L745] 0 int y$mem_tmp; [L746] 0 _Bool y$r_buff0_thd0; [L747] 0 _Bool y$r_buff0_thd1; [L748] 0 _Bool y$r_buff0_thd2; [L749] 0 _Bool y$r_buff0_thd3; [L750] 0 _Bool y$r_buff0_thd4; [L751] 0 _Bool y$r_buff1_thd0; [L752] 0 _Bool y$r_buff1_thd1; [L753] 0 _Bool y$r_buff1_thd2; [L754] 0 _Bool y$r_buff1_thd3; [L755] 0 _Bool y$r_buff1_thd4; [L756] 0 _Bool y$read_delayed; [L757] 0 int *y$read_delayed_var; [L758] 0 int y$w_buff0; [L759] 0 _Bool y$w_buff0_used; [L760] 0 int y$w_buff1; [L761] 0 _Bool y$w_buff1_used; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L864] 0 pthread_t t2417; [L865] FCALL, FORK 0 pthread_create(&t2417, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2417={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L866] 0 pthread_t t2418; [L768] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 1 y$flush_delayed = weak$$choice2 [L771] EXPR 1 \read(y) [L771] 1 y$mem_tmp = y [L772] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] EXPR 1 \read(y) [L773] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L773] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L774] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L775] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L776] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L777] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L779] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L780] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L781] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L782] EXPR 1 \read(y) [L782] 1 __unbuffered_p0_EAX = y [L783] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L783] EXPR 1 \read(y) [L783] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L783] 1 y = y$flush_delayed ? y$mem_tmp : y [L784] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L787] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L867] FCALL, FORK 0 pthread_create(&t2418, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, t2417={6:0}, t2418={4:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L868] 0 pthread_t t2419; [L869] FCALL, FORK 0 pthread_create(&t2419, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2417={6:0}, t2418={4:0}, t2419={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L870] 0 pthread_t t2420; [L871] FCALL, FORK 0 pthread_create(&t2420, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2417={6:0}, t2418={4:0}, t2419={5:0}, t2420={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L799] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L811] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L814] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 3 y$flush_delayed = weak$$choice2 [L817] EXPR 3 \read(y) [L817] 3 y$mem_tmp = y [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] EXPR 3 \read(y) [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L819] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L820] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L821] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L822] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L824] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 \read(y) [L825] 3 __unbuffered_p2_EBX = y [L826] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L826] 3 y = y$flush_delayed ? y$mem_tmp : y [L827] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L839] 4 y = 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 \read(y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L842] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L843] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L844] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L845] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L846] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2417={6:0}, t2418={4:0}, t2419={5:0}, t2420={7:0}, weak$$choice1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] EXPR 0 \read(y) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L877] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L878] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L879] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L880] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L881] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2417={6:0}, t2418={4:0}, t2419={5:0}, t2420={7:0}, weak$$choice1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L884] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2417={6:0}, t2418={4:0}, t2419={5:0}, t2420={7:0}, weak$$choice1=2, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=2, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe027_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=2, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 869]: 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: 865]: 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: 867]: 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: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 88 error locations. Started 1 CEGAR loops. OverallTime: 111.3s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 1.3s, AutomataDifference: 24.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 19.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1426 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1426 mSDsluCounter, 1517 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 107 IncrementalHoareTripleChecker+Unchecked, 928 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2159 IncrementalHoareTripleChecker+Invalid, 2357 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 589 mSDtfsCounter, 2159 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 344 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=674304occurred in iteration=0, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 33.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 6222 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 24.5s InterpolantComputationTime, 381 NumberOfCodeBlocks, 381 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 323 ConstructedInterpolants, 39 QuantifiedInterpolants, 28666 SizeOfPredicates, 20 NumberOfNonLiveVariables, 3095 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 [2023-12-02 12:32:12,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dc37d91-ddab-47a6-b7e8-4fdcf5756838/bin/utaipan-verify-nQ1chXbOIh/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