./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix009.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix009.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f715026b68e9c0bb30969d2f1713e0cf615763357ccfdf3c82e016d450119958 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:46:53,626 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:46:53,748 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-19 04:46:53,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:46:53,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:46:53,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:46:53,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:46:53,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:46:53,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:46:53,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:46:53,806 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:46:53,807 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:46:53,808 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:46:53,810 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 04:46:53,810 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:46:53,811 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:46:53,812 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 04:46:53,812 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 04:46:53,813 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:46:53,813 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 04:46:53,814 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 04:46:53,815 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 04:46:53,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 04:46:53,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 04:46:53,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:46:53,818 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:46:53,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:46:53,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:46:53,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:46:53,820 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 04:46:53,822 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 04:46:53,822 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 04:46:53,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:46:53,823 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 04:46:53,823 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 04:46:53,824 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:46:53,824 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:46:53,824 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:46:53,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:46:53,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:46:53,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:46:53,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:46:53,826 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 04:46:53,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 04:46:53,827 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:46:53,827 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:46:53,827 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_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f715026b68e9c0bb30969d2f1713e0cf615763357ccfdf3c82e016d450119958 [2023-11-19 04:46:54,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:46:54,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:46:54,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:46:54,203 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:46:54,205 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:46:54,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread-wmm/mix009.opt.i [2023-11-19 04:46:57,367 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:46:57,724 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:46:57,725 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/sv-benchmarks/c/pthread-wmm/mix009.opt.i [2023-11-19 04:46:57,741 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/data/46277190a/80a3eab1d22b4ee0927100839046fbba/FLAGdf1c98a1c [2023-11-19 04:46:57,755 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/data/46277190a/80a3eab1d22b4ee0927100839046fbba [2023-11-19 04:46:57,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:46:57,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:46:57,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:46:57,761 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:46:57,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:46:57,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:46:57" (1/1) ... [2023-11-19 04:46:57,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6769190a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:57, skipping insertion in model container [2023-11-19 04:46:57,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:46:57" (1/1) ... [2023-11-19 04:46:57,828 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:46:58,362 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:46:58,376 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:46:58,470 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:46:58,515 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:46:58,515 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:46:58,523 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:46:58,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:58 WrapperNode [2023-11-19 04:46:58,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:46:58,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:46:58,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:46:58,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:46:58,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:58" (1/1) ... [2023-11-19 04:46:58,567 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:58" (1/1) ... [2023-11-19 04:46:58,613 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 141 [2023-11-19 04:46:58,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:46:58,614 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:46:58,614 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:46:58,614 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:46:58,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:58" (1/1) ... [2023-11-19 04:46:58,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:58" (1/1) ... [2023-11-19 04:46:58,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:58" (1/1) ... [2023-11-19 04:46:58,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:58" (1/1) ... [2023-11-19 04:46:58,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:58" (1/1) ... [2023-11-19 04:46:58,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:58" (1/1) ... [2023-11-19 04:46:58,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:58" (1/1) ... [2023-11-19 04:46:58,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:58" (1/1) ... [2023-11-19 04:46:58,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:46:58,680 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:46:58,680 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:46:58,680 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:46:58,681 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:58" (1/1) ... [2023-11-19 04:46:58,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:46:58,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:46:58,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:46:58,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:46:58,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 04:46:58,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 04:46:58,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:46:58,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:46:58,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:46:58,761 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 04:46:58,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 04:46:58,763 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 04:46:58,763 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 04:46:58,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 04:46:58,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 04:46:58,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:46:58,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:46:58,766 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 04:46:58,954 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:46:58,956 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:46:59,324 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:46:59,557 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:46:59,558 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 04:46:59,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:46:59 BoogieIcfgContainer [2023-11-19 04:46:59,563 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:46:59,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:46:59,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:46:59,594 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:46:59,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:46:57" (1/3) ... [2023-11-19 04:46:59,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa45e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:46:59, skipping insertion in model container [2023-11-19 04:46:59,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:46:58" (2/3) ... [2023-11-19 04:46:59,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa45e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:46:59, skipping insertion in model container [2023-11-19 04:46:59,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:46:59" (3/3) ... [2023-11-19 04:46:59,599 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.opt.i [2023-11-19 04:46:59,620 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:46:59,620 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-19 04:46:59,620 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 04:46:59,695 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 04:46:59,739 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:46:59,769 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 112 transitions, 232 flow [2023-11-19 04:46:59,775 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 112 transitions, 232 flow [2023-11-19 04:46:59,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 112 transitions, 232 flow [2023-11-19 04:46:59,868 INFO L124 PetriNetUnfolderBase]: 5/110 cut-off events. [2023-11-19 04:46:59,868 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 04:46:59,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 110 events. 5/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 70. Up to 3 conditions per place. [2023-11-19 04:46:59,879 INFO L119 LiptonReduction]: Number of co-enabled transitions 1920 [2023-11-19 04:47:05,104 INFO L134 LiptonReduction]: Checked pairs total: 4132 [2023-11-19 04:47:05,105 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-11-19 04:47:05,114 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 28 transitions, 64 flow [2023-11-19 04:47:05,152 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 244 states, 235 states have (on average 2.7702127659574467) internal successors, (651), 243 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:05,172 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:47:05,179 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;@2ad4139c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:47:05,179 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-19 04:47:05,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 244 states, 235 states have (on average 2.7702127659574467) internal successors, (651), 243 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:05,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2023-11-19 04:47:05,192 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:05,193 INFO L195 NwaCegarLoop]: trace histogram [1] [2023-11-19 04:47:05,193 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:47:05,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:05,201 INFO L85 PathProgramCache]: Analyzing trace with hash 550, now seen corresponding path program 1 times [2023-11-19 04:47:05,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:05,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426672236] [2023-11-19 04:47:05,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:05,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:05,351 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:05,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426672236] [2023-11-19 04:47:05,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426672236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:05,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:05,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 04:47:05,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032380221] [2023-11-19 04:47:05,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:05,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 04:47:05,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:05,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 04:47:05,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:47:05,400 INFO L87 Difference]: Start difference. First operand has 244 states, 235 states have (on average 2.7702127659574467) internal successors, (651), 243 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:05,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:05,500 INFO L93 Difference]: Finished difference Result 232 states and 566 transitions. [2023-11-19 04:47:05,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 04:47:05,502 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2023-11-19 04:47:05,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:05,522 INFO L225 Difference]: With dead ends: 232 [2023-11-19 04:47:05,522 INFO L226 Difference]: Without dead ends: 232 [2023-11-19 04:47:05,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:47:05,529 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:05,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:47:05,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-11-19 04:47:05,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2023-11-19 04:47:05,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 227 states have (on average 2.4933920704845813) internal successors, (566), 231 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:05,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 566 transitions. [2023-11-19 04:47:05,590 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 566 transitions. Word has length 1 [2023-11-19 04:47:05,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:05,591 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 566 transitions. [2023-11-19 04:47:05,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:05,591 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 566 transitions. [2023-11-19 04:47:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 04:47:05,592 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:05,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 04:47:05,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 04:47:05,592 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:47:05,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:05,593 INFO L85 PathProgramCache]: Analyzing trace with hash 521116889, now seen corresponding path program 1 times [2023-11-19 04:47:05,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:05,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043343754] [2023-11-19 04:47:05,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:05,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:06,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:06,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043343754] [2023-11-19 04:47:06,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043343754] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:06,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:06,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:47:06,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145262410] [2023-11-19 04:47:06,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:06,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:47:06,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:06,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:47:06,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:47:06,022 INFO L87 Difference]: Start difference. First operand 232 states and 566 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-19 04:47:06,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:06,121 INFO L93 Difference]: Finished difference Result 197 states and 473 transitions. [2023-11-19 04:47:06,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:47:06,121 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-19 04:47:06,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:06,125 INFO L225 Difference]: With dead ends: 197 [2023-11-19 04:47:06,126 INFO L226 Difference]: Without dead ends: 192 [2023-11-19 04:47:06,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:47:06,128 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:06,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:47:06,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-11-19 04:47:06,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2023-11-19 04:47:06,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 2.442105263157895) internal successors, (464), 191 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 464 transitions. [2023-11-19 04:47:06,160 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 464 transitions. Word has length 5 [2023-11-19 04:47:06,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:06,161 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 464 transitions. [2023-11-19 04:47:06,161 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-19 04:47:06,161 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 464 transitions. [2023-11-19 04:47:06,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-19 04:47:06,163 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:06,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:06,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 04:47:06,164 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:47:06,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:06,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1717746608, now seen corresponding path program 1 times [2023-11-19 04:47:06,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:06,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484920195] [2023-11-19 04:47:06,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:06,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:06,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:06,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:06,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484920195] [2023-11-19 04:47:06,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484920195] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:06,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:06,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:47:06,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495173256] [2023-11-19 04:47:06,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:06,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:47:06,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:06,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:47:06,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:47:06,376 INFO L87 Difference]: Start difference. First operand 192 states and 464 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:06,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:06,451 INFO L93 Difference]: Finished difference Result 240 states and 560 transitions. [2023-11-19 04:47:06,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:47:06,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-19 04:47:06,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:06,455 INFO L225 Difference]: With dead ends: 240 [2023-11-19 04:47:06,455 INFO L226 Difference]: Without dead ends: 240 [2023-11-19 04:47:06,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:47:06,458 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 7 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:06,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:47:06,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-11-19 04:47:06,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 188. [2023-11-19 04:47:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 186 states have (on average 2.4301075268817205) internal successors, (452), 187 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 452 transitions. [2023-11-19 04:47:06,472 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 452 transitions. Word has length 7 [2023-11-19 04:47:06,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:06,473 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 452 transitions. [2023-11-19 04:47:06,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:06,473 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 452 transitions. [2023-11-19 04:47:06,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 04:47:06,474 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:06,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:06,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 04:47:06,475 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:47:06,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:06,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1710536784, now seen corresponding path program 1 times [2023-11-19 04:47:06,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:06,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849099701] [2023-11-19 04:47:06,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:06,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:06,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:06,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849099701] [2023-11-19 04:47:06,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849099701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:06,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:06,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:47:06,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706837737] [2023-11-19 04:47:06,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:06,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:47:06,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:06,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:47:06,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:47:06,735 INFO L87 Difference]: Start difference. First operand 188 states and 452 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:06,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:06,825 INFO L93 Difference]: Finished difference Result 269 states and 630 transitions. [2023-11-19 04:47:06,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:47:06,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-19 04:47:06,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:06,829 INFO L225 Difference]: With dead ends: 269 [2023-11-19 04:47:06,829 INFO L226 Difference]: Without dead ends: 239 [2023-11-19 04:47:06,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:47:06,832 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 11 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:06,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 3 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:47:06,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-11-19 04:47:06,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 221. [2023-11-19 04:47:06,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 219 states have (on average 2.3926940639269407) internal successors, (524), 220 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:06,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 524 transitions. [2023-11-19 04:47:06,845 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 524 transitions. Word has length 8 [2023-11-19 04:47:06,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:06,846 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 524 transitions. [2023-11-19 04:47:06,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 524 transitions. [2023-11-19 04:47:06,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 04:47:06,847 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:06,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:06,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 04:47:06,848 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:47:06,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:06,848 INFO L85 PathProgramCache]: Analyzing trace with hash -273801866, now seen corresponding path program 1 times [2023-11-19 04:47:06,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:06,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543847477] [2023-11-19 04:47:06,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:06,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:07,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:07,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:07,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543847477] [2023-11-19 04:47:07,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543847477] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:07,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:07,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:47:07,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757506] [2023-11-19 04:47:07,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:07,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:47:07,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:07,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:47:07,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:47:07,074 INFO L87 Difference]: Start difference. First operand 221 states and 524 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:07,154 INFO L93 Difference]: Finished difference Result 239 states and 548 transitions. [2023-11-19 04:47:07,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:47:07,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-19 04:47:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:07,157 INFO L225 Difference]: With dead ends: 239 [2023-11-19 04:47:07,157 INFO L226 Difference]: Without dead ends: 239 [2023-11-19 04:47:07,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:47:07,158 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:07,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 2 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:47:07,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-11-19 04:47:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 215. [2023-11-19 04:47:07,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 213 states have (on average 2.356807511737089) internal successors, (502), 214 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:07,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 502 transitions. [2023-11-19 04:47:07,169 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 502 transitions. Word has length 9 [2023-11-19 04:47:07,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:07,169 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 502 transitions. [2023-11-19 04:47:07,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:07,170 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 502 transitions. [2023-11-19 04:47:07,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 04:47:07,171 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:07,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:07,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 04:47:07,171 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:47:07,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:07,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1569769948, now seen corresponding path program 1 times [2023-11-19 04:47:07,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:07,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138318409] [2023-11-19 04:47:07,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:07,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:07,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:07,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:07,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138318409] [2023-11-19 04:47:07,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138318409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:07,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:07,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:47:07,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630585910] [2023-11-19 04:47:07,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:07,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:47:07,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:07,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:47:07,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:47:07,355 INFO L87 Difference]: Start difference. First operand 215 states and 502 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:07,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:07,454 INFO L93 Difference]: Finished difference Result 239 states and 542 transitions. [2023-11-19 04:47:07,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:47:07,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-19 04:47:07,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:07,456 INFO L225 Difference]: With dead ends: 239 [2023-11-19 04:47:07,456 INFO L226 Difference]: Without dead ends: 239 [2023-11-19 04:47:07,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:47:07,457 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:07,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:47:07,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-11-19 04:47:07,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 207. [2023-11-19 04:47:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 205 states have (on average 2.341463414634146) internal successors, (480), 206 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:07,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 480 transitions. [2023-11-19 04:47:07,467 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 480 transitions. Word has length 9 [2023-11-19 04:47:07,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:07,468 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 480 transitions. [2023-11-19 04:47:07,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:07,468 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 480 transitions. [2023-11-19 04:47:07,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 04:47:07,469 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:07,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:07,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 04:47:07,470 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:47:07,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:07,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1169672534, now seen corresponding path program 1 times [2023-11-19 04:47:07,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:07,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142232289] [2023-11-19 04:47:07,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:07,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:07,634 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:07,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142232289] [2023-11-19 04:47:07,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142232289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:07,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:07,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 04:47:07,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155392406] [2023-11-19 04:47:07,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:07,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:47:07,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:07,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:47:07,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:47:07,636 INFO L87 Difference]: Start difference. First operand 207 states and 480 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:07,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:07,699 INFO L93 Difference]: Finished difference Result 189 states and 435 transitions. [2023-11-19 04:47:07,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:47:07,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-19 04:47:07,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:07,702 INFO L225 Difference]: With dead ends: 189 [2023-11-19 04:47:07,702 INFO L226 Difference]: Without dead ends: 171 [2023-11-19 04:47:07,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:47:07,703 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:07,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:47:07,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-11-19 04:47:07,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 114. [2023-11-19 04:47:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 2.265486725663717) internal successors, (256), 113 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 256 transitions. [2023-11-19 04:47:07,709 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 256 transitions. Word has length 10 [2023-11-19 04:47:07,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:07,710 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 256 transitions. [2023-11-19 04:47:07,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 256 transitions. [2023-11-19 04:47:07,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 04:47:07,711 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:07,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:07,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 04:47:07,711 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:47:07,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:07,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1213309494, now seen corresponding path program 1 times [2023-11-19 04:47:07,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:07,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715658417] [2023-11-19 04:47:07,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:07,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:07,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:07,935 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:07,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715658417] [2023-11-19 04:47:07,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715658417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:07,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:07,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:47:07,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116496745] [2023-11-19 04:47:07,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:07,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:47:07,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:07,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:47:07,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:47:07,938 INFO L87 Difference]: Start difference. First operand 114 states and 256 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:08,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:08,039 INFO L93 Difference]: Finished difference Result 98 states and 187 transitions. [2023-11-19 04:47:08,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:47:08,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-19 04:47:08,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:08,042 INFO L225 Difference]: With dead ends: 98 [2023-11-19 04:47:08,042 INFO L226 Difference]: Without dead ends: 68 [2023-11-19 04:47:08,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:47:08,043 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:08,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 5 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:47:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-19 04:47:08,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-19 04:47:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.7611940298507462) internal successors, (118), 67 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:08,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 118 transitions. [2023-11-19 04:47:08,047 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 118 transitions. Word has length 11 [2023-11-19 04:47:08,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:08,047 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 118 transitions. [2023-11-19 04:47:08,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:08,048 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 118 transitions. [2023-11-19 04:47:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 04:47:08,048 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:08,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:08,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 04:47:08,049 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:47:08,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:08,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1299798997, now seen corresponding path program 1 times [2023-11-19 04:47:08,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:08,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008720500] [2023-11-19 04:47:08,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:08,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:08,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:08,307 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:08,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008720500] [2023-11-19 04:47:08,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008720500] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:08,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:08,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:47:08,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445549374] [2023-11-19 04:47:08,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:08,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:47:08,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:08,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:47:08,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:47:08,310 INFO L87 Difference]: Start difference. First operand 68 states and 118 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:08,410 INFO L93 Difference]: Finished difference Result 55 states and 90 transitions. [2023-11-19 04:47:08,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:47:08,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-19 04:47:08,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:08,411 INFO L225 Difference]: With dead ends: 55 [2023-11-19 04:47:08,411 INFO L226 Difference]: Without dead ends: 45 [2023-11-19 04:47:08,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:47:08,412 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:08,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 5 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:47:08,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-19 04:47:08,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-11-19 04:47:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 44 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2023-11-19 04:47:08,415 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 13 [2023-11-19 04:47:08,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:08,415 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2023-11-19 04:47:08,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:08,415 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2023-11-19 04:47:08,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 04:47:08,416 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:08,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:08,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 04:47:08,416 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:47:08,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:08,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1994472589, now seen corresponding path program 1 times [2023-11-19 04:47:08,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:08,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118284397] [2023-11-19 04:47:08,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:08,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:08,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:08,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:08,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118284397] [2023-11-19 04:47:08,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118284397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:08,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:08,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:47:08,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293233980] [2023-11-19 04:47:08,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:08,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:47:08,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:08,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:47:08,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:47:08,682 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:08,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:08,758 INFO L93 Difference]: Finished difference Result 59 states and 91 transitions. [2023-11-19 04:47:08,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:47:08,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2023-11-19 04:47:08,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:08,759 INFO L225 Difference]: With dead ends: 59 [2023-11-19 04:47:08,759 INFO L226 Difference]: Without dead ends: 25 [2023-11-19 04:47:08,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:47:08,760 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:08,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:47:08,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-19 04:47:08,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-19 04:47:08,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:08,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2023-11-19 04:47:08,762 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2023-11-19 04:47:08,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:08,763 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2023-11-19 04:47:08,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:08,763 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2023-11-19 04:47:08,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 04:47:08,764 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:08,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:08,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 04:47:08,764 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:47:08,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:08,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1450801229, now seen corresponding path program 2 times [2023-11-19 04:47:08,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:08,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112991063] [2023-11-19 04:47:08,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:08,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:11,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:11,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 04:47:11,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112991063] [2023-11-19 04:47:11,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112991063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:11,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:11,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 04:47:11,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366487339] [2023-11-19 04:47:11,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:11,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 04:47:11,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 04:47:11,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 04:47:11,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-19 04:47:11,023 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:11,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:11,293 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2023-11-19 04:47:11,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 04:47:11,293 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2023-11-19 04:47:11,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:11,294 INFO L225 Difference]: With dead ends: 31 [2023-11-19 04:47:11,294 INFO L226 Difference]: Without dead ends: 19 [2023-11-19 04:47:11,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-19 04:47:11,295 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:11,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 5 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:47:11,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-19 04:47:11,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-19 04:47:11,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2023-11-19 04:47:11,297 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2023-11-19 04:47:11,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:11,297 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2023-11-19 04:47:11,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:11,297 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2023-11-19 04:47:11,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 04:47:11,298 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:11,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:11,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 04:47:11,298 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:47:11,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:11,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1645586961, now seen corresponding path program 3 times [2023-11-19 04:47:11,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 04:47:11,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027628775] [2023-11-19 04:47:11,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:11,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 04:47:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:47:11,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 04:47:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:47:11,408 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-19 04:47:11,409 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 04:47:11,410 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-19 04:47:11,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-19 04:47:11,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-19 04:47:11,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-19 04:47:11,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-19 04:47:11,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-19 04:47:11,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-19 04:47:11,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-19 04:47:11,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-19 04:47:11,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-19 04:47:11,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 04:47:11,416 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:11,421 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 04:47:11,421 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 04:47:11,473 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 04:47:11,477 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 04:47:11,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 04:47:11 BasicIcfg [2023-11-19 04:47:11,506 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 04:47:11,506 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 04:47:11,506 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 04:47:11,506 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 04:47:11,507 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:46:59" (3/4) ... [2023-11-19 04:47:11,509 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 04:47:11,510 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 04:47:11,511 INFO L158 Benchmark]: Toolchain (without parser) took 13751.89ms. Allocated memory was 157.3MB in the beginning and 276.8MB in the end (delta: 119.5MB). Free memory was 94.7MB in the beginning and 156.0MB in the end (delta: -61.3MB). Peak memory consumption was 61.0MB. Max. memory is 16.1GB. [2023-11-19 04:47:11,512 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 123.7MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 04:47:11,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 763.10ms. Allocated memory is still 157.3MB. Free memory was 94.6MB in the beginning and 113.6MB in the end (delta: -19.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 04:47:11,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.61ms. Allocated memory is still 157.3MB. Free memory was 113.6MB in the beginning and 110.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 04:47:11,513 INFO L158 Benchmark]: Boogie Preprocessor took 65.26ms. Allocated memory is still 157.3MB. Free memory was 110.5MB in the beginning and 108.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 04:47:11,514 INFO L158 Benchmark]: RCFGBuilder took 883.59ms. Allocated memory is still 157.3MB. Free memory was 108.4MB in the beginning and 123.1MB in the end (delta: -14.7MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2023-11-19 04:47:11,514 INFO L158 Benchmark]: TraceAbstraction took 11915.61ms. Allocated memory was 157.3MB in the beginning and 276.8MB in the end (delta: 119.5MB). Free memory was 125.0MB in the beginning and 157.1MB in the end (delta: -32.1MB). Peak memory consumption was 86.4MB. Max. memory is 16.1GB. [2023-11-19 04:47:11,515 INFO L158 Benchmark]: Witness Printer took 4.56ms. Allocated memory is still 276.8MB. Free memory was 157.1MB in the beginning and 156.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 04:47:11,518 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.21ms. Allocated memory is still 123.7MB. Free memory is still 96.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 763.10ms. Allocated memory is still 157.3MB. Free memory was 94.6MB in the beginning and 113.6MB in the end (delta: -19.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.61ms. Allocated memory is still 157.3MB. Free memory was 113.6MB in the beginning and 110.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.26ms. Allocated memory is still 157.3MB. Free memory was 110.5MB in the beginning and 108.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 883.59ms. Allocated memory is still 157.3MB. Free memory was 108.4MB in the beginning and 123.1MB in the end (delta: -14.7MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. * TraceAbstraction took 11915.61ms. Allocated memory was 157.3MB in the beginning and 276.8MB in the end (delta: 119.5MB). Free memory was 125.0MB in the beginning and 157.1MB in the end (delta: -32.1MB). Peak memory consumption was 86.4MB. Max. memory is 16.1GB. * Witness Printer took 4.56ms. Allocated memory is still 276.8MB. Free memory was 157.1MB in the beginning and 156.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 114 PlacesBefore, 33 PlacesAfterwards, 112 TransitionsBefore, 28 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 3 ChoiceCompositions, 125 TotalNumberOfCompositions, 4132 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2661, independent: 2524, independent conditional: 0, independent unconditional: 2524, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1411, independent: 1373, independent conditional: 0, independent unconditional: 1373, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1411, independent: 1335, independent conditional: 0, independent unconditional: 1335, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 76, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 546, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 466, dependent conditional: 0, dependent unconditional: 466, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2661, independent: 1151, independent conditional: 0, independent unconditional: 1151, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 1411, unknown conditional: 0, unknown unconditional: 1411] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L831] 0 pthread_t t243; [L832] FCALL, FORK 0 pthread_create(&t243, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t243={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, z=0] [L833] 0 pthread_t t244; [L834] FCALL, FORK 0 pthread_create(&t244, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t243={5:0}, t244={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, z=0] [L779] 2 y$w_buff1 = y$w_buff0 [L780] 2 y$w_buff0 = 1 [L781] 2 y$w_buff1_used = y$w_buff0_used [L782] 2 y$w_buff0_used = (_Bool)1 [L783] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L783] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L784] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L785] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L786] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L787] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=0] [L790] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 2 y$flush_delayed = weak$$choice2 [L793] 2 y$mem_tmp = y [L794] 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) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 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)) [L799] 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)) [L800] 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)) [L801] 2 __unbuffered_p1_EAX = y [L802] 2 y = y$flush_delayed ? y$mem_tmp : y [L803] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=0] [L806] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L748] 1 x = 1 [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EBX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L809] 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) [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] 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 [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] 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=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L772] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 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) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 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 [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243={5:0}, t244={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix009.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] - UnprovableResult [Line: 18]: 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: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 832]: 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, 130 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 141 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 539 IncrementalHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 15 mSDtfsCounter, 539 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=0, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 183 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 1260 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-19 04:47:11,560 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix009.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f715026b68e9c0bb30969d2f1713e0cf615763357ccfdf3c82e016d450119958 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 04:47:14,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 04:47:14,330 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-11-19 04:47:14,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 04:47:14,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 04:47:14,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 04:47:14,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 04:47:14,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 04:47:14,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 04:47:14,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 04:47:14,402 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 04:47:14,402 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 04:47:14,403 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 04:47:14,405 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 04:47:14,405 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 04:47:14,406 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 04:47:14,407 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 04:47:14,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 04:47:14,408 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 04:47:14,410 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 04:47:14,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 04:47:14,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 04:47:14,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 04:47:14,412 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 04:47:14,413 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 04:47:14,413 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 04:47:14,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 04:47:14,414 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 04:47:14,415 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 04:47:14,415 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 04:47:14,417 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 04:47:14,417 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 04:47:14,418 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 04:47:14,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 04:47:14,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 04:47:14,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 04:47:14,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:47:14,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 04:47:14,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 04:47:14,421 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-19 04:47:14,421 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 04:47:14,422 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 04:47:14,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 04:47:14,422 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_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f715026b68e9c0bb30969d2f1713e0cf615763357ccfdf3c82e016d450119958 [2023-11-19 04:47:14,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 04:47:14,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 04:47:14,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 04:47:14,872 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 04:47:14,873 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 04:47:14,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/pthread-wmm/mix009.opt.i [2023-11-19 04:47:18,185 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 04:47:18,530 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 04:47:18,531 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/sv-benchmarks/c/pthread-wmm/mix009.opt.i [2023-11-19 04:47:18,554 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/data/f4a4c9d44/fdc603a0f2f949cead83f29ffdeceae0/FLAG6299fefc3 [2023-11-19 04:47:18,569 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/data/f4a4c9d44/fdc603a0f2f949cead83f29ffdeceae0 [2023-11-19 04:47:18,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 04:47:18,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 04:47:18,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 04:47:18,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 04:47:18,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 04:47:18,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:47:18" (1/1) ... [2023-11-19 04:47:18,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aa4466a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:18, skipping insertion in model container [2023-11-19 04:47:18,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 04:47:18" (1/1) ... [2023-11-19 04:47:18,638 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 04:47:19,226 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:47:19,274 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 04:47:19,369 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 04:47:19,425 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:47:19,425 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 04:47:19,433 INFO L206 MainTranslator]: Completed translation [2023-11-19 04:47:19,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:19 WrapperNode [2023-11-19 04:47:19,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 04:47:19,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 04:47:19,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 04:47:19,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 04:47:19,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:19" (1/1) ... [2023-11-19 04:47:19,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:19" (1/1) ... [2023-11-19 04:47:19,533 INFO L138 Inliner]: procedures = 178, calls = 48, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 142 [2023-11-19 04:47:19,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 04:47:19,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 04:47:19,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 04:47:19,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 04:47:19,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:19" (1/1) ... [2023-11-19 04:47:19,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:19" (1/1) ... [2023-11-19 04:47:19,561 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:19" (1/1) ... [2023-11-19 04:47:19,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:19" (1/1) ... [2023-11-19 04:47:19,577 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:19" (1/1) ... [2023-11-19 04:47:19,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:19" (1/1) ... [2023-11-19 04:47:19,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:19" (1/1) ... [2023-11-19 04:47:19,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:19" (1/1) ... [2023-11-19 04:47:19,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 04:47:19,613 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 04:47:19,613 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 04:47:19,613 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 04:47:19,614 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:19" (1/1) ... [2023-11-19 04:47:19,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 04:47:19,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 04:47:19,643 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 04:47:19,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 04:47:19,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 04:47:19,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 04:47:19,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 04:47:19,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 04:47:19,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-19 04:47:19,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 04:47:19,686 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 04:47:19,686 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 04:47:19,687 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 04:47:19,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 04:47:19,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 04:47:19,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 04:47:19,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 04:47:19,691 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 04:47:19,897 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 04:47:19,899 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 04:47:20,310 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 04:47:20,507 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 04:47:20,507 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 04:47:20,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:47:20 BoogieIcfgContainer [2023-11-19 04:47:20,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 04:47:20,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 04:47:20,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 04:47:20,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 04:47:20,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 04:47:18" (1/3) ... [2023-11-19 04:47:20,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400a44bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:47:20, skipping insertion in model container [2023-11-19 04:47:20,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 04:47:19" (2/3) ... [2023-11-19 04:47:20,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@400a44bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 04:47:20, skipping insertion in model container [2023-11-19 04:47:20,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:47:20" (3/3) ... [2023-11-19 04:47:20,521 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.opt.i [2023-11-19 04:47:20,541 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 04:47:20,542 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-19 04:47:20,542 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 04:47:20,606 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 04:47:20,648 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-19 04:47:20,664 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 113 transitions, 234 flow [2023-11-19 04:47:20,667 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 113 transitions, 234 flow [2023-11-19 04:47:20,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 113 transitions, 234 flow [2023-11-19 04:47:20,723 INFO L124 PetriNetUnfolderBase]: 5/111 cut-off events. [2023-11-19 04:47:20,723 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 04:47:20,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 111 events. 5/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 70. Up to 3 conditions per place. [2023-11-19 04:47:20,743 INFO L119 LiptonReduction]: Number of co-enabled transitions 1920 [2023-11-19 04:47:28,520 INFO L134 LiptonReduction]: Checked pairs total: 4130 [2023-11-19 04:47:28,521 INFO L136 LiptonReduction]: Total number of compositions: 126 [2023-11-19 04:47:28,529 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 28 transitions, 64 flow [2023-11-19 04:47:28,565 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 244 states, 235 states have (on average 2.7702127659574467) internal successors, (651), 243 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:28,584 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 04:47:28,590 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;@3204641a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 04:47:28,591 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-19 04:47:28,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 244 states, 235 states have (on average 2.7702127659574467) internal successors, (651), 243 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:28,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2023-11-19 04:47:28,599 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:28,600 INFO L195 NwaCegarLoop]: trace histogram [1] [2023-11-19 04:47:28,600 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:47:28,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:28,606 INFO L85 PathProgramCache]: Analyzing trace with hash 552, now seen corresponding path program 1 times [2023-11-19 04:47:28,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:47:28,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821173857] [2023-11-19 04:47:28,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:28,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 04:47:28,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:47:28,623 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 04:47:28,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-19 04:47:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:28,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-19 04:47:28,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:47:28,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:28,729 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:47:28,730 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 04:47:28,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821173857] [2023-11-19 04:47:28,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821173857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:28,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:28,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 04:47:28,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340518853] [2023-11-19 04:47:28,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:28,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 04:47:28,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 04:47:28,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 04:47:28,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:47:28,770 INFO L87 Difference]: Start difference. First operand has 244 states, 235 states have (on average 2.7702127659574467) internal successors, (651), 243 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:28,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:28,879 INFO L93 Difference]: Finished difference Result 232 states and 566 transitions. [2023-11-19 04:47:28,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 04:47:28,882 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2023-11-19 04:47:28,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:28,894 INFO L225 Difference]: With dead ends: 232 [2023-11-19 04:47:28,894 INFO L226 Difference]: Without dead ends: 232 [2023-11-19 04:47:28,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 04:47:28,898 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:28,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:47:28,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-11-19 04:47:28,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2023-11-19 04:47:28,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 227 states have (on average 2.4933920704845813) internal successors, (566), 231 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 566 transitions. [2023-11-19 04:47:28,952 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 566 transitions. Word has length 1 [2023-11-19 04:47:28,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:28,952 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 566 transitions. [2023-11-19 04:47:28,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:28,953 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 566 transitions. [2023-11-19 04:47:28,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 04:47:28,953 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:28,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 04:47:28,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-19 04:47:29,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 04:47:29,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:47:29,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:29,157 INFO L85 PathProgramCache]: Analyzing trace with hash 521173652, now seen corresponding path program 1 times [2023-11-19 04:47:29,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:47:29,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604143010] [2023-11-19 04:47:29,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:29,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 04:47:29,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:47:29,160 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 04:47:29,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-19 04:47:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:29,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 04:47:29,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:47:29,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:29,300 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:47:29,300 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 04:47:29,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604143010] [2023-11-19 04:47:29,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604143010] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:29,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:29,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 04:47:29,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966320321] [2023-11-19 04:47:29,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:29,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 04:47:29,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 04:47:29,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 04:47:29,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 04:47:29,307 INFO L87 Difference]: Start difference. First operand 232 states and 566 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-19 04:47:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:29,419 INFO L93 Difference]: Finished difference Result 197 states and 473 transitions. [2023-11-19 04:47:29,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 04:47:29,422 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-19 04:47:29,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:29,425 INFO L225 Difference]: With dead ends: 197 [2023-11-19 04:47:29,425 INFO L226 Difference]: Without dead ends: 192 [2023-11-19 04:47:29,426 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-19 04:47:29,427 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:29,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:47:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2023-11-19 04:47:29,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2023-11-19 04:47:29,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 190 states have (on average 2.442105263157895) internal successors, (464), 191 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 464 transitions. [2023-11-19 04:47:29,447 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 464 transitions. Word has length 5 [2023-11-19 04:47:29,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:29,448 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 464 transitions. [2023-11-19 04:47:29,448 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-19 04:47:29,448 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 464 transitions. [2023-11-19 04:47:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-19 04:47:29,449 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:29,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:29,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-19 04:47:29,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 04:47:29,652 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:47:29,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:29,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1663209889, now seen corresponding path program 1 times [2023-11-19 04:47:29,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:47:29,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695311615] [2023-11-19 04:47:29,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:29,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 04:47:29,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:47:29,656 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 04:47:29,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-19 04:47:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:29,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 04:47:29,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:47:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:29,879 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:47:29,880 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 04:47:29,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695311615] [2023-11-19 04:47:29,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695311615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:29,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:29,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:47:29,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241014334] [2023-11-19 04:47:29,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:29,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:47:29,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 04:47:29,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:47:29,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:47:29,885 INFO L87 Difference]: Start difference. First operand 192 states and 464 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:30,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:30,041 INFO L93 Difference]: Finished difference Result 122 states and 233 transitions. [2023-11-19 04:47:30,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 04:47:30,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-19 04:47:30,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:30,044 INFO L225 Difference]: With dead ends: 122 [2023-11-19 04:47:30,044 INFO L226 Difference]: Without dead ends: 92 [2023-11-19 04:47:30,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:47:30,046 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 26 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:30,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 8 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:47:30,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-19 04:47:30,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-11-19 04:47:30,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 90 states have (on average 1.8222222222222222) internal successors, (164), 91 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 164 transitions. [2023-11-19 04:47:30,059 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 164 transitions. Word has length 7 [2023-11-19 04:47:30,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:30,060 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 164 transitions. [2023-11-19 04:47:30,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 164 transitions. [2023-11-19 04:47:30,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 04:47:30,062 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:30,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:30,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-19 04:47:30,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 04:47:30,264 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:47:30,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:30,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1849779904, now seen corresponding path program 1 times [2023-11-19 04:47:30,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:47:30,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24402809] [2023-11-19 04:47:30,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:30,266 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 04:47:30,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:47:30,268 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 04:47:30,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-19 04:47:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:30,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 04:47:30,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:47:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:30,452 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:47:30,452 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 04:47:30,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24402809] [2023-11-19 04:47:30,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24402809] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:30,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:30,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 04:47:30,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212944923] [2023-11-19 04:47:30,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:30,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 04:47:30,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 04:47:30,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 04:47:30,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:47:30,457 INFO L87 Difference]: Start difference. First operand 92 states and 164 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:30,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:30,637 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2023-11-19 04:47:30,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 04:47:30,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-19 04:47:30,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:30,639 INFO L225 Difference]: With dead ends: 57 [2023-11-19 04:47:30,639 INFO L226 Difference]: Without dead ends: 47 [2023-11-19 04:47:30,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 04:47:30,641 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 23 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:30,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 12 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:47:30,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-19 04:47:30,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-11-19 04:47:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 46 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 74 transitions. [2023-11-19 04:47:30,646 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 74 transitions. Word has length 11 [2023-11-19 04:47:30,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:30,647 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 74 transitions. [2023-11-19 04:47:30,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:30,647 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 74 transitions. [2023-11-19 04:47:30,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 04:47:30,648 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:30,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:30,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-19 04:47:30,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 04:47:30,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:47:30,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:30,852 INFO L85 PathProgramCache]: Analyzing trace with hash 284895186, now seen corresponding path program 1 times [2023-11-19 04:47:30,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:47:30,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656465934] [2023-11-19 04:47:30,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 04:47:30,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 04:47:30,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:47:30,854 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 04:47:30,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-19 04:47:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 04:47:30,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 04:47:30,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:47:31,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:31,045 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:47:31,046 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 04:47:31,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656465934] [2023-11-19 04:47:31,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [656465934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:31,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:31,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 04:47:31,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198330795] [2023-11-19 04:47:31,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:31,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 04:47:31,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 04:47:31,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 04:47:31,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 04:47:31,052 INFO L87 Difference]: Start difference. First operand 47 states and 74 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:31,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:31,172 INFO L93 Difference]: Finished difference Result 63 states and 95 transitions. [2023-11-19 04:47:31,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 04:47:31,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2023-11-19 04:47:31,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:31,178 INFO L225 Difference]: With dead ends: 63 [2023-11-19 04:47:31,178 INFO L226 Difference]: Without dead ends: 63 [2023-11-19 04:47:31,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 04:47:31,179 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:31,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 3 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 04:47:31,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-19 04:47:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2023-11-19 04:47:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.5932203389830508) internal successors, (94), 60 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:31,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 94 transitions. [2023-11-19 04:47:31,191 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 94 transitions. Word has length 16 [2023-11-19 04:47:31,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:31,192 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 94 transitions. [2023-11-19 04:47:31,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:31,192 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 94 transitions. [2023-11-19 04:47:31,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 04:47:31,194 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:31,195 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:31,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-19 04:47:31,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 04:47:31,395 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:47:31,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:31,396 INFO L85 PathProgramCache]: Analyzing trace with hash -367902924, now seen corresponding path program 2 times [2023-11-19 04:47:31,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:47:31,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542860943] [2023-11-19 04:47:31,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 04:47:31,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 04:47:31,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:47:31,398 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 04:47:31,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-19 04:47:31,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-19 04:47:31,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 04:47:31,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-19 04:47:31,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 04:47:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 04:47:32,476 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 04:47:32,476 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-19 04:47:32,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542860943] [2023-11-19 04:47:32,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542860943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 04:47:32,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 04:47:32,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 04:47:32,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560887344] [2023-11-19 04:47:32,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 04:47:32,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 04:47:32,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-19 04:47:32,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 04:47:32,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 04:47:32,479 INFO L87 Difference]: Start difference. First operand 61 states and 94 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:32,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 04:47:32,736 INFO L93 Difference]: Finished difference Result 75 states and 109 transitions. [2023-11-19 04:47:32,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 04:47:32,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2023-11-19 04:47:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 04:47:32,738 INFO L225 Difference]: With dead ends: 75 [2023-11-19 04:47:32,738 INFO L226 Difference]: Without dead ends: 75 [2023-11-19 04:47:32,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-19 04:47:32,739 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 04:47:32,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 10 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 04:47:32,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-19 04:47:32,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2023-11-19 04:47:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.6) internal successors, (88), 56 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 88 transitions. [2023-11-19 04:47:32,745 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 88 transitions. Word has length 16 [2023-11-19 04:47:32,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 04:47:32,746 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 88 transitions. [2023-11-19 04:47:32,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 04:47:32,747 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 88 transitions. [2023-11-19 04:47:32,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 04:47:32,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 04:47:32,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 04:47:32,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-19 04:47:32,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 04:47:32,952 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 04:47:32,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 04:47:32,952 INFO L85 PathProgramCache]: Analyzing trace with hash -296811916, now seen corresponding path program 3 times [2023-11-19 04:47:32,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-19 04:47:32,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322288944] [2023-11-19 04:47:32,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 04:47:32,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 04:47:32,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat [2023-11-19 04:47:32,954 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-19 04:47:32,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-19 04:47:33,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-19 04:47:33,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-19 04:47:33,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 04:47:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 04:47:33,203 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2023-11-19 04:47:33,203 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 04:47:33,205 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-19 04:47:33,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-19 04:47:33,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-19 04:47:33,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-19 04:47:33,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-19 04:47:33,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-19 04:47:33,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-19 04:47:33,208 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-19 04:47:33,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-19 04:47:33,209 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-19 04:47:33,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-19 04:47:33,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-19 04:47:33,415 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2023-11-19 04:47:33,420 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 04:47:33,420 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 04:47:33,461 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 04:47:33,463 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 04:47:33,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 04:47:33 BasicIcfg [2023-11-19 04:47:33,480 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 04:47:33,481 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 04:47:33,481 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 04:47:33,482 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 04:47:33,482 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 04:47:20" (3/4) ... [2023-11-19 04:47:33,484 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 04:47:33,485 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 04:47:33,486 INFO L158 Benchmark]: Toolchain (without parser) took 14912.71ms. Allocated memory was 79.7MB in the beginning and 172.0MB in the end (delta: 92.3MB). Free memory was 54.8MB in the beginning and 116.2MB in the end (delta: -61.5MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2023-11-19 04:47:33,487 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 62.9MB. Free memory is still 39.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 04:47:33,487 INFO L158 Benchmark]: CACSL2BoogieTranslator took 859.14ms. Allocated memory is still 79.7MB. Free memory was 54.6MB in the beginning and 48.8MB in the end (delta: 5.8MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2023-11-19 04:47:33,487 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.35ms. Allocated memory is still 79.7MB. Free memory was 48.8MB in the beginning and 46.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 04:47:33,488 INFO L158 Benchmark]: Boogie Preprocessor took 77.40ms. Allocated memory is still 79.7MB. Free memory was 46.0MB in the beginning and 43.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 04:47:33,488 INFO L158 Benchmark]: RCFGBuilder took 898.70ms. Allocated memory is still 79.7MB. Free memory was 43.9MB in the beginning and 50.2MB in the end (delta: -6.3MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2023-11-19 04:47:33,489 INFO L158 Benchmark]: TraceAbstraction took 12966.81ms. Allocated memory was 79.7MB in the beginning and 172.0MB in the end (delta: 92.3MB). Free memory was 49.5MB in the beginning and 117.3MB in the end (delta: -67.8MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2023-11-19 04:47:33,489 INFO L158 Benchmark]: Witness Printer took 4.43ms. Allocated memory is still 172.0MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 04:47:33,491 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.31ms. Allocated memory is still 62.9MB. Free memory is still 39.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 859.14ms. Allocated memory is still 79.7MB. Free memory was 54.6MB in the beginning and 48.8MB in the end (delta: 5.8MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.35ms. Allocated memory is still 79.7MB. Free memory was 48.8MB in the beginning and 46.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.40ms. Allocated memory is still 79.7MB. Free memory was 46.0MB in the beginning and 43.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 898.70ms. Allocated memory is still 79.7MB. Free memory was 43.9MB in the beginning and 50.2MB in the end (delta: -6.3MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12966.81ms. Allocated memory was 79.7MB in the beginning and 172.0MB in the end (delta: 92.3MB). Free memory was 49.5MB in the beginning and 117.3MB in the end (delta: -67.8MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Witness Printer took 4.43ms. Allocated memory is still 172.0MB. Free memory is still 116.2MB. 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~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.9s, 115 PlacesBefore, 33 PlacesAfterwards, 113 TransitionsBefore, 28 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 3 ChoiceCompositions, 126 TotalNumberOfCompositions, 4130 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2500, independent: 2362, independent conditional: 0, independent unconditional: 2362, dependent: 138, dependent conditional: 0, dependent unconditional: 138, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1423, independent: 1378, independent conditional: 0, independent unconditional: 1378, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1423, independent: 1340, independent conditional: 0, independent unconditional: 1340, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 83, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 480, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 406, dependent conditional: 0, dependent unconditional: 406, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2500, independent: 984, independent conditional: 0, independent unconditional: 984, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 1423, unknown conditional: 0, unknown unconditional: 1423] , Statistics on independence cache: Total cache size (in pairs): 113, Positive cache size: 94, Positive conditional cache size: 0, Positive unconditional cache size: 94, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L831] 0 pthread_t t243; [L832] FCALL, FORK 0 pthread_create(&t243, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t243={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, z=0] [L833] 0 pthread_t t244; [L834] FCALL, FORK 0 pthread_create(&t244, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t243={3:0}, t244={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=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, z=0] [L779] 2 y$w_buff1 = y$w_buff0 [L780] 2 y$w_buff0 = 1 [L781] 2 y$w_buff1_used = y$w_buff0_used [L782] 2 y$w_buff0_used = (_Bool)1 [L783] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L783] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L784] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L785] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L786] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L787] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=0] [L790] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 2 y$flush_delayed = weak$$choice2 [L793] 2 y$mem_tmp = y [L794] 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) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 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)) [L799] 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)) [L800] 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)) [L801] 2 __unbuffered_p1_EAX = y [L802] 2 y = y$flush_delayed ? y$mem_tmp : y [L803] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=0] [L806] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L748] 1 x = 1 [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EBX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 [L772] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 1 return 0; [L809] 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) [L810] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L811] 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 [L812] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L813] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 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) [L841] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L842] 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 [L843] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L844] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t243={3:0}, t244={7:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L847] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix009.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=0, y$r_buff0_thd2=1, 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, z=1] - UnprovableResult [Line: 18]: 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: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 832]: 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, 131 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 103 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 398 IncrementalHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 16 mSDtfsCounter, 398 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=0, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 310 SizeOfPredicates, 9 NumberOfNonLiveVariables, 538 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-19 04:47:33,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2de45f3-ca0a-4325-a3f5-3a8bea10274f/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample