./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30e01a73 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_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire --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 af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:29:21,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:29:21,752 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-23 21:29:21,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:29:21,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:29:21,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:29:21,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:29:21,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:29:21,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:29:21,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:29:21,820 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 21:29:21,821 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 21:29:21,822 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 21:29:21,823 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 21:29:21,824 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 21:29:21,824 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 21:29:21,825 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 21:29:21,825 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 21:29:21,825 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 21:29:21,826 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 21:29:21,826 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 21:29:21,827 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 21:29:21,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:29:21,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:29:21,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:29:21,829 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:29:21,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:29:21,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:29:21,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:29:21,831 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 21:29:21,832 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 21:29:21,833 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 21:29:21,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:29:21,833 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 21:29:21,834 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 21:29:21,834 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:29:21,834 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:29:21,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:29:21,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:29:21,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:29:21,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:29:21,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:29:21,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:29:21,836 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 21:29:21,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:29:21,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:29:21,837 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 21:29:21,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:29:21,837 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_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/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_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire 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 -> af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 [2023-11-23 21:29:22,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:29:22,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:29:22,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:29:22,161 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:29:22,161 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:29:22,163 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-11-23 21:29:25,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:29:25,590 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:29:25,590 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-11-23 21:29:25,618 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/data/c4461c05c/e1880c048c784af3befef4760dd2b55b/FLAGd939388a8 [2023-11-23 21:29:25,634 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/data/c4461c05c/e1880c048c784af3befef4760dd2b55b [2023-11-23 21:29:25,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:29:25,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:29:25,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:29:25,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:29:25,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:29:25,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:29:25" (1/1) ... [2023-11-23 21:29:25,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e636f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:25, skipping insertion in model container [2023-11-23 21:29:25,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:29:25" (1/1) ... [2023-11-23 21:29:25,710 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:29:26,178 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:29:26,193 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:29:26,287 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:29:26,324 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:29:26,324 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:29:26,332 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:29:26,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:26 WrapperNode [2023-11-23 21:29:26,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:29:26,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:29:26,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:29:26,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:29:26,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:26" (1/1) ... [2023-11-23 21:29:26,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:26" (1/1) ... [2023-11-23 21:29:26,433 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 119 [2023-11-23 21:29:26,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:29:26,435 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:29:26,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:29:26,435 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:29:26,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:26" (1/1) ... [2023-11-23 21:29:26,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:26" (1/1) ... [2023-11-23 21:29:26,453 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:26" (1/1) ... [2023-11-23 21:29:26,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:26" (1/1) ... [2023-11-23 21:29:26,468 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:26" (1/1) ... [2023-11-23 21:29:26,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:26" (1/1) ... [2023-11-23 21:29:26,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:26" (1/1) ... [2023-11-23 21:29:26,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:26" (1/1) ... [2023-11-23 21:29:26,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:29:26,504 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:29:26,504 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:29:26,505 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:29:26,505 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:26" (1/1) ... [2023-11-23 21:29:26,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:29:26,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:29:26,541 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:29:26,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:29:26,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 21:29:26,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 21:29:26,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:29:26,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:29:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:29:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-23 21:29:26,592 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-23 21:29:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-23 21:29:26,593 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-23 21:29:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 21:29:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 21:29:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:29:26,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:29:26,597 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 21:29:26,807 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:29:26,809 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:29:27,109 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:29:27,404 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:29:27,404 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 21:29:27,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:29:27 BoogieIcfgContainer [2023-11-23 21:29:27,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:29:27,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:29:27,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:29:27,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:29:27,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:29:25" (1/3) ... [2023-11-23 21:29:27,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6a022b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:29:27, skipping insertion in model container [2023-11-23 21:29:27,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:26" (2/3) ... [2023-11-23 21:29:27,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6a022b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:29:27, skipping insertion in model container [2023-11-23 21:29:27,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:29:27" (3/3) ... [2023-11-23 21:29:27,419 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-11-23 21:29:27,439 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:29:27,439 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-23 21:29:27,440 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 21:29:27,485 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 21:29:27,516 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 42 transitions, 92 flow [2023-11-23 21:29:27,629 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 965 states, 954 states have (on average 2.79769392033543) internal successors, (2669), 964 states have internal predecessors, (2669), 0 states have call successors, (0), 0 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-23 21:29:27,651 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:29:27,658 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;@65513977, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:29:27,659 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-23 21:29:27,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 965 states, 954 states have (on average 2.79769392033543) internal successors, (2669), 964 states have internal predecessors, (2669), 0 states have call successors, (0), 0 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-23 21:29:27,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-23 21:29:27,671 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:27,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-23 21:29:27,672 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 21:29:27,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:27,678 INFO L85 PathProgramCache]: Analyzing trace with hash 11697, now seen corresponding path program 1 times [2023-11-23 21:29:27,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:29:27,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987248497] [2023-11-23 21:29:27,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:29:27,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:29:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:29:28,012 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-23 21:29:28,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:29:28,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987248497] [2023-11-23 21:29:28,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987248497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:29:28,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:29:28,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:29:28,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551395257] [2023-11-23 21:29:28,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:29:28,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:29:28,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:29:28,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:29:28,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:29:28,059 INFO L87 Difference]: Start difference. First operand has 965 states, 954 states have (on average 2.79769392033543) internal successors, (2669), 964 states have internal predecessors, (2669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:28,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:29:28,177 INFO L93 Difference]: Finished difference Result 900 states and 2364 transitions. [2023-11-23 21:29:28,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:29:28,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-23 21:29:28,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:29:28,204 INFO L225 Difference]: With dead ends: 900 [2023-11-23 21:29:28,205 INFO L226 Difference]: Without dead ends: 900 [2023-11-23 21:29:28,206 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-23 21:29:28,210 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:29:28,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 21 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:29:28,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2023-11-23 21:29:28,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2023-11-23 21:29:28,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 890 states have (on average 2.656179775280899) internal successors, (2364), 899 states have internal predecessors, (2364), 0 states have call successors, (0), 0 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-23 21:29:28,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 2364 transitions. [2023-11-23 21:29:28,324 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 2364 transitions. Word has length 2 [2023-11-23 21:29:28,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:29:28,325 INFO L495 AbstractCegarLoop]: Abstraction has 900 states and 2364 transitions. [2023-11-23 21:29:28,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 2364 transitions. [2023-11-23 21:29:28,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-23 21:29:28,328 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:28,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-23 21:29:28,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:29:28,331 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 21:29:28,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:28,332 INFO L85 PathProgramCache]: Analyzing trace with hash 11698, now seen corresponding path program 1 times [2023-11-23 21:29:28,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:29:28,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175842427] [2023-11-23 21:29:28,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:29:28,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:29:28,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:29:28,536 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-23 21:29:28,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:29:28,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175842427] [2023-11-23 21:29:28,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175842427] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:29:28,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:29:28,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:29:28,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806762159] [2023-11-23 21:29:28,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:29:28,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:29:28,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:29:28,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:29:28,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:29:28,541 INFO L87 Difference]: Start difference. First operand 900 states and 2364 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:28,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:29:28,690 INFO L93 Difference]: Finished difference Result 899 states and 2363 transitions. [2023-11-23 21:29:28,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:29:28,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-23 21:29:28,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:29:28,699 INFO L225 Difference]: With dead ends: 899 [2023-11-23 21:29:28,699 INFO L226 Difference]: Without dead ends: 899 [2023-11-23 21:29:28,700 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-23 21:29:28,701 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 30 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:29:28,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 22 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:29:28,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2023-11-23 21:29:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2023-11-23 21:29:28,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 890 states have (on average 2.655056179775281) internal successors, (2363), 898 states have internal predecessors, (2363), 0 states have call successors, (0), 0 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-23 21:29:28,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 2363 transitions. [2023-11-23 21:29:28,751 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 2363 transitions. Word has length 2 [2023-11-23 21:29:28,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:29:28,751 INFO L495 AbstractCegarLoop]: Abstraction has 899 states and 2363 transitions. [2023-11-23 21:29:28,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:28,752 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 2363 transitions. [2023-11-23 21:29:28,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 21:29:28,752 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:28,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 21:29:28,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:29:28,753 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 21:29:28,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:28,754 INFO L85 PathProgramCache]: Analyzing trace with hash 348784593, now seen corresponding path program 1 times [2023-11-23 21:29:28,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:29:28,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250932721] [2023-11-23 21:29:28,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:29:28,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:29:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:29:28,964 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-23 21:29:28,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:29:28,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250932721] [2023-11-23 21:29:28,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250932721] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:29:28,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:29:28,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:29:28,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479479499] [2023-11-23 21:29:28,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:29:28,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:29:28,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:29:28,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:29:28,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:29:28,969 INFO L87 Difference]: Start difference. First operand 899 states and 2363 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:29,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:29:29,058 INFO L93 Difference]: Finished difference Result 782 states and 2039 transitions. [2023-11-23 21:29:29,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:29:29,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 21:29:29,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:29:29,065 INFO L225 Difference]: With dead ends: 782 [2023-11-23 21:29:29,066 INFO L226 Difference]: Without dead ends: 766 [2023-11-23 21:29:29,066 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-23 21:29:29,073 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:29:29,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:29:29,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2023-11-23 21:29:29,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2023-11-23 21:29:29,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 762 states have (on average 2.625984251968504) internal successors, (2001), 765 states have internal predecessors, (2001), 0 states have call successors, (0), 0 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-23 21:29:29,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 2001 transitions. [2023-11-23 21:29:29,110 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 2001 transitions. Word has length 5 [2023-11-23 21:29:29,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:29:29,110 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 2001 transitions. [2023-11-23 21:29:29,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:29,110 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 2001 transitions. [2023-11-23 21:29:29,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 21:29:29,111 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:29,111 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 21:29:29,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:29:29,112 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 21:29:29,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:29,112 INFO L85 PathProgramCache]: Analyzing trace with hash 348783347, now seen corresponding path program 1 times [2023-11-23 21:29:29,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:29:29,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057261024] [2023-11-23 21:29:29,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:29:29,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:29:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:29:29,157 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-23 21:29:29,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:29:29,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057261024] [2023-11-23 21:29:29,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057261024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:29:29,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:29:29,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:29:29,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244678824] [2023-11-23 21:29:29,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:29:29,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:29:29,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:29:29,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:29:29,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:29:29,160 INFO L87 Difference]: Start difference. First operand 766 states and 2001 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:29,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:29:29,234 INFO L93 Difference]: Finished difference Result 759 states and 1988 transitions. [2023-11-23 21:29:29,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:29:29,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 21:29:29,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:29:29,241 INFO L225 Difference]: With dead ends: 759 [2023-11-23 21:29:29,241 INFO L226 Difference]: Without dead ends: 759 [2023-11-23 21:29:29,241 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-23 21:29:29,242 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:29:29,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 24 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:29:29,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2023-11-23 21:29:29,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2023-11-23 21:29:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 756 states have (on average 2.6296296296296298) internal successors, (1988), 758 states have internal predecessors, (1988), 0 states have call successors, (0), 0 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-23 21:29:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1988 transitions. [2023-11-23 21:29:29,272 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1988 transitions. Word has length 5 [2023-11-23 21:29:29,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:29:29,272 INFO L495 AbstractCegarLoop]: Abstraction has 759 states and 1988 transitions. [2023-11-23 21:29:29,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:29,273 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1988 transitions. [2023-11-23 21:29:29,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 21:29:29,274 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:29,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 21:29:29,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:29:29,274 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 21:29:29,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:29,275 INFO L85 PathProgramCache]: Analyzing trace with hash 348783348, now seen corresponding path program 1 times [2023-11-23 21:29:29,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:29:29,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923370954] [2023-11-23 21:29:29,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:29:29,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:29:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:29:29,336 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-23 21:29:29,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:29:29,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923370954] [2023-11-23 21:29:29,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923370954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:29:29,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:29:29,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:29:29,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006421155] [2023-11-23 21:29:29,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:29:29,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:29:29,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:29:29,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:29:29,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:29:29,339 INFO L87 Difference]: Start difference. First operand 759 states and 1988 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:29,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:29:29,432 INFO L93 Difference]: Finished difference Result 752 states and 1975 transitions. [2023-11-23 21:29:29,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:29:29,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 21:29:29,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:29:29,439 INFO L225 Difference]: With dead ends: 752 [2023-11-23 21:29:29,439 INFO L226 Difference]: Without dead ends: 752 [2023-11-23 21:29:29,439 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-23 21:29:29,440 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:29:29,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 25 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:29:29,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2023-11-23 21:29:29,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2023-11-23 21:29:29,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 750 states have (on average 2.6333333333333333) internal successors, (1975), 751 states have internal predecessors, (1975), 0 states have call successors, (0), 0 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-23 21:29:29,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1975 transitions. [2023-11-23 21:29:29,469 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1975 transitions. Word has length 5 [2023-11-23 21:29:29,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:29:29,469 INFO L495 AbstractCegarLoop]: Abstraction has 752 states and 1975 transitions. [2023-11-23 21:29:29,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1975 transitions. [2023-11-23 21:29:29,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-23 21:29:29,473 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:29,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:29:29,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:29:29,474 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 21:29:29,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:29,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2029469122, now seen corresponding path program 1 times [2023-11-23 21:29:29,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:29:29,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575680017] [2023-11-23 21:29:29,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:29:29,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:29:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:29:29,817 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-23 21:29:29,820 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:29:29,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575680017] [2023-11-23 21:29:29,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575680017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:29:29,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:29:29,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:29:29,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145213110] [2023-11-23 21:29:29,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:29:29,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:29:29,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:29:29,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:29:29,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:29:29,828 INFO L87 Difference]: Start difference. First operand 752 states and 1975 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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-23 21:29:30,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:29:30,037 INFO L93 Difference]: Finished difference Result 696 states and 1822 transitions. [2023-11-23 21:29:30,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:29:30,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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-23 21:29:30,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:29:30,042 INFO L225 Difference]: With dead ends: 696 [2023-11-23 21:29:30,042 INFO L226 Difference]: Without dead ends: 584 [2023-11-23 21:29:30,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:29:30,044 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 60 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:29:30,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 94 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:29:30,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2023-11-23 21:29:30,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2023-11-23 21:29:30,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 583 states have (on average 2.600343053173242) internal successors, (1516), 583 states have internal predecessors, (1516), 0 states have call successors, (0), 0 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-23 21:29:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1516 transitions. [2023-11-23 21:29:30,066 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1516 transitions. Word has length 15 [2023-11-23 21:29:30,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:29:30,066 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 1516 transitions. [2023-11-23 21:29:30,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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-23 21:29:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1516 transitions. [2023-11-23 21:29:30,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-23 21:29:30,069 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:30,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:29:30,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 21:29:30,070 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 21:29:30,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:30,071 INFO L85 PathProgramCache]: Analyzing trace with hash 2029470521, now seen corresponding path program 1 times [2023-11-23 21:29:30,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:29:30,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872607766] [2023-11-23 21:29:30,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:29:30,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:29:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:29:30,273 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-23 21:29:30,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:29:30,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872607766] [2023-11-23 21:29:30,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872607766] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:29:30,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:29:30,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:29:30,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596345109] [2023-11-23 21:29:30,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:29:30,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:29:30,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:29:30,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:29:30,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:29:30,276 INFO L87 Difference]: Start difference. First operand 584 states and 1516 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:30,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:29:30,445 INFO L93 Difference]: Finished difference Result 591 states and 1487 transitions. [2023-11-23 21:29:30,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:29:30,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-23 21:29:30,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:29:30,450 INFO L225 Difference]: With dead ends: 591 [2023-11-23 21:29:30,450 INFO L226 Difference]: Without dead ends: 479 [2023-11-23 21:29:30,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:29:30,451 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 50 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:29:30,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 72 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:29:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2023-11-23 21:29:30,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2023-11-23 21:29:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 478 states have (on average 2.5439330543933054) internal successors, (1216), 478 states have internal predecessors, (1216), 0 states have call successors, (0), 0 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-23 21:29:30,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1216 transitions. [2023-11-23 21:29:30,469 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 1216 transitions. Word has length 15 [2023-11-23 21:29:30,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:29:30,469 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 1216 transitions. [2023-11-23 21:29:30,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:30,469 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 1216 transitions. [2023-11-23 21:29:30,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 21:29:30,471 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:30,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:29:30,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 21:29:30,471 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 21:29:30,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:30,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1080610752, now seen corresponding path program 1 times [2023-11-23 21:29:30,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:29:30,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081610714] [2023-11-23 21:29:30,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:29:30,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:29:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:29:30,608 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-23 21:29:30,608 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:29:30,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081610714] [2023-11-23 21:29:30,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081610714] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:29:30,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:29:30,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:29:30,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572572780] [2023-11-23 21:29:30,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:29:30,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:29:30,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:29:30,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:29:30,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:29:30,610 INFO L87 Difference]: Start difference. First operand 479 states and 1216 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:30,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:29:30,691 INFO L93 Difference]: Finished difference Result 370 states and 848 transitions. [2023-11-23 21:29:30,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:29:30,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-23 21:29:30,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:29:30,694 INFO L225 Difference]: With dead ends: 370 [2023-11-23 21:29:30,694 INFO L226 Difference]: Without dead ends: 314 [2023-11-23 21:29:30,695 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-23 21:29:30,695 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:29:30,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 29 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:29:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2023-11-23 21:29:30,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2023-11-23 21:29:30,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 313 states have (on average 2.303514376996805) internal successors, (721), 313 states have internal predecessors, (721), 0 states have call successors, (0), 0 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-23 21:29:30,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 721 transitions. [2023-11-23 21:29:30,706 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 721 transitions. Word has length 18 [2023-11-23 21:29:30,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:29:30,707 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 721 transitions. [2023-11-23 21:29:30,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:30,707 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 721 transitions. [2023-11-23 21:29:30,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-23 21:29:30,708 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:30,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:29:30,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 21:29:30,709 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 21:29:30,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:30,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1595607176, now seen corresponding path program 1 times [2023-11-23 21:29:30,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:29:30,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364986094] [2023-11-23 21:29:30,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:29:30,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:29:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:29:30,915 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-23 21:29:30,915 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:29:30,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364986094] [2023-11-23 21:29:30,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364986094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:29:30,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:29:30,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:29:30,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220634777] [2023-11-23 21:29:30,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:29:30,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:29:30,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:29:30,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:29:30,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:29:30,917 INFO L87 Difference]: Start difference. First operand 314 states and 721 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:30,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:29:30,997 INFO L93 Difference]: Finished difference Result 194 states and 415 transitions. [2023-11-23 21:29:30,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:29:30,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-23 21:29:30,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:29:30,999 INFO L225 Difference]: With dead ends: 194 [2023-11-23 21:29:30,999 INFO L226 Difference]: Without dead ends: 168 [2023-11-23 21:29:31,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:29:31,000 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 61 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:29:31,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 22 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:29:31,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-11-23 21:29:31,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2023-11-23 21:29:31,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 2.1317365269461077) internal successors, (356), 167 states have internal predecessors, (356), 0 states have call successors, (0), 0 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-23 21:29:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 356 transitions. [2023-11-23 21:29:31,007 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 356 transitions. Word has length 21 [2023-11-23 21:29:31,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:29:31,007 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 356 transitions. [2023-11-23 21:29:31,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:31,007 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 356 transitions. [2023-11-23 21:29:31,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 21:29:31,008 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:31,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:29:31,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 21:29:31,009 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 21:29:31,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:31,009 INFO L85 PathProgramCache]: Analyzing trace with hash -616096533, now seen corresponding path program 1 times [2023-11-23 21:29:31,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:29:31,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155864004] [2023-11-23 21:29:31,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:29:31,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:29:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:29:31,829 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-23 21:29:31,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:29:31,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155864004] [2023-11-23 21:29:31,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155864004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:29:31,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:29:31,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:29:31,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472975825] [2023-11-23 21:29:31,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:29:31,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:29:31,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:29:31,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:29:31,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:29:31,832 INFO L87 Difference]: Start difference. First operand 168 states and 356 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:32,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:29:32,085 INFO L93 Difference]: Finished difference Result 260 states and 544 transitions. [2023-11-23 21:29:32,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:29:32,086 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-23 21:29:32,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:29:32,089 INFO L225 Difference]: With dead ends: 260 [2023-11-23 21:29:32,089 INFO L226 Difference]: Without dead ends: 183 [2023-11-23 21:29:32,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-23 21:29:32,090 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:29:32,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 137 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:29:32,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-11-23 21:29:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 135. [2023-11-23 21:29:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.074626865671642) internal successors, (278), 134 states have internal predecessors, (278), 0 states have call successors, (0), 0 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-23 21:29:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 278 transitions. [2023-11-23 21:29:32,096 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 278 transitions. Word has length 26 [2023-11-23 21:29:32,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:29:32,096 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 278 transitions. [2023-11-23 21:29:32,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 278 transitions. [2023-11-23 21:29:32,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 21:29:32,098 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:32,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:29:32,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 21:29:32,098 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 21:29:32,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:32,099 INFO L85 PathProgramCache]: Analyzing trace with hash -863375415, now seen corresponding path program 2 times [2023-11-23 21:29:32,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:29:32,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126593088] [2023-11-23 21:29:32,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:29:32,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:29:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:29:32,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 21:29:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:29:32,243 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-23 21:29:32,244 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 21:29:32,245 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-23 21:29:32,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-23 21:29:32,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-23 21:29:32,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-23 21:29:32,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-23 21:29:32,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-23 21:29:32,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-23 21:29:32,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-23 21:29:32,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-23 21:29:32,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-23 21:29:32,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 21:29:32,252 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:29:32,257 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-23 21:29:32,257 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 21:29:32,298 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-23 21:29:32,301 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-23 21:29:32,320 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-23 21:29:32,329 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-23 21:29:32,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:29:32 BasicIcfg [2023-11-23 21:29:32,346 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 21:29:32,346 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 21:29:32,346 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 21:29:32,347 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 21:29:32,347 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:29:27" (3/4) ... [2023-11-23 21:29:32,349 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-23 21:29:32,350 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 21:29:32,351 INFO L158 Benchmark]: Toolchain (without parser) took 6711.92ms. Allocated memory was 163.6MB in the beginning and 245.4MB in the end (delta: 81.8MB). Free memory was 126.1MB in the beginning and 210.3MB in the end (delta: -84.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:29:32,351 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 115.3MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:29:32,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 693.53ms. Allocated memory is still 163.6MB. Free memory was 125.8MB in the beginning and 121.8MB in the end (delta: 4.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-23 21:29:32,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.33ms. Allocated memory is still 163.6MB. Free memory was 121.8MB in the beginning and 119.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 21:29:32,352 INFO L158 Benchmark]: Boogie Preprocessor took 68.76ms. Allocated memory is still 163.6MB. Free memory was 119.4MB in the beginning and 117.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 21:29:32,352 INFO L158 Benchmark]: RCFGBuilder took 900.95ms. Allocated memory is still 163.6MB. Free memory was 117.3MB in the beginning and 132.3MB in the end (delta: -15.0MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2023-11-23 21:29:32,353 INFO L158 Benchmark]: TraceAbstraction took 4934.28ms. Allocated memory was 163.6MB in the beginning and 245.4MB in the end (delta: 81.8MB). Free memory was 131.5MB in the beginning and 210.3MB in the end (delta: -78.7MB). Peak memory consumption was 143.0MB. Max. memory is 16.1GB. [2023-11-23 21:29:32,354 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 245.4MB. Free memory is still 210.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:29:32,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.30ms. Allocated memory is still 115.3MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 693.53ms. Allocated memory is still 163.6MB. Free memory was 125.8MB in the beginning and 121.8MB in the end (delta: 4.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.33ms. Allocated memory is still 163.6MB. Free memory was 121.8MB in the beginning and 119.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.76ms. Allocated memory is still 163.6MB. Free memory was 119.4MB in the beginning and 117.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 900.95ms. Allocated memory is still 163.6MB. Free memory was 117.3MB in the beginning and 132.3MB in the end (delta: -15.0MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4934.28ms. Allocated memory was 163.6MB in the beginning and 245.4MB in the end (delta: 81.8MB). Free memory was 131.5MB in the beginning and 210.3MB in the end (delta: -78.7MB). Peak memory consumption was 143.0MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 245.4MB. Free memory is still 210.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L721] 0 _Bool y$flush_delayed; [L722] 0 int y$mem_tmp; [L723] 0 _Bool y$r_buff0_thd0; [L724] 0 _Bool y$r_buff0_thd1; [L725] 0 _Bool y$r_buff0_thd2; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$read_delayed; [L730] 0 int *y$read_delayed_var; [L731] 0 int y$w_buff0; [L732] 0 _Bool y$w_buff0_used; [L733] 0 int y$w_buff1; [L734] 0 _Bool y$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L812] 0 pthread_t t305; [L813] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L740] 1 y$w_buff1 = y$w_buff0 [L741] 1 y$w_buff0 = 1 [L742] 1 y$w_buff1_used = y$w_buff0_used [L743] 1 y$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L745] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L746] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L747] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L814] 0 pthread_t t306; [L815] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t305={5:0}, t306={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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L768] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L771] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 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) [L779] 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)) [L780] 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)) [L781] 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)) [L782] 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)) [L783] 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)) [L784] 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)) [L785] 2 __unbuffered_p1_EBX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] 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) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L830] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L17] 0 __assert_fail ("0", "mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] - 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: 810]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 815]: 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: 813]: 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 5 procedures, 59 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 373 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 373 mSDsluCounter, 478 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 307 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 675 IncrementalHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 171 mSDtfsCounter, 675 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=965occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 48 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 607 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-23 21:29:32,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire --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 af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:29:35,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:29:35,259 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-11-23 21:29:35,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:29:35,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:29:35,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:29:35,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:29:35,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:29:35,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:29:35,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:29:35,322 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 21:29:35,322 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 21:29:35,323 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 21:29:35,324 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 21:29:35,325 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 21:29:35,325 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 21:29:35,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:29:35,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:29:35,328 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:29:35,329 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:29:35,329 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:29:35,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:29:35,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:29:35,331 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 21:29:35,331 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 21:29:35,331 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 21:29:35,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:29:35,332 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 21:29:35,333 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 21:29:35,333 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 21:29:35,335 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 21:29:35,335 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:29:35,335 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:29:35,336 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:29:35,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:29:35,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:29:35,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:29:35,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:29:35,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:29:35,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:29:35,338 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-23 21:29:35,342 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 21:29:35,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:29:35,342 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 21:29:35,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:29:35,343 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_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/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_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire 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 -> af189c8870b49f611aa022222cf968f0c789441d4d4f9926444b1aa8c8dc68d1 [2023-11-23 21:29:35,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:29:35,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:29:35,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:29:35,803 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:29:35,804 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:29:35,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-11-23 21:29:38,951 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:29:39,339 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:29:39,343 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/sv-benchmarks/c/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-11-23 21:29:39,364 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/data/1e61a3096/8435720d9201497ab70da5a8a8d61287/FLAGaf96836f0 [2023-11-23 21:29:39,379 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/data/1e61a3096/8435720d9201497ab70da5a8a8d61287 [2023-11-23 21:29:39,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:29:39,383 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:29:39,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:29:39,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:29:39,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:29:39,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:29:39" (1/1) ... [2023-11-23 21:29:39,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd908b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:39, skipping insertion in model container [2023-11-23 21:29:39,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:29:39" (1/1) ... [2023-11-23 21:29:39,452 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:29:40,000 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:29:40,020 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:29:40,105 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:29:40,185 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:29:40,186 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:29:40,194 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:29:40,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40 WrapperNode [2023-11-23 21:29:40,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:29:40,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:29:40,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:29:40,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:29:40,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40" (1/1) ... [2023-11-23 21:29:40,232 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40" (1/1) ... [2023-11-23 21:29:40,279 INFO L138 Inliner]: procedures = 178, calls = 44, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 120 [2023-11-23 21:29:40,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:29:40,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:29:40,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:29:40,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:29:40,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40" (1/1) ... [2023-11-23 21:29:40,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40" (1/1) ... [2023-11-23 21:29:40,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40" (1/1) ... [2023-11-23 21:29:40,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40" (1/1) ... [2023-11-23 21:29:40,321 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40" (1/1) ... [2023-11-23 21:29:40,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40" (1/1) ... [2023-11-23 21:29:40,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40" (1/1) ... [2023-11-23 21:29:40,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40" (1/1) ... [2023-11-23 21:29:40,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:29:40,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:29:40,361 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:29:40,361 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:29:40,362 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40" (1/1) ... [2023-11-23 21:29:40,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:29:40,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:29:40,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:29:40,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:29:40,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 21:29:40,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:29:40,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:29:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:29:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-23 21:29:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-23 21:29:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-23 21:29:40,452 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-23 21:29:40,452 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-23 21:29:40,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-23 21:29:40,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 21:29:40,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:29:40,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:29:40,455 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 21:29:40,678 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:29:40,680 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:29:41,025 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:29:41,382 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:29:41,382 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 21:29:41,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:29:41 BoogieIcfgContainer [2023-11-23 21:29:41,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:29:41,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:29:41,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:29:41,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:29:41,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:29:39" (1/3) ... [2023-11-23 21:29:41,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae7e76a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:29:41, skipping insertion in model container [2023-11-23 21:29:41,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:29:40" (2/3) ... [2023-11-23 21:29:41,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae7e76a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:29:41, skipping insertion in model container [2023-11-23 21:29:41,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:29:41" (3/3) ... [2023-11-23 21:29:41,395 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2023-11-23 21:29:41,415 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:29:41,415 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-23 21:29:41,416 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 21:29:41,487 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 21:29:41,524 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 42 transitions, 92 flow [2023-11-23 21:29:41,624 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 965 states, 954 states have (on average 2.79769392033543) internal successors, (2669), 964 states have internal predecessors, (2669), 0 states have call successors, (0), 0 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-23 21:29:41,649 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:29:41,658 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;@6b1e9344, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:29:41,658 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-23 21:29:41,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 965 states, 954 states have (on average 2.79769392033543) internal successors, (2669), 964 states have internal predecessors, (2669), 0 states have call successors, (0), 0 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-23 21:29:41,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-23 21:29:41,671 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:41,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-23 21:29:41,673 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 21:29:41,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:41,680 INFO L85 PathProgramCache]: Analyzing trace with hash 11761, now seen corresponding path program 1 times [2023-11-23 21:29:41,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 21:29:41,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016208660] [2023-11-23 21:29:41,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:29:41,698 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-23 21:29:41,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 21:29:41,701 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:41,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:29:41,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 21:29:41,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:29:41,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-23 21:29:41,918 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-23 21:29:41,918 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:29:41,919 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 21:29:41,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016208660] [2023-11-23 21:29:41,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016208660] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:29:41,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:29:41,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:29:41,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543193321] [2023-11-23 21:29:41,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:29:41,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:29:41,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 21:29:41,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:29:41,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:29:41,971 INFO L87 Difference]: Start difference. First operand has 965 states, 954 states have (on average 2.79769392033543) internal successors, (2669), 964 states have internal predecessors, (2669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:42,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:29:42,147 INFO L93 Difference]: Finished difference Result 900 states and 2364 transitions. [2023-11-23 21:29:42,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:29:42,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-23 21:29:42,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:29:42,180 INFO L225 Difference]: With dead ends: 900 [2023-11-23 21:29:42,181 INFO L226 Difference]: Without dead ends: 900 [2023-11-23 21:29:42,182 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-23 21:29:42,186 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:29:42,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 21 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:29:42,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2023-11-23 21:29:42,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2023-11-23 21:29:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 890 states have (on average 2.656179775280899) internal successors, (2364), 899 states have internal predecessors, (2364), 0 states have call successors, (0), 0 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-23 21:29:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 2364 transitions. [2023-11-23 21:29:42,316 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 2364 transitions. Word has length 2 [2023-11-23 21:29:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:29:42,316 INFO L495 AbstractCegarLoop]: Abstraction has 900 states and 2364 transitions. [2023-11-23 21:29:42,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:42,318 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 2364 transitions. [2023-11-23 21:29:42,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-23 21:29:42,319 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:42,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-23 21:29:42,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-23 21:29:42,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:42,522 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 21:29:42,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:42,523 INFO L85 PathProgramCache]: Analyzing trace with hash 11762, now seen corresponding path program 1 times [2023-11-23 21:29:42,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 21:29:42,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711311887] [2023-11-23 21:29:42,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:29:42,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:29:42,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 21:29:42,527 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:42,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:29:42,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 21:29:42,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:29:42,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 21:29:42,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:29:42,649 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:29:42,649 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 21:29:42,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711311887] [2023-11-23 21:29:42,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711311887] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:29:42,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:29:42,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:29:42,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454062513] [2023-11-23 21:29:42,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:29:42,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:29:42,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 21:29:42,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:29:42,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:29:42,658 INFO L87 Difference]: Start difference. First operand 900 states and 2364 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:42,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:29:42,784 INFO L93 Difference]: Finished difference Result 899 states and 2363 transitions. [2023-11-23 21:29:42,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:29:42,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-23 21:29:42,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:29:42,793 INFO L225 Difference]: With dead ends: 899 [2023-11-23 21:29:42,794 INFO L226 Difference]: Without dead ends: 899 [2023-11-23 21:29:42,794 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-23 21:29:42,797 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 30 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:29:42,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 22 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:29:42,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2023-11-23 21:29:42,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2023-11-23 21:29:42,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 890 states have (on average 2.655056179775281) internal successors, (2363), 898 states have internal predecessors, (2363), 0 states have call successors, (0), 0 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-23 21:29:42,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 2363 transitions. [2023-11-23 21:29:42,840 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 2363 transitions. Word has length 2 [2023-11-23 21:29:42,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:29:42,841 INFO L495 AbstractCegarLoop]: Abstraction has 899 states and 2363 transitions. [2023-11-23 21:29:42,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:42,841 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 2363 transitions. [2023-11-23 21:29:42,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 21:29:42,842 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:42,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 21:29:42,846 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-23 21:29:43,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:43,045 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 21:29:43,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:43,046 INFO L85 PathProgramCache]: Analyzing trace with hash 350693203, now seen corresponding path program 1 times [2023-11-23 21:29:43,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 21:29:43,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38648943] [2023-11-23 21:29:43,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:29:43,047 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-23 21:29:43,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 21:29:43,048 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:43,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:29:43,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 21:29:43,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:29:43,151 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-23 21:29:43,151 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:29:43,151 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 21:29:43,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38648943] [2023-11-23 21:29:43,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38648943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:29:43,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:29:43,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:29:43,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540772627] [2023-11-23 21:29:43,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:29:43,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:29:43,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 21:29:43,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:29:43,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:29:43,154 INFO L87 Difference]: Start difference. First operand 899 states and 2363 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:43,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:29:43,228 INFO L93 Difference]: Finished difference Result 782 states and 2039 transitions. [2023-11-23 21:29:43,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:29:43,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 21:29:43,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:29:43,236 INFO L225 Difference]: With dead ends: 782 [2023-11-23 21:29:43,236 INFO L226 Difference]: Without dead ends: 766 [2023-11-23 21:29:43,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:29:43,237 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:29:43,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:29:43,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2023-11-23 21:29:43,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2023-11-23 21:29:43,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 762 states have (on average 2.625984251968504) internal successors, (2001), 765 states have internal predecessors, (2001), 0 states have call successors, (0), 0 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-23 21:29:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 2001 transitions. [2023-11-23 21:29:43,269 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 2001 transitions. Word has length 5 [2023-11-23 21:29:43,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:29:43,270 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 2001 transitions. [2023-11-23 21:29:43,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 2001 transitions. [2023-11-23 21:29:43,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 21:29:43,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:43,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 21:29:43,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-23 21:29:43,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:43,473 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 21:29:43,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:43,474 INFO L85 PathProgramCache]: Analyzing trace with hash 350691957, now seen corresponding path program 1 times [2023-11-23 21:29:43,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 21:29:43,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133711235] [2023-11-23 21:29:43,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:29:43,475 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-23 21:29:43,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 21:29:43,476 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:43,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:29:43,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 21:29:43,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:29:43,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-23 21:29:43,586 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-23 21:29:43,586 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:29:43,586 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 21:29:43,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133711235] [2023-11-23 21:29:43,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133711235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:29:43,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:29:43,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:29:43,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581563101] [2023-11-23 21:29:43,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:29:43,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:29:43,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 21:29:43,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:29:43,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:29:43,596 INFO L87 Difference]: Start difference. First operand 766 states and 2001 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:43,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:29:43,702 INFO L93 Difference]: Finished difference Result 759 states and 1988 transitions. [2023-11-23 21:29:43,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:29:43,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 21:29:43,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:29:43,710 INFO L225 Difference]: With dead ends: 759 [2023-11-23 21:29:43,710 INFO L226 Difference]: Without dead ends: 759 [2023-11-23 21:29:43,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:29:43,712 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:29:43,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 24 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:29:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2023-11-23 21:29:43,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2023-11-23 21:29:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 756 states have (on average 2.6296296296296298) internal successors, (1988), 758 states have internal predecessors, (1988), 0 states have call successors, (0), 0 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-23 21:29:43,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1988 transitions. [2023-11-23 21:29:43,749 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1988 transitions. Word has length 5 [2023-11-23 21:29:43,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:29:43,750 INFO L495 AbstractCegarLoop]: Abstraction has 759 states and 1988 transitions. [2023-11-23 21:29:43,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:43,750 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1988 transitions. [2023-11-23 21:29:43,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 21:29:43,751 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:43,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 21:29:43,759 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-23 21:29:43,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:43,953 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 21:29:43,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:43,954 INFO L85 PathProgramCache]: Analyzing trace with hash 350691958, now seen corresponding path program 1 times [2023-11-23 21:29:43,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 21:29:43,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493465216] [2023-11-23 21:29:43,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:29:43,955 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-23 21:29:43,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 21:29:43,956 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:43,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:29:44,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 21:29:44,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:29:44,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 21:29:44,058 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-23 21:29:44,058 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:29:44,058 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 21:29:44,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493465216] [2023-11-23 21:29:44,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493465216] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:29:44,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:29:44,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:29:44,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297782653] [2023-11-23 21:29:44,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:29:44,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:29:44,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 21:29:44,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:29:44,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:29:44,061 INFO L87 Difference]: Start difference. First operand 759 states and 1988 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:44,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:29:44,136 INFO L93 Difference]: Finished difference Result 752 states and 1975 transitions. [2023-11-23 21:29:44,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:29:44,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 21:29:44,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:29:44,143 INFO L225 Difference]: With dead ends: 752 [2023-11-23 21:29:44,143 INFO L226 Difference]: Without dead ends: 752 [2023-11-23 21:29:44,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:29:44,144 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:29:44,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 25 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:29:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2023-11-23 21:29:44,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 752. [2023-11-23 21:29:44,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 750 states have (on average 2.6333333333333333) internal successors, (1975), 751 states have internal predecessors, (1975), 0 states have call successors, (0), 0 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-23 21:29:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1975 transitions. [2023-11-23 21:29:44,173 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1975 transitions. Word has length 5 [2023-11-23 21:29:44,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:29:44,173 INFO L495 AbstractCegarLoop]: Abstraction has 752 states and 1975 transitions. [2023-11-23 21:29:44,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:44,173 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1975 transitions. [2023-11-23 21:29:44,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-23 21:29:44,176 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:44,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:29:44,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-23 21:29:44,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:44,379 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 21:29:44,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:44,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1422771204, now seen corresponding path program 1 times [2023-11-23 21:29:44,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 21:29:44,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450158138] [2023-11-23 21:29:44,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:29:44,380 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-23 21:29:44,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 21:29:44,382 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:44,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:29:44,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 21:29:44,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:29:44,515 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-23 21:29:44,515 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:29:44,515 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 21:29:44,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450158138] [2023-11-23 21:29:44,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450158138] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:29:44,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:29:44,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:29:44,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811465502] [2023-11-23 21:29:44,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:29:44,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:29:44,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 21:29:44,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:29:44,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:29:44,518 INFO L87 Difference]: Start difference. First operand 752 states and 1975 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:44,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:29:44,618 INFO L93 Difference]: Finished difference Result 478 states and 1112 transitions. [2023-11-23 21:29:44,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:29:44,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-23 21:29:44,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:29:44,622 INFO L225 Difference]: With dead ends: 478 [2023-11-23 21:29:44,623 INFO L226 Difference]: Without dead ends: 422 [2023-11-23 21:29:44,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:29:44,624 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:29:44,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 35 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:29:44,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-11-23 21:29:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2023-11-23 21:29:44,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 420 states have (on average 2.3452380952380953) internal successors, (985), 421 states have internal predecessors, (985), 0 states have call successors, (0), 0 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-23 21:29:44,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 985 transitions. [2023-11-23 21:29:44,640 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 985 transitions. Word has length 15 [2023-11-23 21:29:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:29:44,641 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 985 transitions. [2023-11-23 21:29:44,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 985 transitions. [2023-11-23 21:29:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-23 21:29:44,643 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:44,644 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-23 21:29:44,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:44,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:44,847 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 21:29:44,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:44,847 INFO L85 PathProgramCache]: Analyzing trace with hash -813864971, now seen corresponding path program 1 times [2023-11-23 21:29:44,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 21:29:44,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594810037] [2023-11-23 21:29:44,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:29:44,848 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-23 21:29:44,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 21:29:44,849 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:44,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:29:44,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 21:29:44,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:29:45,026 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-23 21:29:45,026 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:29:45,027 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 21:29:45,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594810037] [2023-11-23 21:29:45,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594810037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:29:45,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:29:45,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:29:45,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858576167] [2023-11-23 21:29:45,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:29:45,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:29:45,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 21:29:45,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:29:45,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:29:45,030 INFO L87 Difference]: Start difference. First operand 422 states and 985 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:45,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:29:45,148 INFO L93 Difference]: Finished difference Result 206 states and 439 transitions. [2023-11-23 21:29:45,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:29:45,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-23 21:29:45,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:29:45,150 INFO L225 Difference]: With dead ends: 206 [2023-11-23 21:29:45,151 INFO L226 Difference]: Without dead ends: 180 [2023-11-23 21:29:45,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:29:45,152 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 58 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:29:45,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 46 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:29:45,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-23 21:29:45,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2023-11-23 21:29:45,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 178 states have (on average 2.134831460674157) internal successors, (380), 179 states have internal predecessors, (380), 0 states have call successors, (0), 0 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-23 21:29:45,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 380 transitions. [2023-11-23 21:29:45,160 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 380 transitions. Word has length 20 [2023-11-23 21:29:45,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:29:45,160 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 380 transitions. [2023-11-23 21:29:45,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:45,161 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 380 transitions. [2023-11-23 21:29:45,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 21:29:45,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:45,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:29:45,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-23 21:29:45,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:45,365 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 21:29:45,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:45,366 INFO L85 PathProgramCache]: Analyzing trace with hash -838321484, now seen corresponding path program 1 times [2023-11-23 21:29:45,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 21:29:45,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733087249] [2023-11-23 21:29:45,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:29:45,367 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-23 21:29:45,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 21:29:45,368 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:45,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:29:45,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-23 21:29:45,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:29:45,900 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t306~0#1.base_47| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t305~0#1.base_51| (_ BitVec 32))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t305~0#1.base_51| (_ bv0 1)) |v_ULTIMATE.start_main_~#t306~0#1.base_47| (_ bv0 1))) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t305~0#1.base_51| (_ bv1 1)) |v_ULTIMATE.start_main_~#t306~0#1.base_47|) (_ bv0 1)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t305~0#1.base_51|)))) is different from true [2023-11-23 21:29:45,902 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-23 21:29:45,902 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:29:45,902 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 21:29:45,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733087249] [2023-11-23 21:29:45,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733087249] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:29:45,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:29:45,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:29:45,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512839444] [2023-11-23 21:29:45,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:29:45,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:29:45,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 21:29:45,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:29:45,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-23 21:29:45,905 INFO L87 Difference]: Start difference. First operand 180 states and 380 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:46,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:29:46,003 INFO L93 Difference]: Finished difference Result 182 states and 379 transitions. [2023-11-23 21:29:46,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:29:46,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-23 21:29:46,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:29:46,006 INFO L225 Difference]: With dead ends: 182 [2023-11-23 21:29:46,006 INFO L226 Difference]: Without dead ends: 180 [2023-11-23 21:29:46,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-23 21:29:46,007 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:29:46,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 31 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 46 Unchecked, 0.1s Time] [2023-11-23 21:29:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-23 21:29:46,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2023-11-23 21:29:46,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 178 states have (on average 2.106741573033708) internal successors, (375), 179 states have internal predecessors, (375), 0 states have call successors, (0), 0 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-23 21:29:46,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 375 transitions. [2023-11-23 21:29:46,015 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 375 transitions. Word has length 26 [2023-11-23 21:29:46,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:29:46,016 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 375 transitions. [2023-11-23 21:29:46,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:46,016 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 375 transitions. [2023-11-23 21:29:46,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 21:29:46,017 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:46,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:29:46,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:46,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:46,222 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 21:29:46,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:46,223 INFO L85 PathProgramCache]: Analyzing trace with hash -838320085, now seen corresponding path program 1 times [2023-11-23 21:29:46,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 21:29:46,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138882805] [2023-11-23 21:29:46,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:29:46,224 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-23 21:29:46,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 21:29:46,225 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:46,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:29:46,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-23 21:29:46,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:29:46,616 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-23 21:29:46,616 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:29:46,617 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-23 21:29:46,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138882805] [2023-11-23 21:29:46,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138882805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:29:46,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:29:46,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:29:46,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772076814] [2023-11-23 21:29:46,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:29:46,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 21:29:46,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-23 21:29:46,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 21:29:46,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:29:46,620 INFO L87 Difference]: Start difference. First operand 180 states and 375 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:46,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:29:46,892 INFO L93 Difference]: Finished difference Result 236 states and 480 transitions. [2023-11-23 21:29:46,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 21:29:46,893 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-23 21:29:46,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:29:46,895 INFO L225 Difference]: With dead ends: 236 [2023-11-23 21:29:46,895 INFO L226 Difference]: Without dead ends: 229 [2023-11-23 21:29:46,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-23 21:29:46,896 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 64 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:29:46,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 131 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:29:46,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-11-23 21:29:46,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 217. [2023-11-23 21:29:46,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 215 states have (on average 2.0651162790697675) internal successors, (444), 216 states have internal predecessors, (444), 0 states have call successors, (0), 0 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-23 21:29:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 444 transitions. [2023-11-23 21:29:46,906 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 444 transitions. Word has length 26 [2023-11-23 21:29:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:29:46,907 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 444 transitions. [2023-11-23 21:29:46,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:29:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 444 transitions. [2023-11-23 21:29:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-23 21:29:46,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:29:46,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:29:46,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:47,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:47,112 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-23 21:29:47,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:29:47,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1085598967, now seen corresponding path program 2 times [2023-11-23 21:29:47,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-23 21:29:47,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400459652] [2023-11-23 21:29:47,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 21:29:47,114 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-23 21:29:47,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat [2023-11-23 21:29:47,118 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:47,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:47,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-23 21:29:47,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-23 21:29:47,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 21:29:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:29:47,383 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2023-11-23 21:29:47,383 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 21:29:47,384 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-23 21:29:47,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-23 21:29:47,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-23 21:29:47,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-23 21:29:47,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-23 21:29:47,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-23 21:29:47,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-23 21:29:47,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-23 21:29:47,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-23 21:29:47,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-23 21:29:47,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:47,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/mathsat -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-23 21:29:47,591 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:29:47,595 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-23 21:29:47,596 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 21:29:47,642 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-23 21:29:47,645 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-23 21:29:47,654 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-23 21:29:47,657 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-23 21:29:47,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:29:47 BasicIcfg [2023-11-23 21:29:47,667 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 21:29:47,668 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 21:29:47,668 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 21:29:47,668 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 21:29:47,669 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:29:41" (3/4) ... [2023-11-23 21:29:47,670 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-23 21:29:47,671 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 21:29:47,672 INFO L158 Benchmark]: Toolchain (without parser) took 8289.06ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 79.5MB in the beginning and 35.4MB in the end (delta: 44.1MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. [2023-11-23 21:29:47,673 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 77.6MB. Free memory is still 54.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:29:47,673 INFO L158 Benchmark]: CACSL2BoogieTranslator took 810.57ms. Allocated memory is still 104.9MB. Free memory was 79.3MB in the beginning and 79.2MB in the end (delta: 16.1kB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2023-11-23 21:29:47,673 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.36ms. Allocated memory is still 104.9MB. Free memory was 79.2MB in the beginning and 76.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 21:29:47,674 INFO L158 Benchmark]: Boogie Preprocessor took 79.11ms. Allocated memory is still 104.9MB. Free memory was 76.8MB in the beginning and 74.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 21:29:47,674 INFO L158 Benchmark]: RCFGBuilder took 1022.40ms. Allocated memory is still 104.9MB. Free memory was 74.7MB in the beginning and 73.9MB in the end (delta: 771.3kB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2023-11-23 21:29:47,675 INFO L158 Benchmark]: TraceAbstraction took 6282.46ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 73.4MB in the beginning and 35.4MB in the end (delta: 38.0MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. [2023-11-23 21:29:47,675 INFO L158 Benchmark]: Witness Printer took 3.86ms. Allocated memory is still 125.8MB. Free memory is still 35.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:29:47,677 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 77.6MB. Free memory is still 54.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 810.57ms. Allocated memory is still 104.9MB. Free memory was 79.3MB in the beginning and 79.2MB in the end (delta: 16.1kB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.36ms. Allocated memory is still 104.9MB. Free memory was 79.2MB in the beginning and 76.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.11ms. Allocated memory is still 104.9MB. Free memory was 76.8MB in the beginning and 74.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1022.40ms. Allocated memory is still 104.9MB. Free memory was 74.7MB in the beginning and 73.9MB in the end (delta: 771.3kB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6282.46ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 73.4MB in the beginning and 35.4MB in the end (delta: 38.0MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. * Witness Printer took 3.86ms. Allocated memory is still 125.8MB. Free memory is still 35.4MB. 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: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L721] 0 _Bool y$flush_delayed; [L722] 0 int y$mem_tmp; [L723] 0 _Bool y$r_buff0_thd0; [L724] 0 _Bool y$r_buff0_thd1; [L725] 0 _Bool y$r_buff0_thd2; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$read_delayed; [L730] 0 int *y$read_delayed_var; [L731] 0 int y$w_buff0; [L732] 0 _Bool y$w_buff0_used; [L733] 0 int y$w_buff1; [L734] 0 _Bool y$w_buff1_used; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L812] 0 pthread_t t305; [L813] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L740] 1 y$w_buff1 = y$w_buff0 [L741] 1 y$w_buff0 = 1 [L742] 1 y$w_buff1_used = y$w_buff0_used [L743] 1 y$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L745] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L746] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L747] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L814] 0 pthread_t t306; [L815] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t305={3:0}, t306={7: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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L768] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L771] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 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) [L779] 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)) [L780] 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)) [L781] 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)) [L782] 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)) [L783] 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)) [L784] 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)) [L785] 2 __unbuffered_p1_EBX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={3:0}, t306={7:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] 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) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={3:0}, t306={7:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={3:0}, t306={7:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L830] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L17] 0 __assert_fail ("0", "mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] - 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: 810]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: 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: 815]: 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 5 procedures, 59 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 311 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 311 mSDsluCounter, 367 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 46 IncrementalHoareTripleChecker+Unchecked, 218 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 508 IncrementalHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 149 mSDtfsCounter, 508 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=965occurred in iteration=0, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 97 ConstructedInterpolants, 1 QuantifiedInterpolants, 822 SizeOfPredicates, 5 NumberOfNonLiveVariables, 786 ConjunctsInSsa, 47 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-23 21:29:47,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf3c641f-8213-4150-ade7-ef1cea292372/bin/utaipan-verify-mE87zJ7Ire/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