./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ --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 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:11:47,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:11:48,074 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-19 04:11:48,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:11:48,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:11:48,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:11:48,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:11:48,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:11:48,116 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:11:48,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:11:48,117 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:11:48,118 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:11:48,119 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:11:48,119 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:11:48,120 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:11:48,120 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:11:48,139 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:11:48,140 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:11:48,140 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:11:48,141 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:11:48,142 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:11:48,142 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:11:48,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 04:11:48,144 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 04:11:48,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:11:48,145 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:11:48,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:11:48,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:11:48,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:11:48,147 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 04:11:48,148 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 04:11:48,148 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 04:11:48,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:11:48,149 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 04:11:48,149 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 04:11:48,150 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:11:48,151 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:11:48,151 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:11:48,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:11:48,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:11:48,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:11:48,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:11:48,159 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:11:48,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:11:48,160 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:11:48,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:11:48,161 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_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/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_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ 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 -> 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a [2023-11-19 04:11:48,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:11:48,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:11:48,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:11:48,500 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:11:48,502 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:11:48,504 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread-wmm/mix038.opt.i [2023-11-19 04:11:51,539 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:11:51,801 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:11:51,802 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/sv-benchmarks/c/pthread-wmm/mix038.opt.i [2023-11-19 04:11:51,819 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/data/d300c98d8/4c0f151c05344af590ef59ac9270c3c3/FLAGe869d293c [2023-11-19 04:11:51,835 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/data/d300c98d8/4c0f151c05344af590ef59ac9270c3c3 [2023-11-19 04:11:51,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:11:51,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:11:51,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:11:51,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:11:51,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:11:51,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:11:51" (1/1) ... [2023-11-19 04:11:51,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@311e4e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:11:51, skipping insertion in model container [2023-11-19 04:11:51,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:11:51" (1/1) ... [2023-11-19 04:11:51,902 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:11:52,372 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:11:52,388 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:11:52,486 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:11:52,574 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:11:52,598 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:11:52,605 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:11:52,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:11:52 WrapperNode [2023-11-19 04:11:52,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:11:52,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:11:52,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:11:52,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:11:52,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:11:52" (1/1) ... [2023-11-19 04:11:52,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:11:52" (1/1) ... [2023-11-19 04:11:52,661 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 141 [2023-11-19 04:11:52,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:11:52,662 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:11:52,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:11:52,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:11:52,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:11:52" (1/1) ... [2023-11-19 04:11:52,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:11:52" (1/1) ... [2023-11-19 04:11:52,677 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:11:52" (1/1) ... [2023-11-19 04:11:52,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:11:52" (1/1) ... [2023-11-19 04:11:52,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:11:52" (1/1) ... [2023-11-19 04:11:52,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:11:52" (1/1) ... [2023-11-19 04:11:52,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:11:52" (1/1) ... [2023-11-19 04:11:52,695 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:11:52" (1/1) ... [2023-11-19 04:11:52,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:11:52,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:11:52,701 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:11:52,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:11:52,702 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:11:52" (1/1) ... [2023-11-19 04:11:52,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:11:52,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:11:52,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:11:52,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:11:52,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:11:52,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 04:11:52,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:11:52,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:11:52,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:11:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 04:11:52,798 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 04:11:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 04:11:52,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 04:11:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 04:11:52,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 04:11:52,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:11:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 04:11:52,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:11:52,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:11:52,802 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 04:11:53,009 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:11:53,012 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:11:53,418 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:11:53,581 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:11:53,581 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 04:11:53,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:11:53 BoogieIcfgContainer [2023-11-19 04:11:53,602 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:11:53,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:11:53,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:11:53,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:11:53,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:11:51" (1/3) ... [2023-11-19 04:11:53,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217936b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:11:53, skipping insertion in model container [2023-11-19 04:11:53,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:11:52" (2/3) ... [2023-11-19 04:11:53,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@217936b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:11:53, skipping insertion in model container [2023-11-19 04:11:53,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:11:53" (3/3) ... [2023-11-19 04:11:53,611 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038.opt.i [2023-11-19 04:11:53,630 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:11:53,630 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-19 04:11:53,630 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 04:11:53,695 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 04:11:53,732 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:11:53,747 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 131 transitions, 274 flow [2023-11-19 04:11:53,750 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 131 transitions, 274 flow [2023-11-19 04:11:53,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 131 transitions, 274 flow [2023-11-19 04:11:53,834 INFO L124 PetriNetUnfolderBase]: 4/128 cut-off events. [2023-11-19 04:11:53,836 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 04:11:53,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 128 events. 4/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-11-19 04:11:53,851 INFO L119 LiptonReduction]: Number of co-enabled transitions 2834 [2023-11-19 04:12:00,045 INFO L134 LiptonReduction]: Checked pairs total: 5858 [2023-11-19 04:12:00,046 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-11-19 04:12:00,054 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions, 78 flow [2023-11-19 04:12:00,129 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 676 states, 665 states have (on average 3.26015037593985) internal successors, (2168), 675 states have internal predecessors, (2168), 0 states have call successors, (0), 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-11-19 04:12:00,149 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:12:00,156 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;@cdc622b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:12:00,156 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-19 04:12:00,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 676 states, 665 states have (on average 3.26015037593985) internal successors, (2168), 675 states have internal predecessors, (2168), 0 states have call successors, (0), 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-11-19 04:12:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2023-11-19 04:12:00,166 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:00,167 INFO L195 NwaCegarLoop]: trace histogram [1] [2023-11-19 04:12:00,168 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:00,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:00,173 INFO L85 PathProgramCache]: Analyzing trace with hash 572, now seen corresponding path program 1 times [2023-11-19 04:12:00,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:00,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579918915] [2023-11-19 04:12:00,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:00,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:00,309 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:00,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579918915] [2023-11-19 04:12:00,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579918915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:00,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:00,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 04:12:00,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080710146] [2023-11-19 04:12:00,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:00,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 04:12:00,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:00,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 04:12:00,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:12:00,357 INFO L87 Difference]: Start difference. First operand has 676 states, 665 states have (on average 3.26015037593985) internal successors, (2168), 675 states have internal predecessors, (2168), 0 states have call successors, (0), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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-11-19 04:12:00,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:00,465 INFO L93 Difference]: Finished difference Result 634 states and 1960 transitions. [2023-11-19 04:12:00,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 04:12:00,468 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2023-11-19 04:12:00,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:00,496 INFO L225 Difference]: With dead ends: 634 [2023-11-19 04:12:00,496 INFO L226 Difference]: Without dead ends: 634 [2023-11-19 04:12:00,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:12:00,501 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:00,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:12:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2023-11-19 04:12:00,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2023-11-19 04:12:00,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 629 states have (on average 3.1160572337042924) internal successors, (1960), 633 states have internal predecessors, (1960), 0 states have call successors, (0), 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-11-19 04:12:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1960 transitions. [2023-11-19 04:12:00,590 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 1960 transitions. Word has length 1 [2023-11-19 04:12:00,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:00,591 INFO L495 AbstractCegarLoop]: Abstraction has 634 states and 1960 transitions. [2023-11-19 04:12:00,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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-11-19 04:12:00,591 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1960 transitions. [2023-11-19 04:12:00,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-19 04:12:00,592 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:00,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:00,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:12:00,593 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:00,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:00,594 INFO L85 PathProgramCache]: Analyzing trace with hash 987898869, now seen corresponding path program 1 times [2023-11-19 04:12:00,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:00,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245858074] [2023-11-19 04:12:00,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:00,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:01,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:01,092 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:01,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245858074] [2023-11-19 04:12:01,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245858074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:01,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:01,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:12:01,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703965771] [2023-11-19 04:12:01,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:01,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:12:01,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:01,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:12:01,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:12:01,097 INFO L87 Difference]: Start difference. First operand 634 states and 1960 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-11-19 04:12:01,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:01,191 INFO L93 Difference]: Finished difference Result 538 states and 1640 transitions. [2023-11-19 04:12:01,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:12:01,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-11-19 04:12:01,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:01,199 INFO L225 Difference]: With dead ends: 538 [2023-11-19 04:12:01,199 INFO L226 Difference]: Without dead ends: 522 [2023-11-19 04:12:01,199 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-11-19 04:12:01,202 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:01,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:01,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2023-11-19 04:12:01,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2023-11-19 04:12:01,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 520 states have (on average 3.076923076923077) internal successors, (1600), 521 states have internal predecessors, (1600), 0 states have call successors, (0), 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-11-19 04:12:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1600 transitions. [2023-11-19 04:12:01,247 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1600 transitions. Word has length 7 [2023-11-19 04:12:01,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:01,248 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 1600 transitions. [2023-11-19 04:12:01,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-11-19 04:12:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1600 transitions. [2023-11-19 04:12:01,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 04:12:01,252 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:01,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:01,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 04:12:01,254 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:01,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:01,256 INFO L85 PathProgramCache]: Analyzing trace with hash 183088636, now seen corresponding path program 1 times [2023-11-19 04:12:01,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:01,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175381198] [2023-11-19 04:12:01,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:01,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:01,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:01,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:01,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175381198] [2023-11-19 04:12:01,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175381198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:01,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:01,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:12:01,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787842264] [2023-11-19 04:12:01,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:01,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:12:01,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:01,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:12:01,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:12:01,904 INFO L87 Difference]: Start difference. First operand 522 states and 1600 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-11-19 04:12:02,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:02,018 INFO L93 Difference]: Finished difference Result 426 states and 1280 transitions. [2023-11-19 04:12:02,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:12:02,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2023-11-19 04:12:02,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:02,023 INFO L225 Difference]: With dead ends: 426 [2023-11-19 04:12:02,024 INFO L226 Difference]: Without dead ends: 426 [2023-11-19 04:12:02,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:12:02,028 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 21 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:02,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 15 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:02,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2023-11-19 04:12:02,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2023-11-19 04:12:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 3.011764705882353) internal successors, (1280), 425 states have internal predecessors, (1280), 0 states have call successors, (0), 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-11-19 04:12:02,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1280 transitions. [2023-11-19 04:12:02,050 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1280 transitions. Word has length 9 [2023-11-19 04:12:02,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:02,050 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 1280 transitions. [2023-11-19 04:12:02,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-11-19 04:12:02,051 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1280 transitions. [2023-11-19 04:12:02,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 04:12:02,054 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:02,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:02,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 04:12:02,055 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:02,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:02,056 INFO L85 PathProgramCache]: Analyzing trace with hash 183088618, now seen corresponding path program 1 times [2023-11-19 04:12:02,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:02,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677564405] [2023-11-19 04:12:02,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:02,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:02,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:02,304 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:02,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677564405] [2023-11-19 04:12:02,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677564405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:02,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:02,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:12:02,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883175177] [2023-11-19 04:12:02,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:02,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:12:02,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:02,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:12:02,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:12:02,306 INFO L87 Difference]: Start difference. First operand 426 states and 1280 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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-11-19 04:12:02,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:02,416 INFO L93 Difference]: Finished difference Result 606 states and 1724 transitions. [2023-11-19 04:12:02,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:12:02,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2023-11-19 04:12:02,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:02,422 INFO L225 Difference]: With dead ends: 606 [2023-11-19 04:12:02,422 INFO L226 Difference]: Without dead ends: 570 [2023-11-19 04:12:02,423 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-11-19 04:12:02,424 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:02,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:02,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2023-11-19 04:12:02,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 526. [2023-11-19 04:12:02,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 2.9180952380952383) internal successors, (1532), 525 states have internal predecessors, (1532), 0 states have call successors, (0), 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-11-19 04:12:02,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 1532 transitions. [2023-11-19 04:12:02,447 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 1532 transitions. Word has length 9 [2023-11-19 04:12:02,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:02,448 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 1532 transitions. [2023-11-19 04:12:02,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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-11-19 04:12:02,448 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 1532 transitions. [2023-11-19 04:12:02,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 04:12:02,450 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:02,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:02,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 04:12:02,451 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:02,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:02,452 INFO L85 PathProgramCache]: Analyzing trace with hash -437579265, now seen corresponding path program 1 times [2023-11-19 04:12:02,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:02,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818027024] [2023-11-19 04:12:02,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:02,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:02,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:02,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818027024] [2023-11-19 04:12:02,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818027024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:02,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:02,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:12:02,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577114139] [2023-11-19 04:12:02,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:02,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:12:02,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:02,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:12:02,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:12:02,670 INFO L87 Difference]: Start difference. First operand 526 states and 1532 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-11-19 04:12:02,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:02,723 INFO L93 Difference]: Finished difference Result 502 states and 1450 transitions. [2023-11-19 04:12:02,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:12:02,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-11-19 04:12:02,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:02,728 INFO L225 Difference]: With dead ends: 502 [2023-11-19 04:12:02,729 INFO L226 Difference]: Without dead ends: 502 [2023-11-19 04:12:02,729 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-11-19 04:12:02,730 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:02,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 04:12:02,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2023-11-19 04:12:02,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 454. [2023-11-19 04:12:02,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 2.9183222958057393) internal successors, (1322), 453 states have internal predecessors, (1322), 0 states have call successors, (0), 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-11-19 04:12:02,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1322 transitions. [2023-11-19 04:12:02,750 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1322 transitions. Word has length 10 [2023-11-19 04:12:02,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:02,750 INFO L495 AbstractCegarLoop]: Abstraction has 454 states and 1322 transitions. [2023-11-19 04:12:02,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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-11-19 04:12:02,751 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1322 transitions. [2023-11-19 04:12:02,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 04:12:02,752 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:02,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:02,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 04:12:02,753 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:02,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:02,754 INFO L85 PathProgramCache]: Analyzing trace with hash -146158996, now seen corresponding path program 1 times [2023-11-19 04:12:02,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:02,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539878099] [2023-11-19 04:12:02,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:02,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:02,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:02,936 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:02,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539878099] [2023-11-19 04:12:02,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539878099] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:02,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:02,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:12:02,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508041129] [2023-11-19 04:12:02,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:02,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:12:02,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:02,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:12:02,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:12:02,939 INFO L87 Difference]: Start difference. First operand 454 states and 1322 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:12:03,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:03,078 INFO L93 Difference]: Finished difference Result 518 states and 1466 transitions. [2023-11-19 04:12:03,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:12:03,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-19 04:12:03,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:03,085 INFO L225 Difference]: With dead ends: 518 [2023-11-19 04:12:03,087 INFO L226 Difference]: Without dead ends: 518 [2023-11-19 04:12:03,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:12:03,088 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 16 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:03,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 7 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:03,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2023-11-19 04:12:03,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 446. [2023-11-19 04:12:03,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 2.903370786516854) internal successors, (1292), 445 states have internal predecessors, (1292), 0 states have call successors, (0), 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-11-19 04:12:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1292 transitions. [2023-11-19 04:12:03,118 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1292 transitions. Word has length 11 [2023-11-19 04:12:03,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:03,119 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 1292 transitions. [2023-11-19 04:12:03,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:12:03,119 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1292 transitions. [2023-11-19 04:12:03,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 04:12:03,123 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:03,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:03,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 04:12:03,124 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:03,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:03,124 INFO L85 PathProgramCache]: Analyzing trace with hash 392459585, now seen corresponding path program 1 times [2023-11-19 04:12:03,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:03,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427605072] [2023-11-19 04:12:03,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:03,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:03,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:03,358 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:03,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427605072] [2023-11-19 04:12:03,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427605072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:03,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:03,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:12:03,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356785877] [2023-11-19 04:12:03,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:03,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:12:03,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:03,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:12:03,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:12:03,363 INFO L87 Difference]: Start difference. First operand 446 states and 1292 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-11-19 04:12:03,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:03,467 INFO L93 Difference]: Finished difference Result 437 states and 1110 transitions. [2023-11-19 04:12:03,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:12:03,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-19 04:12:03,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:03,470 INFO L225 Difference]: With dead ends: 437 [2023-11-19 04:12:03,470 INFO L226 Difference]: Without dead ends: 321 [2023-11-19 04:12:03,471 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-11-19 04:12:03,471 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 28 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:03,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 15 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:03,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2023-11-19 04:12:03,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2023-11-19 04:12:03,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 2.4875) internal successors, (796), 320 states have internal predecessors, (796), 0 states have call successors, (0), 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-11-19 04:12:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 796 transitions. [2023-11-19 04:12:03,484 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 796 transitions. Word has length 12 [2023-11-19 04:12:03,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:03,484 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 796 transitions. [2023-11-19 04:12:03,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-11-19 04:12:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 796 transitions. [2023-11-19 04:12:03,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 04:12:03,486 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:03,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:03,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 04:12:03,486 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:03,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:03,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1839947864, now seen corresponding path program 1 times [2023-11-19 04:12:03,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:03,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764509428] [2023-11-19 04:12:03,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:03,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:03,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:03,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:03,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764509428] [2023-11-19 04:12:03,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764509428] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:03,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:03,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:12:03,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412473811] [2023-11-19 04:12:03,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:03,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:12:03,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:03,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:12:03,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:12:03,642 INFO L87 Difference]: Start difference. First operand 321 states and 796 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-11-19 04:12:03,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:03,709 INFO L93 Difference]: Finished difference Result 428 states and 1032 transitions. [2023-11-19 04:12:03,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:12:03,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2023-11-19 04:12:03,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:03,713 INFO L225 Difference]: With dead ends: 428 [2023-11-19 04:12:03,713 INFO L226 Difference]: Without dead ends: 300 [2023-11-19 04:12:03,713 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-11-19 04:12:03,714 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 7 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-11-19 04:12:03,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 7 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:03,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-19 04:12:03,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 270. [2023-11-19 04:12:03,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 2.379182156133829) internal successors, (640), 269 states have internal predecessors, (640), 0 states have call successors, (0), 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-11-19 04:12:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 640 transitions. [2023-11-19 04:12:03,725 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 640 transitions. Word has length 14 [2023-11-19 04:12:03,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:03,725 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 640 transitions. [2023-11-19 04:12:03,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-11-19 04:12:03,725 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 640 transitions. [2023-11-19 04:12:03,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 04:12:03,726 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:03,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:03,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 04:12:03,727 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:03,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:03,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1725727731, now seen corresponding path program 1 times [2023-11-19 04:12:03,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:03,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584638031] [2023-11-19 04:12:03,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:03,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:03,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:03,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:03,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584638031] [2023-11-19 04:12:03,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584638031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:03,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:03,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:12:03,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19152648] [2023-11-19 04:12:03,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:03,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:12:03,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:03,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:12:03,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:12:03,950 INFO L87 Difference]: Start difference. First operand 270 states and 640 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-11-19 04:12:04,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:04,087 INFO L93 Difference]: Finished difference Result 222 states and 477 transitions. [2023-11-19 04:12:04,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:12:04,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2023-11-19 04:12:04,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:04,089 INFO L225 Difference]: With dead ends: 222 [2023-11-19 04:12:04,089 INFO L226 Difference]: Without dead ends: 171 [2023-11-19 04:12:04,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:12:04,090 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 39 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:04,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 20 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:04,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-11-19 04:12:04,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2023-11-19 04:12:04,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 2.1) internal successors, (357), 170 states have internal predecessors, (357), 0 states have call successors, (0), 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-11-19 04:12:04,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 357 transitions. [2023-11-19 04:12:04,098 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 357 transitions. Word has length 14 [2023-11-19 04:12:04,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:04,098 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 357 transitions. [2023-11-19 04:12:04,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-11-19 04:12:04,098 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 357 transitions. [2023-11-19 04:12:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 04:12:04,099 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:04,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:04,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 04:12:04,100 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:04,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:04,100 INFO L85 PathProgramCache]: Analyzing trace with hash -538672413, now seen corresponding path program 1 times [2023-11-19 04:12:04,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:04,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290203345] [2023-11-19 04:12:04,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:04,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:04,329 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:04,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290203345] [2023-11-19 04:12:04,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290203345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:04,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:04,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:12:04,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632815103] [2023-11-19 04:12:04,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:04,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:12:04,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:04,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:12:04,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:12:04,331 INFO L87 Difference]: Start difference. First operand 171 states and 357 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:12:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:04,464 INFO L93 Difference]: Finished difference Result 153 states and 320 transitions. [2023-11-19 04:12:04,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:12:04,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-19 04:12:04,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:04,466 INFO L225 Difference]: With dead ends: 153 [2023-11-19 04:12:04,466 INFO L226 Difference]: Without dead ends: 93 [2023-11-19 04:12:04,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:12:04,467 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 45 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:04,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 17 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-19 04:12:04,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-11-19 04:12:04,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.010869565217391) internal successors, (185), 92 states have internal predecessors, (185), 0 states have call successors, (0), 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-11-19 04:12:04,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 185 transitions. [2023-11-19 04:12:04,471 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 185 transitions. Word has length 17 [2023-11-19 04:12:04,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:04,471 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 185 transitions. [2023-11-19 04:12:04,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:12:04,472 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 185 transitions. [2023-11-19 04:12:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 04:12:04,472 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:04,472 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] [2023-11-19 04:12:04,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 04:12:04,473 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:04,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:04,473 INFO L85 PathProgramCache]: Analyzing trace with hash -690567939, now seen corresponding path program 1 times [2023-11-19 04:12:04,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:04,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242350334] [2023-11-19 04:12:04,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:04,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:04,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:04,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242350334] [2023-11-19 04:12:04,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242350334] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:04,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:04,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:12:04,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730134953] [2023-11-19 04:12:04,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:04,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:12:04,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:04,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:12:04,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:12:04,748 INFO L87 Difference]: Start difference. First operand 93 states and 185 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:12:04,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:04,853 INFO L93 Difference]: Finished difference Result 118 states and 230 transitions. [2023-11-19 04:12:04,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:12:04,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-19 04:12:04,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:04,854 INFO L225 Difference]: With dead ends: 118 [2023-11-19 04:12:04,854 INFO L226 Difference]: Without dead ends: 84 [2023-11-19 04:12:04,855 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-11-19 04:12:04,855 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:04,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 5 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-19 04:12:04,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2023-11-19 04:12:04,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.875) internal successors, (135), 72 states have internal predecessors, (135), 0 states have call successors, (0), 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-11-19 04:12:04,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 135 transitions. [2023-11-19 04:12:04,859 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 135 transitions. Word has length 20 [2023-11-19 04:12:04,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:04,859 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 135 transitions. [2023-11-19 04:12:04,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:12:04,860 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 135 transitions. [2023-11-19 04:12:04,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 04:12:04,860 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:04,860 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] [2023-11-19 04:12:04,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 04:12:04,861 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:04,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:04,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1883203599, now seen corresponding path program 2 times [2023-11-19 04:12:04,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:04,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513155347] [2023-11-19 04:12:04,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:04,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:05,120 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:05,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513155347] [2023-11-19 04:12:05,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513155347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:05,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:05,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:12:05,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857139964] [2023-11-19 04:12:05,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:05,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:12:05,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:05,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:12:05,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:12:05,122 INFO L87 Difference]: Start difference. First operand 73 states and 135 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:12:05,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:05,229 INFO L93 Difference]: Finished difference Result 104 states and 193 transitions. [2023-11-19 04:12:05,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:12:05,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-19 04:12:05,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:05,230 INFO L225 Difference]: With dead ends: 104 [2023-11-19 04:12:05,230 INFO L226 Difference]: Without dead ends: 42 [2023-11-19 04:12:05,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:12:05,231 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 32 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:05,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 7 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:05,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-19 04:12:05,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-19 04:12:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 41 states have internal predecessors, (68), 0 states have call successors, (0), 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-11-19 04:12:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 68 transitions. [2023-11-19 04:12:05,233 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 68 transitions. Word has length 20 [2023-11-19 04:12:05,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:05,234 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 68 transitions. [2023-11-19 04:12:05,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:12:05,234 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 68 transitions. [2023-11-19 04:12:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 04:12:05,234 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:05,234 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] [2023-11-19 04:12:05,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 04:12:05,235 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:05,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:05,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1249094647, now seen corresponding path program 3 times [2023-11-19 04:12:05,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:05,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984903356] [2023-11-19 04:12:05,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:05,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:05,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:12:05,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984903356] [2023-11-19 04:12:05,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984903356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:05,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:05,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:12:05,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464667706] [2023-11-19 04:12:05,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:05,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:12:05,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:12:05,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:12:05,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:12:05,902 INFO L87 Difference]: Start difference. First operand 42 states and 68 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:12:06,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:06,057 INFO L93 Difference]: Finished difference Result 52 states and 82 transitions. [2023-11-19 04:12:06,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:12:06,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-19 04:12:06,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:06,059 INFO L225 Difference]: With dead ends: 52 [2023-11-19 04:12:06,059 INFO L226 Difference]: Without dead ends: 30 [2023-11-19 04:12:06,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:12:06,060 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:06,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 16 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:06,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-19 04:12:06,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-19 04:12:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 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-11-19 04:12:06,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2023-11-19 04:12:06,063 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 20 [2023-11-19 04:12:06,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:06,063 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2023-11-19 04:12:06,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:12:06,063 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2023-11-19 04:12:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 04:12:06,064 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:06,064 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] [2023-11-19 04:12:06,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 04:12:06,064 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:06,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:06,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1561720759, now seen corresponding path program 4 times [2023-11-19 04:12:06,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:12:06,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957677442] [2023-11-19 04:12:06,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:06,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:12:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:12:06,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 04:12:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:12:06,226 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 04:12:06,227 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 04:12:06,228 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-19 04:12:06,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-19 04:12:06,230 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-19 04:12:06,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-19 04:12:06,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-19 04:12:06,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-19 04:12:06,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-19 04:12:06,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-19 04:12:06,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-19 04:12:06,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-19 04:12:06,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-19 04:12:06,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-19 04:12:06,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-19 04:12:06,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 04:12:06,236 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:06,244 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 04:12:06,244 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 04:12:06,319 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 04:12:06,321 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 04:12:06,322 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 04:12:06,330 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-19 04:12:06,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 04:12:06 BasicIcfg [2023-11-19 04:12:06,344 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 04:12:06,345 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 04:12:06,345 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 04:12:06,345 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 04:12:06,346 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:11:53" (3/4) ... [2023-11-19 04:12:06,348 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 04:12:06,349 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 04:12:06,350 INFO L158 Benchmark]: Toolchain (without parser) took 14510.82ms. Allocated memory was 107.0MB in the beginning and 268.4MB in the end (delta: 161.5MB). Free memory was 61.5MB in the beginning and 196.8MB in the end (delta: -135.2MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2023-11-19 04:12:06,350 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 107.0MB. Free memory is still 75.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 04:12:06,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 765.09ms. Allocated memory is still 107.0MB. Free memory was 61.5MB in the beginning and 78.5MB in the end (delta: -16.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2023-11-19 04:12:06,351 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.65ms. Allocated memory is still 107.0MB. Free memory was 78.5MB in the beginning and 75.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 04:12:06,352 INFO L158 Benchmark]: Boogie Preprocessor took 37.67ms. Allocated memory is still 107.0MB. Free memory was 75.8MB in the beginning and 73.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 04:12:06,353 INFO L158 Benchmark]: RCFGBuilder took 901.32ms. Allocated memory was 107.0MB in the beginning and 153.1MB in the end (delta: 46.1MB). Free memory was 73.7MB in the beginning and 122.2MB in the end (delta: -48.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2023-11-19 04:12:06,354 INFO L158 Benchmark]: TraceAbstraction took 12739.86ms. Allocated memory was 153.1MB in the beginning and 268.4MB in the end (delta: 115.3MB). Free memory was 122.2MB in the beginning and 196.8MB in the end (delta: -74.5MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2023-11-19 04:12:06,355 INFO L158 Benchmark]: Witness Printer took 4.38ms. Allocated memory is still 268.4MB. Free memory is still 196.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 04:12:06,357 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.40ms. Allocated memory is still 107.0MB. Free memory is still 75.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 765.09ms. Allocated memory is still 107.0MB. Free memory was 61.5MB in the beginning and 78.5MB in the end (delta: -16.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.65ms. Allocated memory is still 107.0MB. Free memory was 78.5MB in the beginning and 75.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.67ms. Allocated memory is still 107.0MB. Free memory was 75.8MB in the beginning and 73.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 901.32ms. Allocated memory was 107.0MB in the beginning and 153.1MB in the end (delta: 46.1MB). Free memory was 73.7MB in the beginning and 122.2MB in the end (delta: -48.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12739.86ms. Allocated memory was 153.1MB in the beginning and 268.4MB in the end (delta: 115.3MB). Free memory was 122.2MB in the beginning and 196.8MB in the end (delta: -74.5MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. * Witness Printer took 4.38ms. Allocated memory is still 268.4MB. Free memory is still 196.8MB. 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~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - 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: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 137 PlacesBefore, 42 PlacesAfterwards, 131 TransitionsBefore, 33 TransitionsAfterwards, 2834 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 3 ChoiceCompositions, 136 TotalNumberOfCompositions, 5858 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3446, independent: 3302, independent conditional: 0, independent unconditional: 3302, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2090, independent: 2036, independent conditional: 0, independent unconditional: 2036, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2090, independent: 2024, independent conditional: 0, independent unconditional: 2024, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 329, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 303, dependent conditional: 0, dependent unconditional: 303, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3446, independent: 1266, independent conditional: 0, independent unconditional: 1266, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 2090, unknown conditional: 0, unknown unconditional: 2090] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 142, Positive conditional cache size: 0, Positive unconditional cache size: 142, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1004; [L834] FCALL, FORK 0 pthread_create(&t1004, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1004={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t1005; [L836] FCALL, FORK 0 pthread_create(&t1005, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1004={5:0}, t1005={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t1006; [L838] FCALL, FORK 0 pthread_create(&t1006, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1004={5:0}, t1005={6:0}, t1006={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L808] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L762] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004={5:0}, t1005={6:0}, t1006={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix038.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 834]: 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: 836]: 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, 158 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 239 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 239 mSDsluCounter, 127 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 765 IncrementalHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 56 mSDtfsCounter, 765 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=676occurred 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: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 205 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 969 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-11-19 04:12:06,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ --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 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:12:09,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:12:09,255 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-11-19 04:12:09,264 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:12:09,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:12:09,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:12:09,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:12:09,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:12:09,344 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:12:09,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:12:09,350 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:12:09,351 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:12:09,351 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:12:09,353 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:12:09,353 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:12:09,354 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:12:09,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 04:12:09,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 04:12:09,356 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:12:09,357 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:12:09,358 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:12:09,358 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:12:09,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:12:09,359 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 04:12:09,360 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 04:12:09,360 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 04:12:09,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:12:09,361 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 04:12:09,361 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 04:12:09,362 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 04:12:09,363 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 04:12:09,364 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:12:09,364 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:12:09,364 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:12:09,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 04:12:09,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:12:09,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:12:09,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:12:09,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:12:09,367 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-19 04:12:09,367 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 04:12:09,367 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:12:09,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:12:09,368 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_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/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_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ 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 -> 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a [2023-11-19 04:12:09,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:12:09,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:12:09,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:12:09,823 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:12:09,824 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:12:09,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread-wmm/mix038.opt.i [2023-11-19 04:12:12,954 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:12:13,390 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:12:13,392 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/sv-benchmarks/c/pthread-wmm/mix038.opt.i [2023-11-19 04:12:13,421 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/data/be2d6fcef/19b976c1e05443d79e99e03ecf71c5a8/FLAGf208a990a [2023-11-19 04:12:13,438 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/data/be2d6fcef/19b976c1e05443d79e99e03ecf71c5a8 [2023-11-19 04:12:13,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:12:13,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:12:13,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:12:13,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:12:13,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:12:13,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:12:13" (1/1) ... [2023-11-19 04:12:13,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7daea7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:13, skipping insertion in model container [2023-11-19 04:12:13,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:12:13" (1/1) ... [2023-11-19 04:12:13,543 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:12:14,100 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:12:14,124 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:12:14,226 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:12:14,280 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:12:14,281 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:12:14,289 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:12:14,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:14 WrapperNode [2023-11-19 04:12:14,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:12:14,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:12:14,292 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:12:14,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:12:14,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:14" (1/1) ... [2023-11-19 04:12:14,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:14" (1/1) ... [2023-11-19 04:12:14,397 INFO L138 Inliner]: procedures = 179, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 142 [2023-11-19 04:12:14,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:12:14,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:12:14,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:12:14,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:12:14,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:14" (1/1) ... [2023-11-19 04:12:14,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:14" (1/1) ... [2023-11-19 04:12:14,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:14" (1/1) ... [2023-11-19 04:12:14,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:14" (1/1) ... [2023-11-19 04:12:14,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:14" (1/1) ... [2023-11-19 04:12:14,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:14" (1/1) ... [2023-11-19 04:12:14,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:14" (1/1) ... [2023-11-19 04:12:14,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:14" (1/1) ... [2023-11-19 04:12:14,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:12:14,437 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:12:14,437 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:12:14,438 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:12:14,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:14" (1/1) ... [2023-11-19 04:12:14,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:12:14,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:12:14,490 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:12:14,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:12:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 04:12:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:12:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:12:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:12:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-19 04:12:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 04:12:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 04:12:14,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 04:12:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 04:12:14,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 04:12:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 04:12:14,542 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 04:12:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 04:12:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:12:14,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:12:14,544 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 04:12:14,706 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:12:14,708 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:12:15,180 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:12:15,369 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:12:15,370 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 04:12:15,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:12:15 BoogieIcfgContainer [2023-11-19 04:12:15,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:12:15,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:12:15,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:12:15,384 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:12:15,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:12:13" (1/3) ... [2023-11-19 04:12:15,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50321f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:12:15, skipping insertion in model container [2023-11-19 04:12:15,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:12:14" (2/3) ... [2023-11-19 04:12:15,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50321f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:12:15, skipping insertion in model container [2023-11-19 04:12:15,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:12:15" (3/3) ... [2023-11-19 04:12:15,388 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038.opt.i [2023-11-19 04:12:15,408 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:12:15,408 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-19 04:12:15,409 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 04:12:15,482 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 04:12:15,519 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:12:15,535 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 132 transitions, 276 flow [2023-11-19 04:12:15,538 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 132 transitions, 276 flow [2023-11-19 04:12:15,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 132 transitions, 276 flow [2023-11-19 04:12:15,630 INFO L124 PetriNetUnfolderBase]: 4/129 cut-off events. [2023-11-19 04:12:15,631 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 04:12:15,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 129 events. 4/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-11-19 04:12:15,641 INFO L119 LiptonReduction]: Number of co-enabled transitions 2834 [2023-11-19 04:12:25,526 INFO L134 LiptonReduction]: Checked pairs total: 5848 [2023-11-19 04:12:25,526 INFO L136 LiptonReduction]: Total number of compositions: 139 [2023-11-19 04:12:25,535 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 33 transitions, 78 flow [2023-11-19 04:12:25,653 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 676 states, 665 states have (on average 3.26015037593985) internal successors, (2168), 675 states have internal predecessors, (2168), 0 states have call successors, (0), 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-11-19 04:12:25,677 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:12:25,684 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;@494b5a01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:12:25,684 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-19 04:12:25,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 676 states, 665 states have (on average 3.26015037593985) internal successors, (2168), 675 states have internal predecessors, (2168), 0 states have call successors, (0), 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-11-19 04:12:25,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2023-11-19 04:12:25,693 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:25,694 INFO L195 NwaCegarLoop]: trace histogram [1] [2023-11-19 04:12:25,695 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:25,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:25,704 INFO L85 PathProgramCache]: Analyzing trace with hash 577, now seen corresponding path program 1 times [2023-11-19 04:12:25,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:12:25,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663852915] [2023-11-19 04:12:25,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:25,717 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-11-19 04:12:25,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:12:25,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:25,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:25,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-19 04:12:25,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:12:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:25,818 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:12:25,819 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 04:12:25,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663852915] [2023-11-19 04:12:25,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663852915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:25,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:25,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 04:12:25,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659238922] [2023-11-19 04:12:25,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:25,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 04:12:25,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 04:12:25,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 04:12:25,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:12:25,860 INFO L87 Difference]: Start difference. First operand has 676 states, 665 states have (on average 3.26015037593985) internal successors, (2168), 675 states have internal predecessors, (2168), 0 states have call successors, (0), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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-11-19 04:12:25,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:25,978 INFO L93 Difference]: Finished difference Result 634 states and 1960 transitions. [2023-11-19 04:12:25,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 04:12:25,980 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2023-11-19 04:12:25,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:26,012 INFO L225 Difference]: With dead ends: 634 [2023-11-19 04:12:26,013 INFO L226 Difference]: Without dead ends: 634 [2023-11-19 04:12:26,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:12:26,016 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:26,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:26,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2023-11-19 04:12:26,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2023-11-19 04:12:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 629 states have (on average 3.1160572337042924) internal successors, (1960), 633 states have internal predecessors, (1960), 0 states have call successors, (0), 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-11-19 04:12:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1960 transitions. [2023-11-19 04:12:26,136 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 1960 transitions. Word has length 1 [2023-11-19 04:12:26,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:26,137 INFO L495 AbstractCegarLoop]: Abstraction has 634 states and 1960 transitions. [2023-11-19 04:12:26,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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-11-19 04:12:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1960 transitions. [2023-11-19 04:12:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-19 04:12:26,138 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:26,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:26,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:26,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:26,341 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:26,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:26,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1181304236, now seen corresponding path program 1 times [2023-11-19 04:12:26,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:12:26,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274080934] [2023-11-19 04:12:26,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:26,344 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-11-19 04:12:26,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:12:26,347 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:26,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:26,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 04:12:26,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:12:26,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:26,548 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:12:26,548 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 04:12:26,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274080934] [2023-11-19 04:12:26,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274080934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:26,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:26,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:12:26,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648059101] [2023-11-19 04:12:26,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:26,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:12:26,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 04:12:26,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:12:26,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:12:26,555 INFO L87 Difference]: Start difference. First operand 634 states and 1960 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-11-19 04:12:26,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:26,655 INFO L93 Difference]: Finished difference Result 538 states and 1640 transitions. [2023-11-19 04:12:26,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:12:26,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-11-19 04:12:26,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:26,664 INFO L225 Difference]: With dead ends: 538 [2023-11-19 04:12:26,664 INFO L226 Difference]: Without dead ends: 522 [2023-11-19 04:12:26,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-11-19 04:12:26,667 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:26,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:26,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2023-11-19 04:12:26,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2023-11-19 04:12:26,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 520 states have (on average 3.076923076923077) internal successors, (1600), 521 states have internal predecessors, (1600), 0 states have call successors, (0), 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-11-19 04:12:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1600 transitions. [2023-11-19 04:12:26,716 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1600 transitions. Word has length 7 [2023-11-19 04:12:26,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:26,717 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 1600 transitions. [2023-11-19 04:12:26,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-11-19 04:12:26,721 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1600 transitions. [2023-11-19 04:12:26,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 04:12:26,723 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:26,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:26,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-19 04:12:26,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:26,926 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:26,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:26,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1362044045, now seen corresponding path program 1 times [2023-11-19 04:12:26,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:12:26,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651769327] [2023-11-19 04:12:26,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:26,928 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-11-19 04:12:26,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:12:26,930 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:26,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:27,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-19 04:12:27,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:12:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:27,113 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:12:27,114 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 04:12:27,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651769327] [2023-11-19 04:12:27,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651769327] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:27,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:27,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:12:27,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530834104] [2023-11-19 04:12:27,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:27,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:12:27,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 04:12:27,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:12:27,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:12:27,118 INFO L87 Difference]: Start difference. First operand 522 states and 1600 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-11-19 04:12:27,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:27,288 INFO L93 Difference]: Finished difference Result 438 states and 1149 transitions. [2023-11-19 04:12:27,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:12:27,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2023-11-19 04:12:27,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:27,292 INFO L225 Difference]: With dead ends: 438 [2023-11-19 04:12:27,293 INFO L226 Difference]: Without dead ends: 342 [2023-11-19 04:12:27,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-11-19 04:12:27,295 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 31 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:27,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 15 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:27,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-11-19 04:12:27,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2023-11-19 04:12:27,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 340 states have (on average 2.588235294117647) internal successors, (880), 341 states have internal predecessors, (880), 0 states have call successors, (0), 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-11-19 04:12:27,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 880 transitions. [2023-11-19 04:12:27,313 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 880 transitions. Word has length 9 [2023-11-19 04:12:27,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:27,313 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 880 transitions. [2023-11-19 04:12:27,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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-11-19 04:12:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 880 transitions. [2023-11-19 04:12:27,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 04:12:27,316 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:27,316 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:27,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-19 04:12:27,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:27,519 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:27,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:27,520 INFO L85 PathProgramCache]: Analyzing trace with hash -465124667, now seen corresponding path program 1 times [2023-11-19 04:12:27,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:12:27,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112032406] [2023-11-19 04:12:27,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:27,521 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-11-19 04:12:27,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:12:27,523 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:27,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:27,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 04:12:27,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:12:27,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:27,710 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:12:27,711 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 04:12:27,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112032406] [2023-11-19 04:12:27,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112032406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:27,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:27,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:12:27,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540965350] [2023-11-19 04:12:27,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:27,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:12:27,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 04:12:27,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:12:27,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:12:27,715 INFO L87 Difference]: Start difference. First operand 342 states and 880 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-11-19 04:12:27,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:27,948 INFO L93 Difference]: Finished difference Result 237 states and 540 transitions. [2023-11-19 04:12:27,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:12:27,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-19 04:12:27,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:27,951 INFO L225 Difference]: With dead ends: 237 [2023-11-19 04:12:27,951 INFO L226 Difference]: Without dead ends: 186 [2023-11-19 04:12:27,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:12:27,953 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 41 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:27,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 27 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:12:27,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-11-19 04:12:27,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2023-11-19 04:12:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 184 states have (on average 2.239130434782609) internal successors, (412), 185 states have internal predecessors, (412), 0 states have call successors, (0), 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-11-19 04:12:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 412 transitions. [2023-11-19 04:12:27,966 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 412 transitions. Word has length 12 [2023-11-19 04:12:27,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:27,966 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 412 transitions. [2023-11-19 04:12:27,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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-11-19 04:12:27,967 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 412 transitions. [2023-11-19 04:12:27,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 04:12:27,973 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:27,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:27,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-19 04:12:28,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:28,174 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:28,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:28,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1398739202, now seen corresponding path program 1 times [2023-11-19 04:12:28,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:12:28,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487682157] [2023-11-19 04:12:28,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:28,175 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-11-19 04:12:28,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:12:28,177 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:28,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:28,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 04:12:28,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:12:28,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:28,383 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:12:28,383 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 04:12:28,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487682157] [2023-11-19 04:12:28,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487682157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:28,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:28,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:12:28,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011533931] [2023-11-19 04:12:28,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:28,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:12:28,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 04:12:28,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:12:28,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:12:28,392 INFO L87 Difference]: Start difference. First operand 186 states and 412 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:12:28,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:28,689 INFO L93 Difference]: Finished difference Result 154 states and 346 transitions. [2023-11-19 04:12:28,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:12:28,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-19 04:12:28,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:28,691 INFO L225 Difference]: With dead ends: 154 [2023-11-19 04:12:28,691 INFO L226 Difference]: Without dead ends: 142 [2023-11-19 04:12:28,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:12:28,693 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:28,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 45 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 04:12:28,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-19 04:12:28,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2023-11-19 04:12:28,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 140 states have (on average 2.3142857142857145) internal successors, (324), 141 states have internal predecessors, (324), 0 states have call successors, (0), 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-11-19 04:12:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 324 transitions. [2023-11-19 04:12:28,700 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 324 transitions. Word has length 15 [2023-11-19 04:12:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:28,700 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 324 transitions. [2023-11-19 04:12:28,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:12:28,701 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 324 transitions. [2023-11-19 04:12:28,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 04:12:28,702 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:28,702 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] [2023-11-19 04:12:28,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:28,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:28,905 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:28,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:28,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1695437775, now seen corresponding path program 1 times [2023-11-19 04:12:28,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:12:28,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154477199] [2023-11-19 04:12:28,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:28,907 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-11-19 04:12:28,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:12:28,909 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:28,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:29,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-19 04:12:29,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:12:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:29,467 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:12:29,467 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 04:12:29,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154477199] [2023-11-19 04:12:29,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154477199] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:29,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:29,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:12:29,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144613342] [2023-11-19 04:12:29,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:29,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:12:29,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 04:12:29,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:12:29,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:12:29,470 INFO L87 Difference]: Start difference. First operand 142 states and 324 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:12:29,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:29,623 INFO L93 Difference]: Finished difference Result 141 states and 323 transitions. [2023-11-19 04:12:29,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:12:29,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-19 04:12:29,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:29,625 INFO L225 Difference]: With dead ends: 141 [2023-11-19 04:12:29,625 INFO L226 Difference]: Without dead ends: 141 [2023-11-19 04:12:29,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:12:29,626 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:29,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 15 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-19 04:12:29,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2023-11-19 04:12:29,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 2.307142857142857) internal successors, (323), 140 states have internal predecessors, (323), 0 states have call successors, (0), 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-11-19 04:12:29,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 323 transitions. [2023-11-19 04:12:29,633 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 323 transitions. Word has length 20 [2023-11-19 04:12:29,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:29,634 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 323 transitions. [2023-11-19 04:12:29,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:12:29,634 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 323 transitions. [2023-11-19 04:12:29,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 04:12:29,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:29,635 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] [2023-11-19 04:12:29,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-19 04:12:29,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:29,839 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:29,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:29,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1695437752, now seen corresponding path program 1 times [2023-11-19 04:12:29,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:12:29,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063487233] [2023-11-19 04:12:29,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:12:29,841 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-11-19 04:12:29,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:12:29,842 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:29,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:12:29,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 04:12:29,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:12:30,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:30,022 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:12:30,022 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 04:12:30,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063487233] [2023-11-19 04:12:30,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1063487233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:30,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:30,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:12:30,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555940980] [2023-11-19 04:12:30,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:30,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:12:30,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 04:12:30,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:12:30,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:12:30,025 INFO L87 Difference]: Start difference. First operand 141 states and 323 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:12:30,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:30,139 INFO L93 Difference]: Finished difference Result 179 states and 400 transitions. [2023-11-19 04:12:30,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:12:30,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-19 04:12:30,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:30,141 INFO L225 Difference]: With dead ends: 179 [2023-11-19 04:12:30,141 INFO L226 Difference]: Without dead ends: 75 [2023-11-19 04:12:30,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-11-19 04:12:30,142 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 15 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:30,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 9 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-19 04:12:30,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-11-19 04:12:30,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.972972972972973) internal successors, (146), 74 states have internal predecessors, (146), 0 states have call successors, (0), 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-11-19 04:12:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 146 transitions. [2023-11-19 04:12:30,146 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 146 transitions. Word has length 20 [2023-11-19 04:12:30,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:30,146 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 146 transitions. [2023-11-19 04:12:30,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:12:30,146 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 146 transitions. [2023-11-19 04:12:30,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 04:12:30,147 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:30,147 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] [2023-11-19 04:12:30,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-19 04:12:30,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:30,348 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:30,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:30,348 INFO L85 PathProgramCache]: Analyzing trace with hash 838407180, now seen corresponding path program 2 times [2023-11-19 04:12:30,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:12:30,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163280537] [2023-11-19 04:12:30,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 04:12:30,349 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-11-19 04:12:30,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:12:30,350 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:30,374 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:30,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-19 04:12:30,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 04:12:30,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 04:12:30,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:12:30,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:30,491 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:12:30,491 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 04:12:30,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163280537] [2023-11-19 04:12:30,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163280537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:30,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:30,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:12:30,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73125438] [2023-11-19 04:12:30,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:30,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:12:30,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 04:12:30,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:12:30,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:12:30,493 INFO L87 Difference]: Start difference. First operand 75 states and 146 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:12:30,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:30,563 INFO L93 Difference]: Finished difference Result 95 states and 181 transitions. [2023-11-19 04:12:30,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:12:30,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-19 04:12:30,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:30,564 INFO L225 Difference]: With dead ends: 95 [2023-11-19 04:12:30,564 INFO L226 Difference]: Without dead ends: 42 [2023-11-19 04:12:30,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-11-19 04:12:30,565 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 4 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5 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-11-19 04:12:30,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:30,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-19 04:12:30,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-19 04:12:30,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 41 states have internal predecessors, (68), 0 states have call successors, (0), 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-11-19 04:12:30,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 68 transitions. [2023-11-19 04:12:30,568 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 68 transitions. Word has length 20 [2023-11-19 04:12:30,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:30,568 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 68 transitions. [2023-11-19 04:12:30,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:12:30,568 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 68 transitions. [2023-11-19 04:12:30,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 04:12:30,569 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:30,569 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] [2023-11-19 04:12:30,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-19 04:12:30,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:30,775 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:30,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:30,775 INFO L85 PathProgramCache]: Analyzing trace with hash -164605886, now seen corresponding path program 3 times [2023-11-19 04:12:30,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:12:30,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097353903] [2023-11-19 04:12:30,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 04:12:30,776 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-11-19 04:12:30,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:12:30,777 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:30,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:30,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-19 04:12:30,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 04:12:30,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-19 04:12:30,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:12:31,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:12:31,086 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:12:31,086 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 04:12:31,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097353903] [2023-11-19 04:12:31,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097353903] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:12:31,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:12:31,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:12:31,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989384269] [2023-11-19 04:12:31,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:12:31,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 04:12:31,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 04:12:31,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 04:12:31,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:12:31,088 INFO L87 Difference]: Start difference. First operand 42 states and 68 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:12:31,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:12:31,223 INFO L93 Difference]: Finished difference Result 52 states and 82 transitions. [2023-11-19 04:12:31,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:12:31,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-19 04:12:31,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:12:31,224 INFO L225 Difference]: With dead ends: 52 [2023-11-19 04:12:31,224 INFO L226 Difference]: Without dead ends: 30 [2023-11-19 04:12:31,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:12:31,225 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 19 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:12:31,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 12 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:12:31,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-19 04:12:31,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-19 04:12:31,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 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-11-19 04:12:31,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2023-11-19 04:12:31,227 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 20 [2023-11-19 04:12:31,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:12:31,227 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2023-11-19 04:12:31,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:12:31,228 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2023-11-19 04:12:31,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 04:12:31,228 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:12:31,228 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] [2023-11-19 04:12:31,239 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:31,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:31,432 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 04:12:31,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:12:31,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1273890636, now seen corresponding path program 4 times [2023-11-19 04:12:31,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:12:31,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145788673] [2023-11-19 04:12:31,433 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 04:12:31,433 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-11-19 04:12:31,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:12:31,435 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:31,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:31,594 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 04:12:31,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-19 04:12:31,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 04:12:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:12:31,755 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2023-11-19 04:12:31,756 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 04:12:31,757 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-19 04:12:31,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-19 04:12:31,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-19 04:12:31,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-19 04:12:31,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-19 04:12:31,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-19 04:12:31,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-19 04:12:31,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-19 04:12:31,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-19 04:12:31,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-19 04:12:31,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-19 04:12:31,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-19 04:12:31,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-19 04:12:31,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-19 04:12:31,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/mathsat -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-11-19 04:12:31,967 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-11-19 04:12:31,971 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 04:12:31,971 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 04:12:32,034 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 04:12:32,042 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 04:12:32,043 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 04:12:32,051 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-19 04:12:32,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 04:12:32 BasicIcfg [2023-11-19 04:12:32,076 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 04:12:32,076 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 04:12:32,079 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 04:12:32,079 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 04:12:32,080 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:12:15" (3/4) ... [2023-11-19 04:12:32,081 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 04:12:32,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 04:12:32,083 INFO L158 Benchmark]: Toolchain (without parser) took 18638.22ms. Allocated memory was 83.9MB in the beginning and 151.0MB in the end (delta: 67.1MB). Free memory was 59.5MB in the beginning and 66.8MB in the end (delta: -7.2MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. [2023-11-19 04:12:32,084 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 83.9MB. Free memory is still 60.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 04:12:32,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 841.00ms. Allocated memory is still 83.9MB. Free memory was 59.3MB in the beginning and 36.1MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 04:12:32,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.70ms. Allocated memory is still 83.9MB. Free memory was 36.1MB in the beginning and 62.3MB in the end (delta: -26.3MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2023-11-19 04:12:32,085 INFO L158 Benchmark]: Boogie Preprocessor took 37.88ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 60.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 04:12:32,085 INFO L158 Benchmark]: RCFGBuilder took 940.17ms. Allocated memory was 83.9MB in the beginning and 125.8MB in the end (delta: 41.9MB). Free memory was 60.1MB in the beginning and 93.9MB in the end (delta: -33.8MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2023-11-19 04:12:32,086 INFO L158 Benchmark]: TraceAbstraction took 16695.97ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 93.3MB in the beginning and 66.8MB in the end (delta: 26.5MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. [2023-11-19 04:12:32,086 INFO L158 Benchmark]: Witness Printer took 6.34ms. Allocated memory is still 151.0MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 04:12:32,088 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.29ms. Allocated memory is still 83.9MB. Free memory is still 60.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 841.00ms. Allocated memory is still 83.9MB. Free memory was 59.3MB in the beginning and 36.1MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.70ms. Allocated memory is still 83.9MB. Free memory was 36.1MB in the beginning and 62.3MB in the end (delta: -26.3MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.88ms. Allocated memory is still 83.9MB. Free memory was 62.3MB in the beginning and 60.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 940.17ms. Allocated memory was 83.9MB in the beginning and 125.8MB in the end (delta: 41.9MB). Free memory was 60.1MB in the beginning and 93.9MB in the end (delta: -33.8MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. * TraceAbstraction took 16695.97ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 93.3MB in the beginning and 66.8MB in the end (delta: 26.5MB). Peak memory consumption was 51.5MB. Max. memory is 16.1GB. * Witness Printer took 6.34ms. Allocated memory is still 151.0MB. Free memory is still 66.8MB. 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~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - 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: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.0s, 138 PlacesBefore, 42 PlacesAfterwards, 132 TransitionsBefore, 33 TransitionsAfterwards, 2834 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 3 ChoiceCompositions, 139 TotalNumberOfCompositions, 5848 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3454, independent: 3310, independent conditional: 0, independent unconditional: 3310, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2082, independent: 2028, independent conditional: 0, independent unconditional: 2028, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2082, independent: 2017, independent conditional: 0, independent unconditional: 2017, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 374, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 335, dependent conditional: 0, dependent unconditional: 335, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3454, independent: 1282, independent conditional: 0, independent unconditional: 1282, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 2082, unknown conditional: 0, unknown unconditional: 2082] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 137, Positive conditional cache size: 0, Positive unconditional cache size: 137, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1004; [L834] FCALL, FORK 0 pthread_create(&t1004, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1004={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t1005; [L836] FCALL, FORK 0 pthread_create(&t1005, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1004={-6:0}, t1005={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t1006; [L838] FCALL, FORK 0 pthread_create(&t1006, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1004={-6:0}, t1005={-10:0}, t1006={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L808] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L762] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004={-6:0}, t1005={-10:0}, t1006={-2:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix038.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 836]: 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: 834]: 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, 159 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 137 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 696 IncrementalHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 50 mSDtfsCounter, 696 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=676occurred in iteration=0, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 927 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1086 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-19 04:12:32,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04b600d2-f886-48ae-a185-153220942b0e/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample