./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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_02cf9a4b-1202-47f1-9b94-d752df94646a/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 e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 13:53:06,332 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 13:53:06,409 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 13:53:06,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 13:53:06,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 13:53:06,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 13:53:06,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 13:53:06,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 13:53:06,442 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 13:53:06,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 13:53:06,443 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 13:53:06,444 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 13:53:06,444 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 13:53:06,445 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 13:53:06,445 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 13:53:06,446 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 13:53:06,446 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 13:53:06,447 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 13:53:06,447 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 13:53:06,448 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 13:53:06,448 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 13:53:06,449 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 13:53:06,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 13:53:06,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 13:53:06,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 13:53:06,451 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 13:53:06,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 13:53:06,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 13:53:06,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 13:53:06,452 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 13:53:06,453 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 13:53:06,453 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 13:53:06,454 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 13:53:06,454 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 13:53:06,454 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 13:53:06,454 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 13:53:06,454 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 13:53:06,455 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 13:53:06,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 13:53:06,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 13:53:06,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:53:06,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 13:53:06,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 13:53:06,456 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 13:53:06,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 13:53:06,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 13:53:06,457 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 13:53:06,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 13:53:06,457 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_02cf9a4b-1202-47f1-9b94-d752df94646a/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_02cf9a4b-1202-47f1-9b94-d752df94646a/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 -> e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da [2023-12-02 13:53:06,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 13:53:06,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 13:53:06,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 13:53:06,695 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 13:53:06,695 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 13:53:06,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2023-12-02 13:53:09,466 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 13:53:09,707 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 13:53:09,707 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2023-12-02 13:53:09,722 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/data/b16e98748/9d230d98325e47629cca7c490b7d0995/FLAGcd6069ec8 [2023-12-02 13:53:09,733 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/data/b16e98748/9d230d98325e47629cca7c490b7d0995 [2023-12-02 13:53:09,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 13:53:09,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 13:53:09,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 13:53:09,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 13:53:09,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 13:53:09,744 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:53:09" (1/1) ... [2023-12-02 13:53:09,746 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2de3dc1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:09, skipping insertion in model container [2023-12-02 13:53:09,746 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:53:09" (1/1) ... [2023-12-02 13:53:09,788 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:53:10,076 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:53:10,087 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 13:53:10,142 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:53:10,171 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:53:10,171 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:53:10,177 INFO L206 MainTranslator]: Completed translation [2023-12-02 13:53:10,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:10 WrapperNode [2023-12-02 13:53:10,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 13:53:10,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 13:53:10,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 13:53:10,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 13:53:10,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:10" (1/1) ... [2023-12-02 13:53:10,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:10" (1/1) ... [2023-12-02 13:53:10,233 INFO L138 Inliner]: procedures = 176, calls = 63, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 160 [2023-12-02 13:53:10,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 13:53:10,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 13:53:10,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 13:53:10,235 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 13:53:10,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:10" (1/1) ... [2023-12-02 13:53:10,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:10" (1/1) ... [2023-12-02 13:53:10,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:10" (1/1) ... [2023-12-02 13:53:10,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:10" (1/1) ... [2023-12-02 13:53:10,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:10" (1/1) ... [2023-12-02 13:53:10,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:10" (1/1) ... [2023-12-02 13:53:10,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:10" (1/1) ... [2023-12-02 13:53:10,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:10" (1/1) ... [2023-12-02 13:53:10,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 13:53:10,273 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 13:53:10,273 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 13:53:10,273 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 13:53:10,274 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:10" (1/1) ... [2023-12-02 13:53:10,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:53:10,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:53:10,310 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 13:53:10,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 13:53:10,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 13:53:10,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 13:53:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 13:53:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 13:53:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 13:53:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-02 13:53:10,340 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-02 13:53:10,340 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-02 13:53:10,340 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-02 13:53:10,341 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-02 13:53:10,341 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-02 13:53:10,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 13:53:10,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 13:53:10,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 13:53:10,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 13:53:10,343 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 13:53:10,469 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 13:53:10,471 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 13:53:10,794 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 13:53:10,955 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 13:53:10,955 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 13:53:10,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:53:10 BoogieIcfgContainer [2023-12-02 13:53:10,956 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 13:53:10,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 13:53:10,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 13:53:10,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 13:53:10,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:53:09" (1/3) ... [2023-12-02 13:53:10,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11397d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:53:10, skipping insertion in model container [2023-12-02 13:53:10,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:10" (2/3) ... [2023-12-02 13:53:10,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11397d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:53:10, skipping insertion in model container [2023-12-02 13:53:10,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:53:10" (3/3) ... [2023-12-02 13:53:10,965 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2023-12-02 13:53:10,978 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 13:53:10,979 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-12-02 13:53:10,979 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 13:53:11,020 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 13:53:11,046 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 57 transitions, 126 flow [2023-12-02 13:53:11,508 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9399 states, 9386 states have (on average 3.672277860643512) internal successors, (34468), 9398 states have internal predecessors, (34468), 0 states have call successors, (0), 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 13:53:11,527 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 13:53:11,534 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;@7b32f334, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 13:53:11,534 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-12-02 13:53:11,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 9399 states, 9386 states have (on average 3.672277860643512) internal successors, (34468), 9398 states have internal predecessors, (34468), 0 states have call successors, (0), 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 13:53:11,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 13:53:11,603 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:11,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 13:53:11,605 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:11,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:11,610 INFO L85 PathProgramCache]: Analyzing trace with hash 12867, now seen corresponding path program 1 times [2023-12-02 13:53:11,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:53:11,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680207846] [2023-12-02 13:53:11,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:11,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:53:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:11,849 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 13:53:11,850 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:53:11,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680207846] [2023-12-02 13:53:11,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680207846] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:11,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:11,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:53:11,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365920848] [2023-12-02 13:53:11,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:11,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:53:11,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:53:11,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:53:11,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:53:11,908 INFO L87 Difference]: Start difference. First operand has 9399 states, 9386 states have (on average 3.672277860643512) internal successors, (34468), 9398 states have internal predecessors, (34468), 0 states have call successors, (0), 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 13:53:12,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:12,188 INFO L93 Difference]: Finished difference Result 8768 states and 30910 transitions. [2023-12-02 13:53:12,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:53:12,201 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 13:53:12,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:12,309 INFO L225 Difference]: With dead ends: 8768 [2023-12-02 13:53:12,309 INFO L226 Difference]: Without dead ends: 8768 [2023-12-02 13:53:12,311 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 13:53:12,314 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 44 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:12,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 37 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:53:12,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8768 states. [2023-12-02 13:53:12,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8768 to 8768. [2023-12-02 13:53:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8768 states, 8756 states have (on average 3.530150753768844) internal successors, (30910), 8767 states have internal predecessors, (30910), 0 states have call successors, (0), 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 13:53:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8768 states to 8768 states and 30910 transitions. [2023-12-02 13:53:12,867 INFO L78 Accepts]: Start accepts. Automaton has 8768 states and 30910 transitions. Word has length 2 [2023-12-02 13:53:12,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:12,867 INFO L495 AbstractCegarLoop]: Abstraction has 8768 states and 30910 transitions. [2023-12-02 13:53:12,867 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 13:53:12,868 INFO L276 IsEmpty]: Start isEmpty. Operand 8768 states and 30910 transitions. [2023-12-02 13:53:12,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 13:53:12,868 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:12,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 13:53:12,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 13:53:12,869 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:12,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:12,870 INFO L85 PathProgramCache]: Analyzing trace with hash 12868, now seen corresponding path program 1 times [2023-12-02 13:53:12,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:53:12,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57797597] [2023-12-02 13:53:12,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:12,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:53:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:12,967 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 13:53:12,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:53:12,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57797597] [2023-12-02 13:53:12,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57797597] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:12,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:12,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:53:12,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479672270] [2023-12-02 13:53:12,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:12,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:53:12,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:53:12,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:53:12,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:53:12,972 INFO L87 Difference]: Start difference. First operand 8768 states and 30910 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 13:53:13,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:13,196 INFO L93 Difference]: Finished difference Result 8767 states and 30909 transitions. [2023-12-02 13:53:13,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:53:13,197 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 13:53:13,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:13,258 INFO L225 Difference]: With dead ends: 8767 [2023-12-02 13:53:13,258 INFO L226 Difference]: Without dead ends: 8767 [2023-12-02 13:53:13,258 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 13:53:13,260 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 43 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:13,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 38 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:53:13,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8767 states. [2023-12-02 13:53:13,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8767 to 8767. [2023-12-02 13:53:13,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8767 states, 8756 states have (on average 3.530036546368205) internal successors, (30909), 8766 states have internal predecessors, (30909), 0 states have call successors, (0), 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 13:53:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8767 states to 8767 states and 30909 transitions. [2023-12-02 13:53:13,790 INFO L78 Accepts]: Start accepts. Automaton has 8767 states and 30909 transitions. Word has length 2 [2023-12-02 13:53:13,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:13,791 INFO L495 AbstractCegarLoop]: Abstraction has 8767 states and 30909 transitions. [2023-12-02 13:53:13,792 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 13:53:13,792 INFO L276 IsEmpty]: Start isEmpty. Operand 8767 states and 30909 transitions. [2023-12-02 13:53:13,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 13:53:13,793 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:13,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 13:53:13,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 13:53:13,794 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:13,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:13,796 INFO L85 PathProgramCache]: Analyzing trace with hash 383710773, now seen corresponding path program 1 times [2023-12-02 13:53:13,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:53:13,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336820804] [2023-12-02 13:53:13,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:13,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:53:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:13,859 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 13:53:13,859 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:53:13,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336820804] [2023-12-02 13:53:13,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336820804] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:13,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:13,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:53:13,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931560293] [2023-12-02 13:53:13,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:13,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:53:13,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:53:13,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:53:13,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:53:13,862 INFO L87 Difference]: Start difference. First operand 8767 states and 30909 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 13:53:14,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:14,003 INFO L93 Difference]: Finished difference Result 8760 states and 30896 transitions. [2023-12-02 13:53:14,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:53:14,004 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 13:53:14,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:14,077 INFO L225 Difference]: With dead ends: 8760 [2023-12-02 13:53:14,078 INFO L226 Difference]: Without dead ends: 8760 [2023-12-02 13:53:14,078 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 13:53:14,086 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:14,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 41 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:53:14,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8760 states. [2023-12-02 13:53:14,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8760 to 8760. [2023-12-02 13:53:14,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8760 states, 8750 states have (on average 3.5309714285714286) internal successors, (30896), 8759 states have internal predecessors, (30896), 0 states have call successors, (0), 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 13:53:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8760 states to 8760 states and 30896 transitions. [2023-12-02 13:53:14,452 INFO L78 Accepts]: Start accepts. Automaton has 8760 states and 30896 transitions. Word has length 5 [2023-12-02 13:53:14,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:14,452 INFO L495 AbstractCegarLoop]: Abstraction has 8760 states and 30896 transitions. [2023-12-02 13:53:14,453 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 13:53:14,454 INFO L276 IsEmpty]: Start isEmpty. Operand 8760 states and 30896 transitions. [2023-12-02 13:53:14,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 13:53:14,454 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:14,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 13:53:14,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 13:53:14,455 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:14,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:14,456 INFO L85 PathProgramCache]: Analyzing trace with hash 383710774, now seen corresponding path program 1 times [2023-12-02 13:53:14,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:53:14,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261057289] [2023-12-02 13:53:14,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:14,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:53:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:14,606 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 13:53:14,606 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:53:14,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261057289] [2023-12-02 13:53:14,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261057289] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:14,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:14,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:53:14,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147469228] [2023-12-02 13:53:14,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:14,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:53:14,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:53:14,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:53:14,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:53:14,609 INFO L87 Difference]: Start difference. First operand 8760 states and 30896 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 13:53:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:14,771 INFO L93 Difference]: Finished difference Result 8753 states and 30883 transitions. [2023-12-02 13:53:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:53:14,771 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 13:53:14,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:14,823 INFO L225 Difference]: With dead ends: 8753 [2023-12-02 13:53:14,823 INFO L226 Difference]: Without dead ends: 8753 [2023-12-02 13:53:14,824 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 13:53:14,825 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:14,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 42 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:53:14,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8753 states. [2023-12-02 13:53:15,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8753 to 8753. [2023-12-02 13:53:15,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8753 states, 8744 states have (on average 3.531907593778591) internal successors, (30883), 8752 states have internal predecessors, (30883), 0 states have call successors, (0), 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 13:53:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8753 states to 8753 states and 30883 transitions. [2023-12-02 13:53:15,239 INFO L78 Accepts]: Start accepts. Automaton has 8753 states and 30883 transitions. Word has length 5 [2023-12-02 13:53:15,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:15,239 INFO L495 AbstractCegarLoop]: Abstraction has 8753 states and 30883 transitions. [2023-12-02 13:53:15,239 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 13:53:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 8753 states and 30883 transitions. [2023-12-02 13:53:15,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 13:53:15,240 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:15,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:53:15,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 13:53:15,241 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:15,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:15,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2074908006, now seen corresponding path program 1 times [2023-12-02 13:53:15,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:53:15,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526984826] [2023-12-02 13:53:15,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:15,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:53:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:15,348 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 13:53:15,348 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:53:15,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526984826] [2023-12-02 13:53:15,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526984826] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:15,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:15,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:53:15,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752061042] [2023-12-02 13:53:15,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:15,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:53:15,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:53:15,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:53:15,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:53:15,351 INFO L87 Difference]: Start difference. First operand 8753 states and 30883 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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 13:53:15,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:15,467 INFO L93 Difference]: Finished difference Result 7836 states and 27542 transitions. [2023-12-02 13:53:15,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:53:15,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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 13:53:15,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:15,508 INFO L225 Difference]: With dead ends: 7836 [2023-12-02 13:53:15,509 INFO L226 Difference]: Without dead ends: 7710 [2023-12-02 13:53:15,509 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 13:53:15,510 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:15,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 47 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:53:15,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7710 states. [2023-12-02 13:53:15,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7710 to 7710. [2023-12-02 13:53:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7710 states, 7706 states have (on average 3.521022579807942) internal successors, (27133), 7709 states have internal predecessors, (27133), 0 states have call successors, (0), 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 13:53:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7710 states to 7710 states and 27133 transitions. [2023-12-02 13:53:15,763 INFO L78 Accepts]: Start accepts. Automaton has 7710 states and 27133 transitions. Word has length 8 [2023-12-02 13:53:15,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:15,763 INFO L495 AbstractCegarLoop]: Abstraction has 7710 states and 27133 transitions. [2023-12-02 13:53:15,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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 13:53:15,764 INFO L276 IsEmpty]: Start isEmpty. Operand 7710 states and 27133 transitions. [2023-12-02 13:53:15,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 13:53:15,764 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:15,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:53:15,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 13:53:15,765 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:15,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:15,765 INFO L85 PathProgramCache]: Analyzing trace with hash -2074908300, now seen corresponding path program 1 times [2023-12-02 13:53:15,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:53:15,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67187444] [2023-12-02 13:53:15,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:15,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:53:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:15,813 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 13:53:15,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:53:15,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67187444] [2023-12-02 13:53:15,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67187444] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:15,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:15,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:53:15,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065612907] [2023-12-02 13:53:15,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:15,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:53:15,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:53:15,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:53:15,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:53:15,816 INFO L87 Difference]: Start difference. First operand 7710 states and 27133 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 13:53:15,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:15,925 INFO L93 Difference]: Finished difference Result 7647 states and 26960 transitions. [2023-12-02 13:53:15,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:53:15,926 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 13:53:15,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:15,953 INFO L225 Difference]: With dead ends: 7647 [2023-12-02 13:53:15,953 INFO L226 Difference]: Without dead ends: 7647 [2023-12-02 13:53:15,954 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 13:53:15,955 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 35 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:15,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 46 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:53:15,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7647 states. [2023-12-02 13:53:16,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7647 to 7647. [2023-12-02 13:53:16,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7647 states, 7644 states have (on average 3.5269492412349557) internal successors, (26960), 7646 states have internal predecessors, (26960), 0 states have call successors, (0), 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 13:53:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7647 states to 7647 states and 26960 transitions. [2023-12-02 13:53:16,215 INFO L78 Accepts]: Start accepts. Automaton has 7647 states and 26960 transitions. Word has length 8 [2023-12-02 13:53:16,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:16,216 INFO L495 AbstractCegarLoop]: Abstraction has 7647 states and 26960 transitions. [2023-12-02 13:53:16,216 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 13:53:16,216 INFO L276 IsEmpty]: Start isEmpty. Operand 7647 states and 26960 transitions. [2023-12-02 13:53:16,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 13:53:16,217 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:16,217 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:53:16,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 13:53:16,218 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:16,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:16,218 INFO L85 PathProgramCache]: Analyzing trace with hash -2074908299, now seen corresponding path program 1 times [2023-12-02 13:53:16,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:53:16,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616663873] [2023-12-02 13:53:16,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:16,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:53:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:16,295 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 13:53:16,295 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:53:16,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616663873] [2023-12-02 13:53:16,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616663873] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:16,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:16,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:53:16,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751432500] [2023-12-02 13:53:16,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:16,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:53:16,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:53:16,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:53:16,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:53:16,298 INFO L87 Difference]: Start difference. First operand 7647 states and 26960 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 13:53:16,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:16,428 INFO L93 Difference]: Finished difference Result 7584 states and 26787 transitions. [2023-12-02 13:53:16,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:53:16,429 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 13:53:16,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:16,460 INFO L225 Difference]: With dead ends: 7584 [2023-12-02 13:53:16,460 INFO L226 Difference]: Without dead ends: 7584 [2023-12-02 13:53:16,460 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 13:53:16,461 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 34 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:16,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 47 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:53:16,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7584 states. [2023-12-02 13:53:16,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7584 to 7584. [2023-12-02 13:53:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7584 states, 7582 states have (on average 3.5329728303877603) internal successors, (26787), 7583 states have internal predecessors, (26787), 0 states have call successors, (0), 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 13:53:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7584 states to 7584 states and 26787 transitions. [2023-12-02 13:53:16,697 INFO L78 Accepts]: Start accepts. Automaton has 7584 states and 26787 transitions. Word has length 8 [2023-12-02 13:53:16,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:16,697 INFO L495 AbstractCegarLoop]: Abstraction has 7584 states and 26787 transitions. [2023-12-02 13:53:16,698 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 13:53:16,698 INFO L276 IsEmpty]: Start isEmpty. Operand 7584 states and 26787 transitions. [2023-12-02 13:53:16,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 13:53:16,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:16,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:53:16,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 13:53:16,707 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:16,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:16,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1547996442, now seen corresponding path program 1 times [2023-12-02 13:53:16,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:53:16,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032332136] [2023-12-02 13:53:16,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:16,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:53:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:17,307 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 13:53:17,307 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:53:17,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032332136] [2023-12-02 13:53:17,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032332136] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:17,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:17,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 13:53:17,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588344896] [2023-12-02 13:53:17,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:17,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 13:53:17,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:53:17,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 13:53:17,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 13:53:17,310 INFO L87 Difference]: Start difference. First operand 7584 states and 26787 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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 13:53:17,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:17,683 INFO L93 Difference]: Finished difference Result 7017 states and 24726 transitions. [2023-12-02 13:53:17,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 13:53:17,683 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2023-12-02 13:53:17,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:17,707 INFO L225 Difference]: With dead ends: 7017 [2023-12-02 13:53:17,708 INFO L226 Difference]: Without dead ends: 5883 [2023-12-02 13:53:17,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-02 13:53:17,709 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 108 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:17,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 303 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:53:17,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5883 states. [2023-12-02 13:53:17,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5883 to 5883. [2023-12-02 13:53:17,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5883 states, 5882 states have (on average 3.5028901734104045) internal successors, (20604), 5882 states have internal predecessors, (20604), 0 states have call successors, (0), 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 13:53:17,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5883 states to 5883 states and 20604 transitions. [2023-12-02 13:53:17,924 INFO L78 Accepts]: Start accepts. Automaton has 5883 states and 20604 transitions. Word has length 18 [2023-12-02 13:53:17,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:17,924 INFO L495 AbstractCegarLoop]: Abstraction has 5883 states and 20604 transitions. [2023-12-02 13:53:17,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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 13:53:17,925 INFO L276 IsEmpty]: Start isEmpty. Operand 5883 states and 20604 transitions. [2023-12-02 13:53:17,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 13:53:17,930 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:17,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:53:17,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 13:53:17,930 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:17,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:17,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1547997633, now seen corresponding path program 1 times [2023-12-02 13:53:17,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:53:17,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956462990] [2023-12-02 13:53:17,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:17,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:53:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:18,197 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 13:53:18,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:53:18,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956462990] [2023-12-02 13:53:18,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956462990] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:18,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:18,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:53:18,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297670802] [2023-12-02 13:53:18,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:18,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:53:18,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:53:18,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:53:18,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:53:18,199 INFO L87 Difference]: Start difference. First operand 5883 states and 20604 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 13:53:18,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:18,315 INFO L93 Difference]: Finished difference Result 4490 states and 14503 transitions. [2023-12-02 13:53:18,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:53:18,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2023-12-02 13:53:18,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:18,326 INFO L225 Difference]: With dead ends: 4490 [2023-12-02 13:53:18,326 INFO L226 Difference]: Without dead ends: 3923 [2023-12-02 13:53:18,327 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 13:53:18,327 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 74 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:18,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 50 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:53:18,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3923 states. [2023-12-02 13:53:18,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3923 to 3923. [2023-12-02 13:53:18,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3923 states, 3922 states have (on average 3.25446200917899) internal successors, (12764), 3922 states have internal predecessors, (12764), 0 states have call successors, (0), 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 13:53:18,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 12764 transitions. [2023-12-02 13:53:18,423 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 12764 transitions. Word has length 18 [2023-12-02 13:53:18,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:18,423 INFO L495 AbstractCegarLoop]: Abstraction has 3923 states and 12764 transitions. [2023-12-02 13:53:18,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 13:53:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 12764 transitions. [2023-12-02 13:53:18,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 13:53:18,428 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:18,428 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] [2023-12-02 13:53:18,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 13:53:18,429 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:18,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:18,429 INFO L85 PathProgramCache]: Analyzing trace with hash 384454560, now seen corresponding path program 1 times [2023-12-02 13:53:18,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:53:18,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137768633] [2023-12-02 13:53:18,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:18,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:53:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:18,644 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 13:53:18,645 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:53:18,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137768633] [2023-12-02 13:53:18,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137768633] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:18,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:18,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:53:18,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878789265] [2023-12-02 13:53:18,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:18,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:53:18,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:53:18,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:53:18,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:53:18,646 INFO L87 Difference]: Start difference. First operand 3923 states and 12764 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:53:18,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:18,790 INFO L93 Difference]: Finished difference Result 2341 states and 7097 transitions. [2023-12-02 13:53:18,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:53:18,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 13:53:18,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:18,796 INFO L225 Difference]: With dead ends: 2341 [2023-12-02 13:53:18,796 INFO L226 Difference]: Without dead ends: 2019 [2023-12-02 13:53:18,796 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 13:53:18,797 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 122 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:18,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 65 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:53:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2019 states. [2023-12-02 13:53:18,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2019 to 2019. [2023-12-02 13:53:18,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 2018 states have (on average 3.022794846382557) internal successors, (6100), 2018 states have internal predecessors, (6100), 0 states have call successors, (0), 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 13:53:18,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 6100 transitions. [2023-12-02 13:53:18,833 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 6100 transitions. Word has length 23 [2023-12-02 13:53:18,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:18,833 INFO L495 AbstractCegarLoop]: Abstraction has 2019 states and 6100 transitions. [2023-12-02 13:53:18,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:53:18,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 6100 transitions. [2023-12-02 13:53:18,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 13:53:18,839 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:18,839 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 13:53:18,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 13:53:18,840 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:18,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:18,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1709772118, now seen corresponding path program 1 times [2023-12-02 13:53:18,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:53:18,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129228245] [2023-12-02 13:53:18,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:18,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:53:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:19,094 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 13:53:19,094 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:53:19,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129228245] [2023-12-02 13:53:19,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129228245] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:19,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:19,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:53:19,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579252423] [2023-12-02 13:53:19,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:19,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:53:19,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:53:19,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:53:19,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:53:19,096 INFO L87 Difference]: Start difference. First operand 2019 states and 6100 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:53:19,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:19,248 INFO L93 Difference]: Finished difference Result 1495 states and 4516 transitions. [2023-12-02 13:53:19,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:53:19,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-02 13:53:19,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:19,251 INFO L225 Difference]: With dead ends: 1495 [2023-12-02 13:53:19,251 INFO L226 Difference]: Without dead ends: 1411 [2023-12-02 13:53:19,252 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 13:53:19,252 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 153 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:19,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 50 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:53:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2023-12-02 13:53:19,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1411. [2023-12-02 13:53:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1410 states have (on average 3.0326241134751775) internal successors, (4276), 1410 states have internal predecessors, (4276), 0 states have call successors, (0), 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 13:53:19,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 4276 transitions. [2023-12-02 13:53:19,280 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 4276 transitions. Word has length 30 [2023-12-02 13:53:19,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:19,280 INFO L495 AbstractCegarLoop]: Abstraction has 1411 states and 4276 transitions. [2023-12-02 13:53:19,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:53:19,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 4276 transitions. [2023-12-02 13:53:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 13:53:19,285 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:19,285 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] [2023-12-02 13:53:19,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 13:53:19,286 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:19,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:19,286 INFO L85 PathProgramCache]: Analyzing trace with hash -154803541, now seen corresponding path program 1 times [2023-12-02 13:53:19,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:53:19,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430190420] [2023-12-02 13:53:19,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:19,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:53:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:19,886 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 13:53:19,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:53:19,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430190420] [2023-12-02 13:53:19,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430190420] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:19,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:19,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 13:53:19,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163212026] [2023-12-02 13:53:19,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:19,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 13:53:19,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:53:19,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 13:53:19,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:53:19,888 INFO L87 Difference]: Start difference. First operand 1411 states and 4276 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 13:53:20,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:20,224 INFO L93 Difference]: Finished difference Result 1811 states and 5434 transitions. [2023-12-02 13:53:20,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 13:53:20,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2023-12-02 13:53:20,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:20,227 INFO L225 Difference]: With dead ends: 1811 [2023-12-02 13:53:20,227 INFO L226 Difference]: Without dead ends: 811 [2023-12-02 13:53:20,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:53:20,228 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 74 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:20,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 172 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:53:20,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2023-12-02 13:53:20,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2023-12-02 13:53:20,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 2.8777777777777778) internal successors, (2331), 810 states have internal predecessors, (2331), 0 states have call successors, (0), 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 13:53:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2331 transitions. [2023-12-02 13:53:20,246 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 2331 transitions. Word has length 37 [2023-12-02 13:53:20,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:20,246 INFO L495 AbstractCegarLoop]: Abstraction has 811 states and 2331 transitions. [2023-12-02 13:53:20,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 13:53:20,247 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 2331 transitions. [2023-12-02 13:53:20,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 13:53:20,250 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:20,250 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] [2023-12-02 13:53:20,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 13:53:20,251 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:20,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:20,252 INFO L85 PathProgramCache]: Analyzing trace with hash -913907861, now seen corresponding path program 2 times [2023-12-02 13:53:20,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:53:20,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724319923] [2023-12-02 13:53:20,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:20,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:53:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:21,929 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 13:53:21,929 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:53:21,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724319923] [2023-12-02 13:53:21,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724319923] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:21,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:21,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 13:53:21,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357906780] [2023-12-02 13:53:21,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:21,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 13:53:21,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:53:21,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 13:53:21,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-02 13:53:21,931 INFO L87 Difference]: Start difference. First operand 811 states and 2331 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 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 13:53:22,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:22,278 INFO L93 Difference]: Finished difference Result 1043 states and 2967 transitions. [2023-12-02 13:53:22,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 13:53:22,279 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2023-12-02 13:53:22,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:22,281 INFO L225 Difference]: With dead ends: 1043 [2023-12-02 13:53:22,281 INFO L226 Difference]: Without dead ends: 757 [2023-12-02 13:53:22,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-12-02 13:53:22,282 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 149 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:22,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 182 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:53:22,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2023-12-02 13:53:22,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 661. [2023-12-02 13:53:22,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 2.8363636363636364) internal successors, (1872), 660 states have internal predecessors, (1872), 0 states have call successors, (0), 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 13:53:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1872 transitions. [2023-12-02 13:53:22,299 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1872 transitions. Word has length 37 [2023-12-02 13:53:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:22,299 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 1872 transitions. [2023-12-02 13:53:22,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 0 states have call successors, (0), 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 13:53:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1872 transitions. [2023-12-02 13:53:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 13:53:22,301 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:22,301 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] [2023-12-02 13:53:22,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 13:53:22,301 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:22,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:22,302 INFO L85 PathProgramCache]: Analyzing trace with hash -550523571, now seen corresponding path program 3 times [2023-12-02 13:53:22,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:53:22,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464550878] [2023-12-02 13:53:22,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:22,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:53:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 13:53:22,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 13:53:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 13:53:22,443 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 13:53:22,443 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 13:53:22,444 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-12-02 13:53:22,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-12-02 13:53:22,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-12-02 13:53:22,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-12-02 13:53:22,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-12-02 13:53:22,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-12-02 13:53:22,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-12-02 13:53:22,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-12-02 13:53:22,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-12-02 13:53:22,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-12-02 13:53:22,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-12-02 13:53:22,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-12-02 13:53:22,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-12-02 13:53:22,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 13:53:22,451 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:53:22,456 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-02 13:53:22,456 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 13:53:22,512 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-12-02 13:53:22,513 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-12-02 13:53:22,517 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-12-02 13:53:22,530 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-12-02 13:53:22,531 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-12-02 13:53:22,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:53:22 BasicIcfg [2023-12-02 13:53:22,544 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 13:53:22,544 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 13:53:22,545 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 13:53:22,545 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 13:53:22,545 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:53:10" (3/4) ... [2023-12-02 13:53:22,547 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 13:53:22,548 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 13:53:22,549 INFO L158 Benchmark]: Toolchain (without parser) took 12811.30ms. Allocated memory was 134.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 102.4MB in the beginning and 764.3MB in the end (delta: -661.9MB). Peak memory consumption was 682.2MB. Max. memory is 16.1GB. [2023-12-02 13:53:22,549 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 134.2MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 13:53:22,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.16ms. Allocated memory is still 134.2MB. Free memory was 102.1MB in the beginning and 78.5MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-12-02 13:53:22,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.85ms. Allocated memory is still 134.2MB. Free memory was 78.5MB in the beginning and 75.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 13:53:22,550 INFO L158 Benchmark]: Boogie Preprocessor took 37.85ms. Allocated memory is still 134.2MB. Free memory was 75.5MB in the beginning and 73.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 13:53:22,550 INFO L158 Benchmark]: RCFGBuilder took 683.43ms. Allocated memory was 134.2MB in the beginning and 165.7MB in the end (delta: 31.5MB). Free memory was 73.6MB in the beginning and 95.7MB in the end (delta: -22.0MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2023-12-02 13:53:22,551 INFO L158 Benchmark]: TraceAbstraction took 11585.07ms. Allocated memory was 165.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 94.9MB in the beginning and 764.3MB in the end (delta: -669.3MB). Peak memory consumption was 641.1MB. Max. memory is 16.1GB. [2023-12-02 13:53:22,551 INFO L158 Benchmark]: Witness Printer took 3.65ms. Allocated memory is still 1.5GB. Free memory is still 764.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 13:53:22,553 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.18ms. Allocated memory is still 134.2MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 439.16ms. Allocated memory is still 134.2MB. Free memory was 102.1MB in the beginning and 78.5MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.85ms. Allocated memory is still 134.2MB. Free memory was 78.5MB in the beginning and 75.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.85ms. Allocated memory is still 134.2MB. Free memory was 75.5MB in the beginning and 73.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 683.43ms. Allocated memory was 134.2MB in the beginning and 165.7MB in the end (delta: 31.5MB). Free memory was 73.6MB in the beginning and 95.7MB in the end (delta: -22.0MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11585.07ms. Allocated memory was 165.7MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 94.9MB in the beginning and 764.3MB in the end (delta: -669.3MB). Peak memory consumption was 641.1MB. Max. memory is 16.1GB. * Witness Printer took 3.65ms. Allocated memory is still 1.5GB. Free memory is still 764.3MB. 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~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - 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: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$read_delayed; [L737] 0 int *x$read_delayed_var; [L738] 0 int x$w_buff0; [L739] 0 _Bool x$w_buff0_used; [L740] 0 int x$w_buff1; [L741] 0 _Bool x$w_buff1_used; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L840] 0 pthread_t t891; [L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L842] 0 pthread_t t892; [L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={5:0}, t892={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L844] 0 pthread_t t893; [L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={5:0}, t892={6:0}, t893={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L809] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L815] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L757] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L818] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891={5:0}, t892={6:0}, t893={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L854] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891={5:0}, t892={6:0}, t893={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L863] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L864] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L865] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L866] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L868] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891={5:0}, t892={6:0}, t893={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix033_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -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: 838]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 843]: 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: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 85 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 943 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 943 mSDsluCounter, 1120 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 766 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1087 IncrementalHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 354 mSDtfsCounter, 1087 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9399occurred in iteration=0, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 96 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 1553 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 13:53:22,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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_02cf9a4b-1202-47f1-9b94-d752df94646a/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 e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 13:53:24,576 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 13:53:24,650 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 13:53:24,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 13:53:24,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 13:53:24,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 13:53:24,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 13:53:24,686 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 13:53:24,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 13:53:24,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 13:53:24,688 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 13:53:24,688 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 13:53:24,689 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 13:53:24,689 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 13:53:24,690 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 13:53:24,690 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 13:53:24,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 13:53:24,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 13:53:24,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 13:53:24,693 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 13:53:24,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 13:53:24,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 13:53:24,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 13:53:24,695 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 13:53:24,696 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 13:53:24,696 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 13:53:24,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 13:53:24,697 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 13:53:24,697 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 13:53:24,697 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 13:53:24,698 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 13:53:24,698 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 13:53:24,699 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 13:53:24,699 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 13:53:24,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 13:53:24,699 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 13:53:24,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 13:53:24,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:53:24,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 13:53:24,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 13:53:24,701 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 13:53:24,701 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 13:53:24,701 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 13:53:24,701 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 13:53:24,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 13:53:24,702 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_02cf9a4b-1202-47f1-9b94-d752df94646a/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_02cf9a4b-1202-47f1-9b94-d752df94646a/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 -> e61e21f5d7e6e4d5f8f06eb5177c457338190644d81fa4e1ee7a1000b79020da [2023-12-02 13:53:24,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 13:53:24,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 13:53:24,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 13:53:24,999 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 13:53:25,000 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 13:53:25,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2023-12-02 13:53:27,742 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 13:53:28,003 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 13:53:28,003 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/sv-benchmarks/c/pthread-wmm/mix033_tso.oepc.i [2023-12-02 13:53:28,020 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/data/450f10716/daf02069178f4c7f903ba44b89ae1791/FLAG8bec68c95 [2023-12-02 13:53:28,033 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/data/450f10716/daf02069178f4c7f903ba44b89ae1791 [2023-12-02 13:53:28,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 13:53:28,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 13:53:28,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 13:53:28,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 13:53:28,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 13:53:28,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:53:28" (1/1) ... [2023-12-02 13:53:28,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@108e013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:28, skipping insertion in model container [2023-12-02 13:53:28,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:53:28" (1/1) ... [2023-12-02 13:53:28,093 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:53:28,446 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:53:28,461 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 13:53:28,516 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:53:28,554 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:53:28,554 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 13:53:28,562 INFO L206 MainTranslator]: Completed translation [2023-12-02 13:53:28,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:28 WrapperNode [2023-12-02 13:53:28,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 13:53:28,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 13:53:28,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 13:53:28,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 13:53:28,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:28" (1/1) ... [2023-12-02 13:53:28,636 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:28" (1/1) ... [2023-12-02 13:53:28,663 INFO L138 Inliner]: procedures = 179, calls = 63, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 161 [2023-12-02 13:53:28,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 13:53:28,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 13:53:28,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 13:53:28,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 13:53:28,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:28" (1/1) ... [2023-12-02 13:53:28,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:28" (1/1) ... [2023-12-02 13:53:28,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:28" (1/1) ... [2023-12-02 13:53:28,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:28" (1/1) ... [2023-12-02 13:53:28,689 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:28" (1/1) ... [2023-12-02 13:53:28,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:28" (1/1) ... [2023-12-02 13:53:28,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:28" (1/1) ... [2023-12-02 13:53:28,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:28" (1/1) ... [2023-12-02 13:53:28,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 13:53:28,702 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 13:53:28,702 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 13:53:28,702 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 13:53:28,703 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:28" (1/1) ... [2023-12-02 13:53:28,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:53:28,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:53:28,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 13:53:28,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 13:53:28,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 13:53:28,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 13:53:28,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 13:53:28,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 13:53:28,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 13:53:28,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 13:53:28,769 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-02 13:53:28,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-02 13:53:28,770 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-02 13:53:28,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-02 13:53:28,770 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-02 13:53:28,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-02 13:53:28,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 13:53:28,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 13:53:28,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 13:53:28,772 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 13:53:28,917 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 13:53:28,919 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 13:53:29,251 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 13:53:29,467 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 13:53:29,467 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 13:53:29,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:53:29 BoogieIcfgContainer [2023-12-02 13:53:29,468 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 13:53:29,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 13:53:29,471 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 13:53:29,474 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 13:53:29,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:53:28" (1/3) ... [2023-12-02 13:53:29,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750768c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:53:29, skipping insertion in model container [2023-12-02 13:53:29,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:53:28" (2/3) ... [2023-12-02 13:53:29,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750768c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:53:29, skipping insertion in model container [2023-12-02 13:53:29,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:53:29" (3/3) ... [2023-12-02 13:53:29,477 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2023-12-02 13:53:29,504 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 13:53:29,504 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-12-02 13:53:29,505 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 13:53:29,552 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 13:53:29,575 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 57 transitions, 126 flow [2023-12-02 13:53:29,959 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9399 states, 9386 states have (on average 3.672277860643512) internal successors, (34468), 9398 states have internal predecessors, (34468), 0 states have call successors, (0), 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 13:53:29,978 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 13:53:29,984 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;@61e2b7e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 13:53:29,984 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-12-02 13:53:30,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 9399 states, 9386 states have (on average 3.672277860643512) internal successors, (34468), 9398 states have internal predecessors, (34468), 0 states have call successors, (0), 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 13:53:30,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 13:53:30,024 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:30,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 13:53:30,026 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:30,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:30,031 INFO L85 PathProgramCache]: Analyzing trace with hash 12931, now seen corresponding path program 1 times [2023-12-02 13:53:30,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:53:30,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840538993] [2023-12-02 13:53:30,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:30,044 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 13:53:30,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:53:30,046 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:30,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:30,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:53:30,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:53:30,216 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 13:53:30,227 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 13:53:30,227 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:53:30,228 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:53:30,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840538993] [2023-12-02 13:53:30,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840538993] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:30,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:30,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:53:30,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075834976] [2023-12-02 13:53:30,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:30,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:53:30,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:53:30,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:53:30,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:53:30,295 INFO L87 Difference]: Start difference. First operand has 9399 states, 9386 states have (on average 3.672277860643512) internal successors, (34468), 9398 states have internal predecessors, (34468), 0 states have call successors, (0), 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 13:53:30,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:30,618 INFO L93 Difference]: Finished difference Result 8768 states and 30910 transitions. [2023-12-02 13:53:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:53:30,620 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 13:53:30,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:30,706 INFO L225 Difference]: With dead ends: 8768 [2023-12-02 13:53:30,706 INFO L226 Difference]: Without dead ends: 8768 [2023-12-02 13:53:30,708 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 13:53:30,711 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 44 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:30,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 37 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:53:30,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8768 states. [2023-12-02 13:53:31,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8768 to 8768. [2023-12-02 13:53:31,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8768 states, 8756 states have (on average 3.530150753768844) internal successors, (30910), 8767 states have internal predecessors, (30910), 0 states have call successors, (0), 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 13:53:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8768 states to 8768 states and 30910 transitions. [2023-12-02 13:53:31,332 INFO L78 Accepts]: Start accepts. Automaton has 8768 states and 30910 transitions. Word has length 2 [2023-12-02 13:53:31,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:31,332 INFO L495 AbstractCegarLoop]: Abstraction has 8768 states and 30910 transitions. [2023-12-02 13:53:31,333 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 13:53:31,335 INFO L276 IsEmpty]: Start isEmpty. Operand 8768 states and 30910 transitions. [2023-12-02 13:53:31,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 13:53:31,336 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:31,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 13:53:31,344 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:31,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:31,538 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:31,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:31,539 INFO L85 PathProgramCache]: Analyzing trace with hash 12932, now seen corresponding path program 1 times [2023-12-02 13:53:31,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:53:31,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583640475] [2023-12-02 13:53:31,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:31,540 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 13:53:31,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:53:31,541 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:31,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:31,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:53:31,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:53:31,652 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 13:53:31,663 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 13:53:31,663 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:53:31,664 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:53:31,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583640475] [2023-12-02 13:53:31,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583640475] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:31,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:31,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:53:31,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201270756] [2023-12-02 13:53:31,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:31,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:53:31,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:53:31,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:53:31,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:53:31,668 INFO L87 Difference]: Start difference. First operand 8768 states and 30910 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 13:53:31,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:31,994 INFO L93 Difference]: Finished difference Result 8767 states and 30909 transitions. [2023-12-02 13:53:31,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:53:31,995 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 13:53:31,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:32,073 INFO L225 Difference]: With dead ends: 8767 [2023-12-02 13:53:32,073 INFO L226 Difference]: Without dead ends: 8767 [2023-12-02 13:53:32,074 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 13:53:32,075 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 43 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:32,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 38 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:53:32,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8767 states. [2023-12-02 13:53:32,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8767 to 8767. [2023-12-02 13:53:32,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8767 states, 8756 states have (on average 3.530036546368205) internal successors, (30909), 8766 states have internal predecessors, (30909), 0 states have call successors, (0), 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 13:53:32,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8767 states to 8767 states and 30909 transitions. [2023-12-02 13:53:32,566 INFO L78 Accepts]: Start accepts. Automaton has 8767 states and 30909 transitions. Word has length 2 [2023-12-02 13:53:32,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:32,567 INFO L495 AbstractCegarLoop]: Abstraction has 8767 states and 30909 transitions. [2023-12-02 13:53:32,567 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 13:53:32,567 INFO L276 IsEmpty]: Start isEmpty. Operand 8767 states and 30909 transitions. [2023-12-02 13:53:32,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 13:53:32,569 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:32,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 13:53:32,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:32,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:32,775 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:32,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:32,776 INFO L85 PathProgramCache]: Analyzing trace with hash 385619383, now seen corresponding path program 1 times [2023-12-02 13:53:32,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:53:32,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151729987] [2023-12-02 13:53:32,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:32,777 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 13:53:32,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:53:32,778 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:32,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:32,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:53:32,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:53:32,897 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 13:53:32,904 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 13:53:32,904 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:53:32,905 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:53:32,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151729987] [2023-12-02 13:53:32,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1151729987] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:32,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:32,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:53:32,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075417494] [2023-12-02 13:53:32,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:32,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:53:32,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:53:32,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:53:32,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:53:32,908 INFO L87 Difference]: Start difference. First operand 8767 states and 30909 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 13:53:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:33,091 INFO L93 Difference]: Finished difference Result 8760 states and 30896 transitions. [2023-12-02 13:53:33,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:53:33,092 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 13:53:33,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:33,148 INFO L225 Difference]: With dead ends: 8760 [2023-12-02 13:53:33,148 INFO L226 Difference]: Without dead ends: 8760 [2023-12-02 13:53:33,149 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 13:53:33,150 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:33,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 41 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:53:33,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8760 states. [2023-12-02 13:53:33,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8760 to 8760. [2023-12-02 13:53:33,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8760 states, 8750 states have (on average 3.5309714285714286) internal successors, (30896), 8759 states have internal predecessors, (30896), 0 states have call successors, (0), 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 13:53:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8760 states to 8760 states and 30896 transitions. [2023-12-02 13:53:33,514 INFO L78 Accepts]: Start accepts. Automaton has 8760 states and 30896 transitions. Word has length 5 [2023-12-02 13:53:33,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:33,515 INFO L495 AbstractCegarLoop]: Abstraction has 8760 states and 30896 transitions. [2023-12-02 13:53:33,515 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 13:53:33,515 INFO L276 IsEmpty]: Start isEmpty. Operand 8760 states and 30896 transitions. [2023-12-02 13:53:33,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 13:53:33,515 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:33,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 13:53:33,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:33,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:33,716 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:33,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:33,717 INFO L85 PathProgramCache]: Analyzing trace with hash 385619384, now seen corresponding path program 1 times [2023-12-02 13:53:33,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:53:33,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310982877] [2023-12-02 13:53:33,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:33,718 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 13:53:33,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:53:33,719 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:33,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:33,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:53:33,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:53:33,806 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 13:53:33,815 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 13:53:33,816 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:53:33,816 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:53:33,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310982877] [2023-12-02 13:53:33,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310982877] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:33,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:33,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:53:33,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003705956] [2023-12-02 13:53:33,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:33,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:53:33,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:53:33,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:53:33,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:53:33,819 INFO L87 Difference]: Start difference. First operand 8760 states and 30896 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 13:53:34,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:34,000 INFO L93 Difference]: Finished difference Result 8753 states and 30883 transitions. [2023-12-02 13:53:34,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:53:34,001 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 13:53:34,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:34,041 INFO L225 Difference]: With dead ends: 8753 [2023-12-02 13:53:34,041 INFO L226 Difference]: Without dead ends: 8753 [2023-12-02 13:53:34,041 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 13:53:34,042 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:34,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 42 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:53:34,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8753 states. [2023-12-02 13:53:34,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8753 to 8753. [2023-12-02 13:53:34,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8753 states, 8744 states have (on average 3.531907593778591) internal successors, (30883), 8752 states have internal predecessors, (30883), 0 states have call successors, (0), 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 13:53:34,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8753 states to 8753 states and 30883 transitions. [2023-12-02 13:53:34,390 INFO L78 Accepts]: Start accepts. Automaton has 8753 states and 30883 transitions. Word has length 5 [2023-12-02 13:53:34,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:34,390 INFO L495 AbstractCegarLoop]: Abstraction has 8753 states and 30883 transitions. [2023-12-02 13:53:34,390 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 13:53:34,390 INFO L276 IsEmpty]: Start isEmpty. Operand 8753 states and 30883 transitions. [2023-12-02 13:53:34,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 13:53:34,391 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:34,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:53:34,393 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:34,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:34,592 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:34,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:34,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1050080652, now seen corresponding path program 1 times [2023-12-02 13:53:34,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:53:34,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079569401] [2023-12-02 13:53:34,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:34,593 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 13:53:34,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:53:34,594 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:34,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:34,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:53:34,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:53:34,689 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 13:53:34,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 13:53:34,695 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:53:34,696 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:53:34,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079569401] [2023-12-02 13:53:34,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079569401] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:34,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:34,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:53:34,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90762308] [2023-12-02 13:53:34,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:34,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:53:34,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:53:34,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:53:34,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:53:34,698 INFO L87 Difference]: Start difference. First operand 8753 states and 30883 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 13:53:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:34,877 INFO L93 Difference]: Finished difference Result 8683 states and 30690 transitions. [2023-12-02 13:53:34,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:53:34,878 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 13:53:34,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:34,921 INFO L225 Difference]: With dead ends: 8683 [2023-12-02 13:53:34,921 INFO L226 Difference]: Without dead ends: 8683 [2023-12-02 13:53:34,922 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 13:53:34,923 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 36 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:34,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 46 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:53:34,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8683 states. [2023-12-02 13:53:35,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8683 to 8683. [2023-12-02 13:53:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8683 states, 8676 states have (on average 3.537344398340249) internal successors, (30690), 8682 states have internal predecessors, (30690), 0 states have call successors, (0), 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 13:53:35,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8683 states to 8683 states and 30690 transitions. [2023-12-02 13:53:35,239 INFO L78 Accepts]: Start accepts. Automaton has 8683 states and 30690 transitions. Word has length 8 [2023-12-02 13:53:35,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:35,240 INFO L495 AbstractCegarLoop]: Abstraction has 8683 states and 30690 transitions. [2023-12-02 13:53:35,240 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 13:53:35,240 INFO L276 IsEmpty]: Start isEmpty. Operand 8683 states and 30690 transitions. [2023-12-02 13:53:35,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 13:53:35,241 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:35,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:53:35,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:35,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:35,442 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:35,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:35,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1050080651, now seen corresponding path program 1 times [2023-12-02 13:53:35,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:53:35,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161940955] [2023-12-02 13:53:35,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:35,443 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 13:53:35,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:53:35,444 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:35,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:35,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:53:35,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:53:35,534 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 13:53:35,545 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 13:53:35,545 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:53:35,546 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:53:35,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161940955] [2023-12-02 13:53:35,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161940955] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:35,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:35,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:53:35,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965952898] [2023-12-02 13:53:35,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:35,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:53:35,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:53:35,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:53:35,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:53:35,547 INFO L87 Difference]: Start difference. First operand 8683 states and 30690 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 13:53:35,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:35,681 INFO L93 Difference]: Finished difference Result 8613 states and 30497 transitions. [2023-12-02 13:53:35,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:53:35,681 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 13:53:35,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:35,710 INFO L225 Difference]: With dead ends: 8613 [2023-12-02 13:53:35,710 INFO L226 Difference]: Without dead ends: 8613 [2023-12-02 13:53:35,710 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 13:53:35,711 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 35 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:35,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 47 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:53:35,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8613 states. [2023-12-02 13:53:35,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8613 to 8613. [2023-12-02 13:53:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8613 states, 8608 states have (on average 3.542867100371747) internal successors, (30497), 8612 states have internal predecessors, (30497), 0 states have call successors, (0), 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 13:53:35,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8613 states to 8613 states and 30497 transitions. [2023-12-02 13:53:35,974 INFO L78 Accepts]: Start accepts. Automaton has 8613 states and 30497 transitions. Word has length 8 [2023-12-02 13:53:35,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:35,974 INFO L495 AbstractCegarLoop]: Abstraction has 8613 states and 30497 transitions. [2023-12-02 13:53:35,974 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 13:53:35,974 INFO L276 IsEmpty]: Start isEmpty. Operand 8613 states and 30497 transitions. [2023-12-02 13:53:35,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 13:53:35,975 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:35,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:53:35,978 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:36,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:36,176 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:36,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:36,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1050080358, now seen corresponding path program 1 times [2023-12-02 13:53:36,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:53:36,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567912308] [2023-12-02 13:53:36,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:36,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:53:36,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:53:36,178 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:36,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:36,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 13:53:36,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:53:36,264 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 13:53:36,264 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:53:36,264 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:53:36,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567912308] [2023-12-02 13:53:36,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567912308] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:36,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:36,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:53:36,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373813872] [2023-12-02 13:53:36,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:36,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:53:36,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:53:36,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:53:36,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:53:36,266 INFO L87 Difference]: Start difference. First operand 8613 states and 30497 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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 13:53:36,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:36,351 INFO L93 Difference]: Finished difference Result 7710 states and 27196 transitions. [2023-12-02 13:53:36,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:53:36,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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 13:53:36,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:36,376 INFO L225 Difference]: With dead ends: 7710 [2023-12-02 13:53:36,376 INFO L226 Difference]: Without dead ends: 7584 [2023-12-02 13:53:36,376 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 13:53:36,377 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 26 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:36,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 43 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:53:36,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7584 states. [2023-12-02 13:53:36,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7584 to 7584. [2023-12-02 13:53:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7584 states, 7582 states have (on average 3.5329728303877603) internal successors, (26787), 7583 states have internal predecessors, (26787), 0 states have call successors, (0), 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 13:53:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7584 states to 7584 states and 26787 transitions. [2023-12-02 13:53:36,536 INFO L78 Accepts]: Start accepts. Automaton has 7584 states and 26787 transitions. Word has length 8 [2023-12-02 13:53:36,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:36,536 INFO L495 AbstractCegarLoop]: Abstraction has 7584 states and 26787 transitions. [2023-12-02 13:53:36,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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 13:53:36,536 INFO L276 IsEmpty]: Start isEmpty. Operand 7584 states and 26787 transitions. [2023-12-02 13:53:36,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-02 13:53:36,545 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:36,545 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:53:36,547 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:36,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:36,747 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:36,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:36,747 INFO L85 PathProgramCache]: Analyzing trace with hash 632704858, now seen corresponding path program 1 times [2023-12-02 13:53:36,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:53:36,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597775619] [2023-12-02 13:53:36,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:36,748 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 13:53:36,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:53:36,749 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:36,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:36,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:53:36,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:53:36,893 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 13:53:36,893 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:53:36,893 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:53:36,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597775619] [2023-12-02 13:53:36,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597775619] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:36,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:36,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:53:36,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130081830] [2023-12-02 13:53:36,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:36,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:53:36,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:53:36,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:53:36,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:53:36,895 INFO L87 Difference]: Start difference. First operand 7584 states and 26787 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 13:53:37,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:37,015 INFO L93 Difference]: Finished difference Result 5456 states and 17746 transitions. [2023-12-02 13:53:37,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:53:37,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2023-12-02 13:53:37,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:37,029 INFO L225 Difference]: With dead ends: 5456 [2023-12-02 13:53:37,029 INFO L226 Difference]: Without dead ends: 4889 [2023-12-02 13:53:37,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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 13:53:37,030 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 74 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 56 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 13:53:37,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 56 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:53:37,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4889 states. [2023-12-02 13:53:37,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4889 to 4889. [2023-12-02 13:53:37,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4889 states, 4887 states have (on average 3.2754245958665846) internal successors, (16007), 4888 states have internal predecessors, (16007), 0 states have call successors, (0), 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 13:53:37,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4889 states to 4889 states and 16007 transitions. [2023-12-02 13:53:37,292 INFO L78 Accepts]: Start accepts. Automaton has 4889 states and 16007 transitions. Word has length 18 [2023-12-02 13:53:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:37,293 INFO L495 AbstractCegarLoop]: Abstraction has 4889 states and 16007 transitions. [2023-12-02 13:53:37,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 13:53:37,293 INFO L276 IsEmpty]: Start isEmpty. Operand 4889 states and 16007 transitions. [2023-12-02 13:53:37,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-02 13:53:37,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:37,298 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] [2023-12-02 13:53:37,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:37,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:37,499 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:37,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:37,499 INFO L85 PathProgramCache]: Analyzing trace with hash -114262639, now seen corresponding path program 1 times [2023-12-02 13:53:37,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:53:37,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663032621] [2023-12-02 13:53:37,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:37,500 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 13:53:37,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:53:37,501 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:37,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:37,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:53:37,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:53:37,649 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 13:53:37,650 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:53:37,650 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:53:37,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663032621] [2023-12-02 13:53:37,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663032621] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:37,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:37,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:53:37,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073784834] [2023-12-02 13:53:37,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:37,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:53:37,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:53:37,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:53:37,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:53:37,652 INFO L87 Difference]: Start difference. First operand 4889 states and 16007 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:53:37,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:37,810 INFO L93 Difference]: Finished difference Result 2593 states and 7841 transitions. [2023-12-02 13:53:37,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:53:37,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-12-02 13:53:37,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:37,817 INFO L225 Difference]: With dead ends: 2593 [2023-12-02 13:53:37,818 INFO L226 Difference]: Without dead ends: 2271 [2023-12-02 13:53:37,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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 13:53:37,819 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 122 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:37,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 89 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:53:37,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states. [2023-12-02 13:53:37,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 2271. [2023-12-02 13:53:37,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2271 states, 2269 states have (on average 3.016306743058616) internal successors, (6844), 2270 states have internal predecessors, (6844), 0 states have call successors, (0), 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 13:53:37,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 6844 transitions. [2023-12-02 13:53:37,876 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 6844 transitions. Word has length 23 [2023-12-02 13:53:37,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:37,876 INFO L495 AbstractCegarLoop]: Abstraction has 2271 states and 6844 transitions. [2023-12-02 13:53:37,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:53:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 6844 transitions. [2023-12-02 13:53:37,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 13:53:37,882 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:37,882 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 13:53:37,886 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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)] Forceful destruction successful, exit code 0 [2023-12-02 13:53:38,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:38,083 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:38,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:38,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1706031581, now seen corresponding path program 1 times [2023-12-02 13:53:38,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:53:38,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251041267] [2023-12-02 13:53:38,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:38,084 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 13:53:38,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:53:38,085 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:38,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:38,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 13:53:38,213 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:53:38,283 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 13:53:38,283 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:53:38,283 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:53:38,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251041267] [2023-12-02 13:53:38,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251041267] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:38,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:38,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:53:38,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144472705] [2023-12-02 13:53:38,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:38,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:53:38,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:53:38,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:53:38,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:53:38,285 INFO L87 Difference]: Start difference. First operand 2271 states and 6844 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:53:38,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:38,488 INFO L93 Difference]: Finished difference Result 1519 states and 4576 transitions. [2023-12-02 13:53:38,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:53:38,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-02 13:53:38,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:38,492 INFO L225 Difference]: With dead ends: 1519 [2023-12-02 13:53:38,492 INFO L226 Difference]: Without dead ends: 1435 [2023-12-02 13:53:38,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 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 13:53:38,494 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 143 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:38,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 146 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:53:38,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2023-12-02 13:53:38,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1435. [2023-12-02 13:53:38,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 1433 states have (on average 3.0258199581297975) internal successors, (4336), 1434 states have internal predecessors, (4336), 0 states have call successors, (0), 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 13:53:38,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 4336 transitions. [2023-12-02 13:53:38,526 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 4336 transitions. Word has length 30 [2023-12-02 13:53:38,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:38,527 INFO L495 AbstractCegarLoop]: Abstraction has 1435 states and 4336 transitions. [2023-12-02 13:53:38,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:53:38,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 4336 transitions. [2023-12-02 13:53:38,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 13:53:38,532 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:38,532 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] [2023-12-02 13:53:38,535 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:38,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:38,733 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:38,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:38,733 INFO L85 PathProgramCache]: Analyzing trace with hash -883607952, now seen corresponding path program 1 times [2023-12-02 13:53:38,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:53:38,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998685018] [2023-12-02 13:53:38,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:38,734 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 13:53:38,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:53:38,734 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:38,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:38,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 13:53:38,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:53:39,456 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t891~0#1.base_51| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t893~0#1.base_33| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t892~0#1.base_43| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t891~0#1.base_51| (_ bv1 1)))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t891~0#1.base_51|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t891~0#1.base_51| (_ bv0 1)) |v_ULTIMATE.start_main_~#t892~0#1.base_43| (_ bv0 1)) |v_ULTIMATE.start_main_~#t893~0#1.base_33| (_ bv0 1))) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t892~0#1.base_43|)) (= (select (store .cse0 |v_ULTIMATE.start_main_~#t892~0#1.base_43| (_ bv1 1)) |v_ULTIMATE.start_main_~#t893~0#1.base_33|) (_ bv0 1))))) is different from true [2023-12-02 13:53:39,457 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 13:53:39,458 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:53:39,458 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:53:39,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998685018] [2023-12-02 13:53:39,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998685018] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:39,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:39,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:53:39,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289354651] [2023-12-02 13:53:39,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:39,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:53:39,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:53:39,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:53:39,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-12-02 13:53:39,460 INFO L87 Difference]: Start difference. First operand 1435 states and 4336 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 13:53:39,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:39,643 INFO L93 Difference]: Finished difference Result 1441 states and 4341 transitions. [2023-12-02 13:53:39,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:53:39,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2023-12-02 13:53:39,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:39,646 INFO L225 Difference]: With dead ends: 1441 [2023-12-02 13:53:39,647 INFO L226 Difference]: Without dead ends: 1439 [2023-12-02 13:53:39,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-12-02 13:53:39,647 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:39,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 97 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 80 Unchecked, 0.2s Time] [2023-12-02 13:53:39,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2023-12-02 13:53:39,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1439. [2023-12-02 13:53:39,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1437 states have (on average 3.0173973556019487) internal successors, (4336), 1438 states have internal predecessors, (4336), 0 states have call successors, (0), 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 13:53:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 4336 transitions. [2023-12-02 13:53:39,673 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 4336 transitions. Word has length 37 [2023-12-02 13:53:39,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:39,674 INFO L495 AbstractCegarLoop]: Abstraction has 1439 states and 4336 transitions. [2023-12-02 13:53:39,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 13:53:39,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 4336 transitions. [2023-12-02 13:53:39,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 13:53:39,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:39,678 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] [2023-12-02 13:53:39,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:39,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:39,880 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:39,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:39,880 INFO L85 PathProgramCache]: Analyzing trace with hash -883606761, now seen corresponding path program 1 times [2023-12-02 13:53:39,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:53:39,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600539922] [2023-12-02 13:53:39,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:53:39,881 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 13:53:39,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:53:39,882 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:39,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:53:39,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 13:53:39,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:53:40,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 13:53:40,080 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:53:40,081 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:53:40,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600539922] [2023-12-02 13:53:40,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [600539922] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:40,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:40,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 13:53:40,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428854331] [2023-12-02 13:53:40,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:40,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:53:40,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:53:40,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:53:40,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:53:40,082 INFO L87 Difference]: Start difference. First operand 1439 states and 4336 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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 13:53:40,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:40,282 INFO L93 Difference]: Finished difference Result 1867 states and 5554 transitions. [2023-12-02 13:53:40,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:53:40,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2023-12-02 13:53:40,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:40,288 INFO L225 Difference]: With dead ends: 1867 [2023-12-02 13:53:40,288 INFO L226 Difference]: Without dead ends: 1860 [2023-12-02 13:53:40,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-02 13:53:40,289 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 58 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:40,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 172 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:53:40,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2023-12-02 13:53:40,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1832. [2023-12-02 13:53:40,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1832 states, 1830 states have (on average 2.9912568306010927) internal successors, (5474), 1831 states have internal predecessors, (5474), 0 states have call successors, (0), 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 13:53:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 5474 transitions. [2023-12-02 13:53:40,327 INFO L78 Accepts]: Start accepts. Automaton has 1832 states and 5474 transitions. Word has length 37 [2023-12-02 13:53:40,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:40,327 INFO L495 AbstractCegarLoop]: Abstraction has 1832 states and 5474 transitions. [2023-12-02 13:53:40,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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 13:53:40,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1832 states and 5474 transitions. [2023-12-02 13:53:40,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 13:53:40,331 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:40,331 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] [2023-12-02 13:53:40,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:40,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:40,532 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:40,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:40,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1151353087, now seen corresponding path program 2 times [2023-12-02 13:53:40,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:53:40,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612888949] [2023-12-02 13:53:40,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 13:53:40,533 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 13:53:40,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:53:40,534 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:40,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:40,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-02 13:53:40,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:53:40,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 13:53:40,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:53:40,766 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 13:53:40,767 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:53:40,767 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:53:40,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612888949] [2023-12-02 13:53:40,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612888949] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:53:40,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:53:40,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 13:53:40,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575953936] [2023-12-02 13:53:40,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:53:40,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:53:40,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:53:40,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:53:40,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:53:40,769 INFO L87 Difference]: Start difference. First operand 1832 states and 5474 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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 13:53:40,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:53:40,957 INFO L93 Difference]: Finished difference Result 2485 states and 7324 transitions. [2023-12-02 13:53:40,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:53:40,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2023-12-02 13:53:40,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:53:40,964 INFO L225 Difference]: With dead ends: 2485 [2023-12-02 13:53:40,965 INFO L226 Difference]: Without dead ends: 2478 [2023-12-02 13:53:40,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-02 13:53:40,966 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 63 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:53:40,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 157 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:53:40,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2023-12-02 13:53:41,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 1744. [2023-12-02 13:53:41,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1744 states, 1742 states have (on average 2.991963260619977) internal successors, (5212), 1743 states have internal predecessors, (5212), 0 states have call successors, (0), 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 13:53:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 5212 transitions. [2023-12-02 13:53:41,020 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 5212 transitions. Word has length 37 [2023-12-02 13:53:41,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:53:41,020 INFO L495 AbstractCegarLoop]: Abstraction has 1744 states and 5212 transitions. [2023-12-02 13:53:41,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 0 states have call successors, (0), 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 13:53:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 5212 transitions. [2023-12-02 13:53:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-02 13:53:41,028 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:53:41,028 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] [2023-12-02 13:53:41,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:41,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:41,229 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-02 13:53:41,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:53:41,229 INFO L85 PathProgramCache]: Analyzing trace with hash 81397505, now seen corresponding path program 3 times [2023-12-02 13:53:41,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:53:41,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289566707] [2023-12-02 13:53:41,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 13:53:41,230 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 13:53:41,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:53:41,231 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:41,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:41,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-12-02 13:53:41,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-02 13:53:41,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 13:53:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 13:53:41,586 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2023-12-02 13:53:41,586 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 13:53:41,587 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-12-02 13:53:41,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-12-02 13:53:41,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-12-02 13:53:41,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-12-02 13:53:41,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-12-02 13:53:41,589 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-12-02 13:53:41,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-12-02 13:53:41,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-12-02 13:53:41,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-12-02 13:53:41,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-12-02 13:53:41,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-12-02 13:53:41,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-12-02 13:53:41,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-12-02 13:53:41,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:41,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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 13:53:41,795 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:53:41,800 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-02 13:53:41,800 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 13:53:41,877 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-12-02 13:53:41,879 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-12-02 13:53:41,882 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-12-02 13:53:41,895 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-12-02 13:53:41,896 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-12-02 13:53:41,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:53:41 BasicIcfg [2023-12-02 13:53:41,908 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 13:53:41,909 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 13:53:41,909 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 13:53:41,909 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 13:53:41,910 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:53:29" (3/4) ... [2023-12-02 13:53:41,911 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 13:53:41,912 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 13:53:41,913 INFO L158 Benchmark]: Toolchain (without parser) took 13875.41ms. Allocated memory was 96.5MB in the beginning and 1.0GB in the end (delta: 918.6MB). Free memory was 71.4MB in the beginning and 741.3MB in the end (delta: -669.9MB). Peak memory consumption was 250.7MB. Max. memory is 16.1GB. [2023-12-02 13:53:41,913 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 69.2MB. Free memory is still 45.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 13:53:41,913 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.03ms. Allocated memory is still 96.5MB. Free memory was 71.1MB in the beginning and 46.6MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-12-02 13:53:41,914 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.64ms. Allocated memory is still 96.5MB. Free memory was 46.6MB in the beginning and 72.9MB in the end (delta: -26.3MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2023-12-02 13:53:41,914 INFO L158 Benchmark]: Boogie Preprocessor took 36.38ms. Allocated memory is still 96.5MB. Free memory was 72.9MB in the beginning and 70.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 13:53:41,914 INFO L158 Benchmark]: RCFGBuilder took 766.43ms. Allocated memory is still 96.5MB. Free memory was 70.8MB in the beginning and 39.0MB in the end (delta: 31.8MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2023-12-02 13:53:41,915 INFO L158 Benchmark]: TraceAbstraction took 12437.92ms. Allocated memory was 96.5MB in the beginning and 1.0GB in the end (delta: 918.6MB). Free memory was 38.4MB in the beginning and 741.3MB in the end (delta: -702.8MB). Peak memory consumption was 686.5MB. Max. memory is 16.1GB. [2023-12-02 13:53:41,915 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 1.0GB. Free memory is still 741.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 13:53:41,916 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.17ms. Allocated memory is still 69.2MB. Free memory is still 45.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 524.03ms. Allocated memory is still 96.5MB. Free memory was 71.1MB in the beginning and 46.6MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.64ms. Allocated memory is still 96.5MB. Free memory was 46.6MB in the beginning and 72.9MB in the end (delta: -26.3MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.38ms. Allocated memory is still 96.5MB. Free memory was 72.9MB in the beginning and 70.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 766.43ms. Allocated memory is still 96.5MB. Free memory was 70.8MB in the beginning and 39.0MB in the end (delta: 31.8MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * TraceAbstraction took 12437.92ms. Allocated memory was 96.5MB in the beginning and 1.0GB in the end (delta: 918.6MB). Free memory was 38.4MB in the beginning and 741.3MB in the end (delta: -702.8MB). Peak memory consumption was 686.5MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 1.0GB. Free memory is still 741.3MB. 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~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - 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: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$read_delayed; [L737] 0 int *x$read_delayed_var; [L738] 0 int x$w_buff0; [L739] 0 _Bool x$w_buff0_used; [L740] 0 int x$w_buff1; [L741] 0 _Bool x$w_buff1_used; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L840] 0 pthread_t t891; [L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L842] 0 pthread_t t892; [L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={3:0}, t892={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L844] 0 pthread_t t893; [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t891={3:0}, t892={6:0}, t893={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L809] 3 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L815] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L757] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L818] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891={3:0}, t892={6:0}, t893={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L849] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L849] RET 0 assume_abort_if_not(main$tmp_guard0) [L851] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L854] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891={3:0}, t892={6:0}, t893={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L863] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L864] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L865] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L866] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L868] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t891={3:0}, t892={6:0}, t893={7:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix033_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -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: 838]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 843]: 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: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 85 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 749 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 749 mSDsluCounter, 1011 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 80 IncrementalHoareTripleChecker+Unchecked, 620 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1021 IncrementalHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 391 mSDtfsCounter, 1021 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9399occurred in iteration=0, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 762 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 207 ConstructedInterpolants, 1 QuantifiedInterpolants, 1597 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1533 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 13:53:41,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02cf9a4b-1202-47f1-9b94-d752df94646a/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