./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/list-ext.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/list-ext.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX --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 75539a96800eea0d91d3dad14f0ad356c5f8079fa4f6dcf5bbfcb193296a44a8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:50:10,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:50:10,483 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-12 00:50:10,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:50:10,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:50:10,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:50:10,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:50:10,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:50:10,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:50:10,541 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:50:10,542 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:50:10,542 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:50:10,543 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:50:10,543 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:50:10,544 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:50:10,544 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:50:10,545 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:50:10,545 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:50:10,546 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:50:10,547 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:50:10,547 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:50:10,555 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:50:10,556 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:50:10,556 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:50:10,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:50:10,557 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:50:10,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:50:10,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:50:10,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:50:10,559 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:50:10,560 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:50:10,560 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:50:10,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:50:10,561 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:50:10,562 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:50:10,562 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:50:10,562 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:50:10,563 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:50:10,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:50:10,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:50:10,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:50:10,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:50:10,566 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:50:10,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:50:10,567 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:50:10,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:50:10,568 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_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/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_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX 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 -> 75539a96800eea0d91d3dad14f0ad356c5f8079fa4f6dcf5bbfcb193296a44a8 [2023-11-12 00:50:10,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:50:10,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:50:10,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:50:10,947 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:50:10,948 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:50:10,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-ext-properties/list-ext.i [2023-11-12 00:50:14,000 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:50:14,312 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:50:14,331 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/sv-benchmarks/c/list-ext-properties/list-ext.i [2023-11-12 00:50:14,348 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/data/6c6c0f6b7/bf93655313914b28b5212addd7706d76/FLAGcf107c8ce [2023-11-12 00:50:14,374 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/data/6c6c0f6b7/bf93655313914b28b5212addd7706d76 [2023-11-12 00:50:14,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:50:14,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:50:14,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:50:14,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:50:14,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:50:14,387 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:50:14" (1/1) ... [2023-11-12 00:50:14,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d779cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14, skipping insertion in model container [2023-11-12 00:50:14,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:50:14" (1/1) ... [2023-11-12 00:50:14,458 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:50:14,794 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:50:14,804 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:50:14,847 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:50:14,879 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:50:14,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14 WrapperNode [2023-11-12 00:50:14,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:50:14,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:50:14,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:50:14,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:50:14,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2023-11-12 00:50:14,904 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2023-11-12 00:50:14,943 INFO L138 Inliner]: procedures = 124, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 132 [2023-11-12 00:50:14,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:50:14,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:50:14,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:50:14,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:50:14,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2023-11-12 00:50:14,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2023-11-12 00:50:14,979 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2023-11-12 00:50:14,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2023-11-12 00:50:14,988 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2023-11-12 00:50:15,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2023-11-12 00:50:15,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2023-11-12 00:50:15,015 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2023-11-12 00:50:15,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:50:15,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:50:15,026 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:50:15,027 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:50:15,028 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (1/1) ... [2023-11-12 00:50:15,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:50:15,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:50:15,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:50:15,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:50:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-12 00:50:15,140 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-12 00:50:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:50:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:50:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:50:15,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:50:15,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:50:15,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:50:15,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:50:15,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 00:50:15,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:50:15,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:50:15,294 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:50:15,296 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:50:15,337 INFO L770 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-12 00:50:15,721 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:50:15,815 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:50:15,815 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-12 00:50:15,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:50:15 BoogieIcfgContainer [2023-11-12 00:50:15,818 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:50:15,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:50:15,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:50:15,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:50:15,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:50:14" (1/3) ... [2023-11-12 00:50:15,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e5d33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:50:15, skipping insertion in model container [2023-11-12 00:50:15,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:14" (2/3) ... [2023-11-12 00:50:15,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e5d33b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:50:15, skipping insertion in model container [2023-11-12 00:50:15,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:50:15" (3/3) ... [2023-11-12 00:50:15,835 INFO L112 eAbstractionObserver]: Analyzing ICFG list-ext.i [2023-11-12 00:50:15,863 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:50:15,863 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2023-11-12 00:50:15,922 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:50:15,929 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;@2922172b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:50:15,930 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2023-11-12 00:50:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 41 states have (on average 2.292682926829268) internal successors, (94), 81 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:15,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:50:15,942 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:15,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:50:15,943 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:50:15,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:15,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1992725426, now seen corresponding path program 1 times [2023-11-12 00:50:15,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:50:15,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533385939] [2023-11-12 00:50:15,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:15,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:50:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:16,148 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-12 00:50:16,149 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:50:16,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533385939] [2023-11-12 00:50:16,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533385939] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:16,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:16,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:50:16,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922303282] [2023-11-12 00:50:16,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:16,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 00:50:16,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:50:16,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 00:50:16,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 00:50:16,190 INFO L87 Difference]: Start difference. First operand has 83 states, 41 states have (on average 2.292682926829268) internal successors, (94), 81 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-12 00:50:16,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:16,264 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2023-11-12 00:50:16,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 00:50:16,267 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-11-12 00:50:16,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:16,274 INFO L225 Difference]: With dead ends: 82 [2023-11-12 00:50:16,274 INFO L226 Difference]: Without dead ends: 76 [2023-11-12 00:50:16,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-12 00:50:16,280 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:16,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:50:16,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-12 00:50:16,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-12 00:50:16,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-12 00:50:16,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2023-11-12 00:50:16,319 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 6 [2023-11-12 00:50:16,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:16,320 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2023-11-12 00:50:16,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-12 00:50:16,320 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2023-11-12 00:50:16,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:50:16,321 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:16,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:50:16,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:50:16,322 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:50:16,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:16,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1992577303, now seen corresponding path program 1 times [2023-11-12 00:50:16,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:50:16,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967022442] [2023-11-12 00:50:16,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:16,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:50:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:16,475 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-12 00:50:16,478 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:50:16,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967022442] [2023-11-12 00:50:16,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967022442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:16,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:16,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:50:16,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377961583] [2023-11-12 00:50:16,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:16,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:50:16,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:50:16,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:50:16,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:50:16,484 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-12 00:50:16,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:16,767 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2023-11-12 00:50:16,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:50:16,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-11-12 00:50:16,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:16,769 INFO L225 Difference]: With dead ends: 94 [2023-11-12 00:50:16,769 INFO L226 Difference]: Without dead ends: 94 [2023-11-12 00:50:16,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:50:16,772 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 134 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:16,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 32 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:50:16,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-12 00:50:16,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2023-11-12 00:50:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.8125) internal successors, (87), 74 states have internal predecessors, (87), 0 states have call successors, (0), 0 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-12 00:50:16,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2023-11-12 00:50:16,791 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 6 [2023-11-12 00:50:16,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:16,791 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2023-11-12 00:50:16,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-12 00:50:16,792 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2023-11-12 00:50:16,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-12 00:50:16,792 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:16,792 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-12 00:50:16,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:50:16,793 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:50:16,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:16,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1992577302, now seen corresponding path program 1 times [2023-11-12 00:50:16,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:50:16,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867243745] [2023-11-12 00:50:16,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:16,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:50:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:17,038 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-12 00:50:17,039 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:50:17,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867243745] [2023-11-12 00:50:17,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867243745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:17,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:17,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:50:17,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572660781] [2023-11-12 00:50:17,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:17,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:50:17,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:50:17,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:50:17,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:50:17,042 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-12 00:50:17,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:17,323 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2023-11-12 00:50:17,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:50:17,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2023-11-12 00:50:17,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:17,328 INFO L225 Difference]: With dead ends: 147 [2023-11-12 00:50:17,329 INFO L226 Difference]: Without dead ends: 147 [2023-11-12 00:50:17,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:50:17,331 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 111 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:17,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 78 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:50:17,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-12 00:50:17,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 102. [2023-11-12 00:50:17,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 75 states have (on average 1.6666666666666667) internal successors, (125), 101 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-12 00:50:17,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2023-11-12 00:50:17,353 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 6 [2023-11-12 00:50:17,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:17,354 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2023-11-12 00:50:17,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-12 00:50:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2023-11-12 00:50:17,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:50:17,355 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:17,356 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:50:17,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:50:17,356 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:50:17,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:17,357 INFO L85 PathProgramCache]: Analyzing trace with hash -718284423, now seen corresponding path program 1 times [2023-11-12 00:50:17,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:50:17,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22800047] [2023-11-12 00:50:17,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:17,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:50:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:50:17,541 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:50:17,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22800047] [2023-11-12 00:50:17,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22800047] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:17,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:17,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:50:17,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687689127] [2023-11-12 00:50:17,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:17,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:50:17,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:50:17,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:50:17,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:50:17,545 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:17,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:17,787 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2023-11-12 00:50:17,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:50:17,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-12 00:50:17,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:17,789 INFO L225 Difference]: With dead ends: 120 [2023-11-12 00:50:17,789 INFO L226 Difference]: Without dead ends: 120 [2023-11-12 00:50:17,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:50:17,791 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 97 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:17,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 102 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:50:17,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-12 00:50:17,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 99. [2023-11-12 00:50:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 98 states have internal predecessors, (122), 0 states have call successors, (0), 0 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-12 00:50:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 122 transitions. [2023-11-12 00:50:17,800 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 122 transitions. Word has length 12 [2023-11-12 00:50:17,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:17,800 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 122 transitions. [2023-11-12 00:50:17,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:17,801 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 122 transitions. [2023-11-12 00:50:17,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 00:50:17,802 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:17,802 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:50:17,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:50:17,802 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:50:17,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:17,803 INFO L85 PathProgramCache]: Analyzing trace with hash -718284422, now seen corresponding path program 1 times [2023-11-12 00:50:17,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:50:17,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82731322] [2023-11-12 00:50:17,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:17,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:50:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:50:18,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:50:18,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82731322] [2023-11-12 00:50:18,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82731322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:18,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:18,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:50:18,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77943281] [2023-11-12 00:50:18,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:18,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 00:50:18,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:50:18,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 00:50:18,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 00:50:18,030 INFO L87 Difference]: Start difference. First operand 99 states and 122 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:18,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:18,314 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2023-11-12 00:50:18,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:50:18,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-12 00:50:18,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:18,316 INFO L225 Difference]: With dead ends: 112 [2023-11-12 00:50:18,316 INFO L226 Difference]: Without dead ends: 112 [2023-11-12 00:50:18,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:50:18,318 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 54 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:18,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 146 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:50:18,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-12 00:50:18,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 83. [2023-11-12 00:50:18,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 82 states have internal predecessors, (106), 0 states have call successors, (0), 0 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-12 00:50:18,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 106 transitions. [2023-11-12 00:50:18,339 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 106 transitions. Word has length 12 [2023-11-12 00:50:18,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:18,340 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 106 transitions. [2023-11-12 00:50:18,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:18,340 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2023-11-12 00:50:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-12 00:50:18,341 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:18,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:50:18,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:50:18,342 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:50:18,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:18,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1704337968, now seen corresponding path program 1 times [2023-11-12 00:50:18,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:50:18,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015102021] [2023-11-12 00:50:18,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:18,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:50:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:50:18,776 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:50:18,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015102021] [2023-11-12 00:50:18,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015102021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:18,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:18,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 00:50:18,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994136229] [2023-11-12 00:50:18,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:18,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:50:18,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:50:18,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:50:18,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:50:18,779 INFO L87 Difference]: Start difference. First operand 83 states and 106 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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-12 00:50:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:19,074 INFO L93 Difference]: Finished difference Result 136 states and 155 transitions. [2023-11-12 00:50:19,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:50:19,074 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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-12 00:50:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:19,075 INFO L225 Difference]: With dead ends: 136 [2023-11-12 00:50:19,075 INFO L226 Difference]: Without dead ends: 136 [2023-11-12 00:50:19,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:50:19,077 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 199 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:19,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 93 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:50:19,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-12 00:50:19,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 78. [2023-11-12 00:50:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.532258064516129) internal successors, (95), 77 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-12 00:50:19,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2023-11-12 00:50:19,082 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 13 [2023-11-12 00:50:19,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:19,082 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2023-11-12 00:50:19,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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-12 00:50:19,090 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2023-11-12 00:50:19,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 00:50:19,091 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:19,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:50:19,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 00:50:19,092 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:50:19,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:19,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1490657010, now seen corresponding path program 1 times [2023-11-12 00:50:19,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:50:19,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892000669] [2023-11-12 00:50:19,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:19,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:50:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:19,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:50:19,341 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:50:19,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892000669] [2023-11-12 00:50:19,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892000669] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:19,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:19,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 00:50:19,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896525565] [2023-11-12 00:50:19,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:19,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 00:50:19,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:50:19,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 00:50:19,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:50:19,344 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:19,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:19,684 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2023-11-12 00:50:19,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:50:19,685 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-12 00:50:19,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:19,686 INFO L225 Difference]: With dead ends: 126 [2023-11-12 00:50:19,686 INFO L226 Difference]: Without dead ends: 126 [2023-11-12 00:50:19,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-12 00:50:19,687 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 159 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:19,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 106 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:50:19,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-12 00:50:19,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 73. [2023-11-12 00:50:19,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 72 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-12 00:50:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2023-11-12 00:50:19,693 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 15 [2023-11-12 00:50:19,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:19,693 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2023-11-12 00:50:19,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:19,693 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2023-11-12 00:50:19,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-12 00:50:19,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:19,694 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:50:19,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 00:50:19,695 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:50:19,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:19,695 INFO L85 PathProgramCache]: Analyzing trace with hash 263908707, now seen corresponding path program 1 times [2023-11-12 00:50:19,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:50:19,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135444001] [2023-11-12 00:50:19,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:19,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:50:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:19,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:50:19,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:50:19,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135444001] [2023-11-12 00:50:19,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135444001] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:50:19,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935279888] [2023-11-12 00:50:19,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:19,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:50:19,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:50:19,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:50:19,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:50:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:20,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-12 00:50:20,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:50:20,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:50:20,244 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:50:20,377 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:50:20,378 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2023-11-12 00:50:20,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:50:20,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935279888] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:50:20,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1088751827] [2023-11-12 00:50:20,558 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2023-11-12 00:50:20,558 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:50:20,563 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:50:20,569 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:50:20,570 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:50:22,501 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:50:23,537 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1654#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 3) (exists ((|v_#memory_$Pointer$.base_53| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~y~0#1_28| Int) (|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_54| (Array Int (Array Int Int))) (|v_#memory_int_43| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_54| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~p~0#1.base_101| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_84| Int)) (and (= (store |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_main_~p~0#1.base_101| (store (select |v_#memory_$Pointer$.base_53| |v_ULTIMATE.start_main_~p~0#1.base_101|) |v_ULTIMATE.start_main_~p~0#1.offset_84| (select (select |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_main_~p~0#1.base_101|) |v_ULTIMATE.start_main_~p~0#1.offset_84|))) |v_#memory_$Pointer$.base_54|) (or (and (= |v_ULTIMATE.start_main_~p~0#1.offset_84| 0) (= |v_ULTIMATE.start_main_~y~0#1_28| 0)) (= |ULTIMATE.start_main_~t~0#1.offset| 0)) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_84| 8) (select |#length| |v_ULTIMATE.start_main_~p~0#1.base_101|)) (= (select |#valid| |v_ULTIMATE.start_main_~p~0#1.base_101|) 1) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_main_~p~0#1.base_101| (store (select |v_#memory_$Pointer$.base_54| |v_ULTIMATE.start_main_~p~0#1.base_101|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_84| 4) 0))) (= (store |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_main_~p~0#1.base_101| (store (select |v_#memory_$Pointer$.offset_53| |v_ULTIMATE.start_main_~p~0#1.base_101|) |v_ULTIMATE.start_main_~p~0#1.offset_84| (select (select |v_#memory_$Pointer$.offset_54| |v_ULTIMATE.start_main_~p~0#1.base_101|) |v_ULTIMATE.start_main_~p~0#1.offset_84|))) |v_#memory_$Pointer$.offset_54|) (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_84|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_54| |v_ULTIMATE.start_main_~p~0#1.base_101| (store (select |v_#memory_$Pointer$.offset_54| |v_ULTIMATE.start_main_~p~0#1.base_101|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_84| 4) 0))) (= |#memory_int| (store |v_#memory_int_43| |v_ULTIMATE.start_main_~p~0#1.base_101| (store (store (select |v_#memory_int_43| |v_ULTIMATE.start_main_~p~0#1.base_101|) |v_ULTIMATE.start_main_~p~0#1.offset_84| 3) (+ |v_ULTIMATE.start_main_~p~0#1.offset_84| 4) (select (select |#memory_int| |v_ULTIMATE.start_main_~p~0#1.base_101|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_84| 4))))) (<= 0 |v_ULTIMATE.start_main_~y~0#1_28|))) (= |ULTIMATE.start_main_~y~0#1| 0) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))' at error location [2023-11-12 00:50:23,537 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:50:23,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:50:23,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2023-11-12 00:50:23,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095915324] [2023-11-12 00:50:23,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:50:23,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-12 00:50:23,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:50:23,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-12 00:50:23,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=589, Unknown=1, NotChecked=0, Total=756 [2023-11-12 00:50:23,540 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-12 00:50:23,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:23,861 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2023-11-12 00:50:23,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:50:23,861 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 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-12 00:50:23,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:23,862 INFO L225 Difference]: With dead ends: 103 [2023-11-12 00:50:23,863 INFO L226 Difference]: Without dead ends: 103 [2023-11-12 00:50:23,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=208, Invalid=721, Unknown=1, NotChecked=0, Total=930 [2023-11-12 00:50:23,864 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 319 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:23,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 129 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 00:50:23,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-12 00:50:23,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 75. [2023-11-12 00:50:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.4) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-12 00:50:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2023-11-12 00:50:23,880 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 16 [2023-11-12 00:50:23,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:23,881 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2023-11-12 00:50:23,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-12 00:50:23,881 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2023-11-12 00:50:23,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:50:23,882 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:23,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:50:23,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:50:24,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:50:24,089 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:50:24,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:24,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1993991201, now seen corresponding path program 1 times [2023-11-12 00:50:24,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:50:24,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111729293] [2023-11-12 00:50:24,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:24,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:50:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 00:50:24,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 00:50:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 00:50:24,148 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-12 00:50:24,148 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 00:50:24,150 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (37 of 38 remaining) [2023-11-12 00:50:24,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 38 remaining) [2023-11-12 00:50:24,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 38 remaining) [2023-11-12 00:50:24,152 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 38 remaining) [2023-11-12 00:50:24,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 38 remaining) [2023-11-12 00:50:24,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 38 remaining) [2023-11-12 00:50:24,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 38 remaining) [2023-11-12 00:50:24,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 38 remaining) [2023-11-12 00:50:24,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 38 remaining) [2023-11-12 00:50:24,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 38 remaining) [2023-11-12 00:50:24,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 38 remaining) [2023-11-12 00:50:24,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 38 remaining) [2023-11-12 00:50:24,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 38 remaining) [2023-11-12 00:50:24,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 38 remaining) [2023-11-12 00:50:24,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2023-11-12 00:50:24,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2023-11-12 00:50:24,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2023-11-12 00:50:24,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2023-11-12 00:50:24,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 38 remaining) [2023-11-12 00:50:24,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 38 remaining) [2023-11-12 00:50:24,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2023-11-12 00:50:24,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2023-11-12 00:50:24,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2023-11-12 00:50:24,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2023-11-12 00:50:24,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2023-11-12 00:50:24,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2023-11-12 00:50:24,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2023-11-12 00:50:24,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2023-11-12 00:50:24,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2023-11-12 00:50:24,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2023-11-12 00:50:24,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 38 remaining) [2023-11-12 00:50:24,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (6 of 38 remaining) [2023-11-12 00:50:24,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (5 of 38 remaining) [2023-11-12 00:50:24,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (4 of 38 remaining) [2023-11-12 00:50:24,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE (3 of 38 remaining) [2023-11-12 00:50:24,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (2 of 38 remaining) [2023-11-12 00:50:24,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (1 of 38 remaining) [2023-11-12 00:50:24,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (0 of 38 remaining) [2023-11-12 00:50:24,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 00:50:24,168 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:50:24,173 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 00:50:24,195 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-12 00:50:24,196 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short5 could not be translated [2023-11-12 00:50:24,197 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-12 00:50:24,197 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-12 00:50:24,198 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated [2023-11-12 00:50:24,198 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated [2023-11-12 00:50:24,199 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem20 could not be translated [2023-11-12 00:50:24,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:50:24 BoogieIcfgContainer [2023-11-12 00:50:24,206 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 00:50:24,207 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 00:50:24,207 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 00:50:24,207 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 00:50:24,208 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:50:15" (3/4) ... [2023-11-12 00:50:24,211 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 00:50:24,212 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 00:50:24,213 INFO L158 Benchmark]: Toolchain (without parser) took 9834.12ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 120.6MB in the beginning and 125.8MB in the end (delta: -5.2MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2023-11-12 00:50:24,213 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 119.5MB. Free memory was 93.9MB in the beginning and 93.8MB in the end (delta: 73.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:50:24,213 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.25ms. Allocated memory is still 153.1MB. Free memory was 120.6MB in the beginning and 103.1MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-12 00:50:24,214 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.77ms. Allocated memory is still 153.1MB. Free memory was 103.1MB in the beginning and 101.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:50:24,214 INFO L158 Benchmark]: Boogie Preprocessor took 74.45ms. Allocated memory is still 153.1MB. Free memory was 101.1MB in the beginning and 99.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:50:24,215 INFO L158 Benchmark]: RCFGBuilder took 798.63ms. Allocated memory is still 153.1MB. Free memory was 99.0MB in the beginning and 101.6MB in the end (delta: -2.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-12 00:50:24,215 INFO L158 Benchmark]: TraceAbstraction took 8385.90ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 101.2MB in the beginning and 126.9MB in the end (delta: -25.7MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. [2023-11-12 00:50:24,216 INFO L158 Benchmark]: Witness Printer took 5.23ms. Allocated memory is still 222.3MB. Free memory was 126.9MB in the beginning and 125.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:50:24,218 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.35ms. Allocated memory is still 119.5MB. Free memory was 93.9MB in the beginning and 93.8MB in the end (delta: 73.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.25ms. Allocated memory is still 153.1MB. Free memory was 120.6MB in the beginning and 103.1MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.77ms. Allocated memory is still 153.1MB. Free memory was 103.1MB in the beginning and 101.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.45ms. Allocated memory is still 153.1MB. Free memory was 101.1MB in the beginning and 99.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 798.63ms. Allocated memory is still 153.1MB. Free memory was 99.0MB in the beginning and 101.6MB in the end (delta: -2.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8385.90ms. Allocated memory was 153.1MB in the beginning and 222.3MB in the end (delta: 69.2MB). Free memory was 101.2MB in the beginning and 126.9MB in the end (delta: -25.7MB). Peak memory consumption was 45.6MB. Max. memory is 16.1GB. * Witness Printer took 5.23ms. Allocated memory is still 222.3MB. Free memory was 126.9MB in the beginning and 125.8MB 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~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem20 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 12. Possible FailurePath: [L532] int i = 0; [L533] int y = 0; [L534] List a = (List) malloc(sizeof(struct node)); [L535] COND FALSE !(a == 0) VAL [a={-1:0}, i=0, y=0] [L536] List t; [L537] List p = a; VAL [a={-1:0}, i=0, p={-1:0}, y=0] [L538] i < 10 && __VERIFIER_nondet_int() [L538] i < 10 && __VERIFIER_nondet_int() VAL [a={-1:0}, i=0, p={-1:0}, y=0] [L538] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L546] y < 10 && __VERIFIER_nondet_int() [L546] y < 10 && __VERIFIER_nondet_int() VAL [a={-1:0}, i=0, p={-1:0}, y=0] [L546] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L554] p->h = 3 VAL [a={-1:0}, i=0, p={-1:0}, y=0] [L555] p->n = 0 [L556] i = 0 [L557] y = 0 [L558] p = a VAL [a={-1:0}, i=0, p={-1:0}, y=0] [L559] EXPR p->h VAL [a={-1:0}, i=0, p={-1:0}, y=0] [L559] COND FALSE !(p->h == 1) [L563] EXPR p->h VAL [a={-1:0}, i=0, p={-1:0}, y=0] [L563] COND FALSE !(p->h == 2) [L567] EXPR p->h VAL [a={-1:0}, i=0, p={-1:0}, y=0] [L567] COND TRUE p->h != 3 || (i + y) < 20 [L568] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "list-ext.c", 3, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1073 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1073 mSDsluCounter, 762 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 459 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1362 IncrementalHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 303 mSDtfsCounter, 1362 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=3, InterpolantAutomatonStates: 44, 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, 8 MinimizatonAttempts, 253 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 864 SizeOfPredicates, 6 NumberOfNonLiveVariables, 144 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 8/14 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-12 00:50:24,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/list-ext.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX --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 75539a96800eea0d91d3dad14f0ad356c5f8079fa4f6dcf5bbfcb193296a44a8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:50:26,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:50:27,012 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-11-12 00:50:27,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:50:27,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:50:27,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:50:27,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:50:27,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:50:27,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:50:27,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:50:27,051 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:50:27,052 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:50:27,052 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:50:27,053 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:50:27,054 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:50:27,054 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:50:27,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:50:27,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:50:27,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:50:27,057 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 00:50:27,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:50:27,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 00:50:27,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:50:27,060 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:50:27,060 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:50:27,061 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:50:27,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:50:27,062 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:50:27,062 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 00:50:27,068 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 00:50:27,068 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:50:27,069 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 00:50:27,069 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:50:27,070 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:50:27,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 00:50:27,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:50:27,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:50:27,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:50:27,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:50:27,072 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-12 00:50:27,072 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 00:50:27,074 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:50:27,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:50:27,074 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_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/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_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX 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 -> 75539a96800eea0d91d3dad14f0ad356c5f8079fa4f6dcf5bbfcb193296a44a8 [2023-11-12 00:50:27,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:50:27,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:50:27,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:50:27,507 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:50:27,509 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:50:27,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/list-ext-properties/list-ext.i [2023-11-12 00:50:30,827 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:50:31,145 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:50:31,146 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/sv-benchmarks/c/list-ext-properties/list-ext.i [2023-11-12 00:50:31,164 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/data/1f314297f/093183c5da884fb2ac4fadf7fe04ec30/FLAG4440f43bd [2023-11-12 00:50:31,180 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/data/1f314297f/093183c5da884fb2ac4fadf7fe04ec30 [2023-11-12 00:50:31,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:50:31,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:50:31,187 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:50:31,187 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:50:31,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:50:31,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:50:31" (1/1) ... [2023-11-12 00:50:31,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7544a619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:31, skipping insertion in model container [2023-11-12 00:50:31,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:50:31" (1/1) ... [2023-11-12 00:50:31,254 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:50:31,656 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:50:31,679 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:50:31,751 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:50:31,790 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:50:31,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:31 WrapperNode [2023-11-12 00:50:31,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:50:31,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:50:31,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:50:31,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:50:31,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:31" (1/1) ... [2023-11-12 00:50:31,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:31" (1/1) ... [2023-11-12 00:50:31,850 INFO L138 Inliner]: procedures = 127, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 131 [2023-11-12 00:50:31,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:50:31,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:50:31,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:50:31,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:50:31,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:31" (1/1) ... [2023-11-12 00:50:31,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:31" (1/1) ... [2023-11-12 00:50:31,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:31" (1/1) ... [2023-11-12 00:50:31,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:31" (1/1) ... [2023-11-12 00:50:31,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:31" (1/1) ... [2023-11-12 00:50:31,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:31" (1/1) ... [2023-11-12 00:50:31,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:31" (1/1) ... [2023-11-12 00:50:31,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:31" (1/1) ... [2023-11-12 00:50:31,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:50:31,923 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:50:31,923 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:50:31,923 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:50:31,924 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:31" (1/1) ... [2023-11-12 00:50:31,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:50:31,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:50:31,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 00:50:31,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 00:50:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-12 00:50:32,013 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-12 00:50:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-12 00:50:32,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 00:50:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 00:50:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 00:50:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 00:50:32,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:50:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-12 00:50:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-12 00:50:32,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:50:32,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:50:32,189 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:50:32,192 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:50:32,241 INFO L770 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-12 00:50:32,831 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:50:32,839 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:50:32,839 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-12 00:50:32,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:50:32 BoogieIcfgContainer [2023-11-12 00:50:32,842 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:50:32,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:50:32,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:50:32,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:50:32,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:50:31" (1/3) ... [2023-11-12 00:50:32,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20daaa43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:50:32, skipping insertion in model container [2023-11-12 00:50:32,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:31" (2/3) ... [2023-11-12 00:50:32,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20daaa43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:50:32, skipping insertion in model container [2023-11-12 00:50:32,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:50:32" (3/3) ... [2023-11-12 00:50:32,855 INFO L112 eAbstractionObserver]: Analyzing ICFG list-ext.i [2023-11-12 00:50:32,882 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:50:32,883 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations. [2023-11-12 00:50:32,944 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:50:32,952 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;@56a81c83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:50:32,952 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2023-11-12 00:50:32,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 54 states have (on average 2.0185185185185186) internal successors, (109), 94 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:32,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-12 00:50:32,966 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:32,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:50:32,967 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:50:32,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:32,974 INFO L85 PathProgramCache]: Analyzing trace with hash 2098269937, now seen corresponding path program 1 times [2023-11-12 00:50:32,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:50:32,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808130228] [2023-11-12 00:50:32,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:32,996 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-12 00:50:32,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:50:33,002 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:33,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:33,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-12 00:50:33,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:50:33,174 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-12 00:50:33,174 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:50:33,175 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:50:33,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808130228] [2023-11-12 00:50:33,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808130228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:33,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:33,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 00:50:33,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467619958] [2023-11-12 00:50:33,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:33,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 00:50:33,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:50:33,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 00:50:33,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 00:50:33,232 INFO L87 Difference]: Start difference. First operand has 96 states, 54 states have (on average 2.0185185185185186) internal successors, (109), 94 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 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-12 00:50:33,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:33,258 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2023-11-12 00:50:33,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 00:50:33,260 INFO L78 Accepts]: Start accepts. Automaton has has 2 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-12 00:50:33,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:33,270 INFO L225 Difference]: With dead ends: 95 [2023-11-12 00:50:33,270 INFO L226 Difference]: Without dead ends: 88 [2023-11-12 00:50:33,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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-12 00:50:33,279 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:33,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:50:33,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-12 00:50:33,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-11-12 00:50:33,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 50 states have (on average 1.88) internal successors, (94), 87 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-12 00:50:33,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2023-11-12 00:50:33,343 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 7 [2023-11-12 00:50:33,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:33,343 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2023-11-12 00:50:33,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 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-12 00:50:33,344 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2023-11-12 00:50:33,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 00:50:33,345 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:33,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:50:33,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:33,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:33,566 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:50:33,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:33,567 INFO L85 PathProgramCache]: Analyzing trace with hash 620871786, now seen corresponding path program 1 times [2023-11-12 00:50:33,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:50:33,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101573069] [2023-11-12 00:50:33,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:33,568 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-12 00:50:33,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:50:33,570 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:33,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:33,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-12 00:50:33,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:50:33,712 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-12 00:50:33,753 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-12 00:50:33,753 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:50:33,753 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:50:33,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101573069] [2023-11-12 00:50:33,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101573069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:33,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:33,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:50:33,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661313237] [2023-11-12 00:50:33,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:33,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:50:33,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:50:33,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:50:33,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:50:33,758 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-12 00:50:34,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:34,124 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2023-11-12 00:50:34,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:50:34,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-12 00:50:34,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:34,127 INFO L225 Difference]: With dead ends: 109 [2023-11-12 00:50:34,127 INFO L226 Difference]: Without dead ends: 109 [2023-11-12 00:50:34,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-12 00:50:34,129 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 166 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:34,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 54 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 00:50:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-12 00:50:34,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 89. [2023-11-12 00:50:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 88 states have internal predecessors, (105), 0 states have call successors, (0), 0 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-12 00:50:34,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2023-11-12 00:50:34,156 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 8 [2023-11-12 00:50:34,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:34,159 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2023-11-12 00:50:34,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-12 00:50:34,159 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2023-11-12 00:50:34,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-12 00:50:34,160 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:34,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:50:34,180 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:34,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:34,374 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:50:34,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:34,375 INFO L85 PathProgramCache]: Analyzing trace with hash 620871787, now seen corresponding path program 1 times [2023-11-12 00:50:34,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:50:34,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242870010] [2023-11-12 00:50:34,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:34,376 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-12 00:50:34,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:50:34,378 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:34,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:34,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-12 00:50:34,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:50:34,506 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:50:34,605 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-12 00:50:34,605 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:50:34,606 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:50:34,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242870010] [2023-11-12 00:50:34,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242870010] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:34,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:34,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 00:50:34,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421124562] [2023-11-12 00:50:34,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:34,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:50:34,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:50:34,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:50:34,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:50:34,609 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-12 00:50:35,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:35,067 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2023-11-12 00:50:35,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:50:35,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-12 00:50:35,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:35,070 INFO L225 Difference]: With dead ends: 128 [2023-11-12 00:50:35,070 INFO L226 Difference]: Without dead ends: 128 [2023-11-12 00:50:35,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-12 00:50:35,072 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 176 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:35,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 64 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 00:50:35,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-12 00:50:35,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 109. [2023-11-12 00:50:35,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 82 states have (on average 1.5) internal successors, (123), 108 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-12 00:50:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2023-11-12 00:50:35,085 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 8 [2023-11-12 00:50:35,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:35,085 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2023-11-12 00:50:35,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-12 00:50:35,086 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2023-11-12 00:50:35,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:50:35,087 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:35,087 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:50:35,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:35,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:35,299 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:50:35,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:35,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1332204644, now seen corresponding path program 1 times [2023-11-12 00:50:35,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:50:35,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900752229] [2023-11-12 00:50:35,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:35,300 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-12 00:50:35,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:50:35,307 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:35,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:35,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-12 00:50:35,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:50:35,412 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-12 00:50:35,452 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-12 00:50:35,486 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-12 00:50:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:50:35,536 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:50:35,536 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:50:35,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900752229] [2023-11-12 00:50:35,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [900752229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:35,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:35,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:50:35,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360627938] [2023-11-12 00:50:35,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:35,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:50:35,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:50:35,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:50:35,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:50:35,539 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:36,350 INFO L93 Difference]: Finished difference Result 156 states and 176 transitions. [2023-11-12 00:50:36,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:50:36,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-12 00:50:36,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:36,354 INFO L225 Difference]: With dead ends: 156 [2023-11-12 00:50:36,354 INFO L226 Difference]: Without dead ends: 156 [2023-11-12 00:50:36,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:50:36,356 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 120 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:36,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 254 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 00:50:36,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-12 00:50:36,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 113. [2023-11-12 00:50:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.5057471264367817) internal successors, (131), 112 states have internal predecessors, (131), 0 states have call successors, (0), 0 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-12 00:50:36,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2023-11-12 00:50:36,372 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 17 [2023-11-12 00:50:36,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:36,373 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2023-11-12 00:50:36,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:36,373 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2023-11-12 00:50:36,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:50:36,374 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:36,374 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:50:36,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:36,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:36,575 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:50:36,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:36,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1332204645, now seen corresponding path program 1 times [2023-11-12 00:50:36,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:50:36,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258772902] [2023-11-12 00:50:36,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:36,576 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-12 00:50:36,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:50:36,578 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:36,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:36,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-12 00:50:36,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:50:36,674 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:50:36,727 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-12 00:50:36,737 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-12 00:50:36,786 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-12 00:50:36,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:50:36,850 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:50:36,851 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:50:36,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258772902] [2023-11-12 00:50:36,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258772902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:36,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:36,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:50:36,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328509207] [2023-11-12 00:50:36,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:36,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:50:36,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:50:36,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:50:36,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:50:36,853 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:37,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:37,933 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2023-11-12 00:50:37,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:50:37,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-12 00:50:37,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:37,939 INFO L225 Difference]: With dead ends: 159 [2023-11-12 00:50:37,939 INFO L226 Difference]: Without dead ends: 159 [2023-11-12 00:50:37,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-12 00:50:37,940 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 82 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:37,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 325 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-12 00:50:37,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-11-12 00:50:37,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 97. [2023-11-12 00:50:37,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 74 states have (on average 1.472972972972973) internal successors, (109), 96 states have internal predecessors, (109), 0 states have call successors, (0), 0 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-12 00:50:37,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2023-11-12 00:50:37,950 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 17 [2023-11-12 00:50:37,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:37,950 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2023-11-12 00:50:37,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:37,950 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2023-11-12 00:50:37,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 00:50:37,951 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:37,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:50:37,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:38,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:38,163 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:50:38,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:38,164 INFO L85 PathProgramCache]: Analyzing trace with hash -808483032, now seen corresponding path program 1 times [2023-11-12 00:50:38,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:50:38,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377253431] [2023-11-12 00:50:38,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:38,164 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-12 00:50:38,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:50:38,166 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:38,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:38,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-12 00:50:38,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:50:38,349 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:50:38,385 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-12 00:50:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:50:38,430 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:50:38,430 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:50:38,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377253431] [2023-11-12 00:50:38,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377253431] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:38,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:38,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 00:50:38,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119618443] [2023-11-12 00:50:38,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:38,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:50:38,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:50:38,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:50:38,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:50:38,433 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:39,036 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2023-11-12 00:50:39,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:50:39,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-12 00:50:39,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:39,039 INFO L225 Difference]: With dead ends: 195 [2023-11-12 00:50:39,039 INFO L226 Difference]: Without dead ends: 195 [2023-11-12 00:50:39,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:50:39,040 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 156 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:39,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 218 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 00:50:39,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-11-12 00:50:39,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 108. [2023-11-12 00:50:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 107 states have internal predecessors, (124), 0 states have call successors, (0), 0 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-12 00:50:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2023-11-12 00:50:39,051 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 18 [2023-11-12 00:50:39,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:39,052 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2023-11-12 00:50:39,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2023-11-12 00:50:39,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-12 00:50:39,053 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:39,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:50:39,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:39,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:39,266 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:50:39,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:39,267 INFO L85 PathProgramCache]: Analyzing trace with hash 389308949, now seen corresponding path program 1 times [2023-11-12 00:50:39,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:50:39,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940293137] [2023-11-12 00:50:39,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:39,267 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-12 00:50:39,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:50:39,269 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:39,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:39,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-12 00:50:39,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:50:39,431 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 00:50:39,466 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-12 00:50:39,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:50:39,519 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:50:39,519 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:50:39,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940293137] [2023-11-12 00:50:39,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940293137] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:39,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:39,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 00:50:39,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047670564] [2023-11-12 00:50:39,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:39,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 00:50:39,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:50:39,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 00:50:39,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-12 00:50:39,521 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-12 00:50:40,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:40,046 INFO L93 Difference]: Finished difference Result 178 states and 193 transitions. [2023-11-12 00:50:40,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:50:40,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-12 00:50:40,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:40,048 INFO L225 Difference]: With dead ends: 178 [2023-11-12 00:50:40,048 INFO L226 Difference]: Without dead ends: 178 [2023-11-12 00:50:40,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-12 00:50:40,049 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 134 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:40,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 211 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 00:50:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-12 00:50:40,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 110. [2023-11-12 00:50:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 109 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 00:50:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 126 transitions. [2023-11-12 00:50:40,056 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 126 transitions. Word has length 20 [2023-11-12 00:50:40,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:40,056 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 126 transitions. [2023-11-12 00:50:40,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 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-12 00:50:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 126 transitions. [2023-11-12 00:50:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-12 00:50:40,058 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:40,058 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:50:40,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:40,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:40,270 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:50:40,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:40,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1064403471, now seen corresponding path program 1 times [2023-11-12 00:50:40,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:50:40,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810546307] [2023-11-12 00:50:40,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:40,271 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-12 00:50:40,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:50:40,272 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:40,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-12 00:50:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:40,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-12 00:50:40,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:50:40,367 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-12 00:50:40,388 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-12 00:50:40,408 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-12 00:50:40,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:50:40,437 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:50:40,437 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:50:40,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810546307] [2023-11-12 00:50:40,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1810546307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:40,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:40,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:50:40,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936802437] [2023-11-12 00:50:40,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:40,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:50:40,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:50:40,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:50:40,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:50:40,439 INFO L87 Difference]: Start difference. First operand 110 states and 126 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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-12 00:50:41,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:41,021 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2023-11-12 00:50:41,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 00:50:41,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-12 00:50:41,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:41,023 INFO L225 Difference]: With dead ends: 128 [2023-11-12 00:50:41,023 INFO L226 Difference]: Without dead ends: 128 [2023-11-12 00:50:41,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-12 00:50:41,024 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 113 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:41,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 218 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-12 00:50:41,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-11-12 00:50:41,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 108. [2023-11-12 00:50:41,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.4252873563218391) internal successors, (124), 107 states have internal predecessors, (124), 0 states have call successors, (0), 0 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-12 00:50:41,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2023-11-12 00:50:41,031 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 20 [2023-11-12 00:50:41,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:41,031 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2023-11-12 00:50:41,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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-12 00:50:41,031 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2023-11-12 00:50:41,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-12 00:50:41,032 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:41,033 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:50:41,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-12 00:50:41,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:41,233 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:50:41,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:41,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1064403472, now seen corresponding path program 1 times [2023-11-12 00:50:41,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:50:41,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745283629] [2023-11-12 00:50:41,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:41,234 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-12 00:50:41,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:50:41,236 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:41,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-12 00:50:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:41,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-12 00:50:41,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:50:41,341 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 00:50:41,377 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-12 00:50:41,383 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-12 00:50:41,420 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-12 00:50:41,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:50:41,494 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:50:41,495 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-12 00:50:41,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745283629] [2023-11-12 00:50:41,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745283629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:41,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:41,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 00:50:41,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202669675] [2023-11-12 00:50:41,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:41,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 00:50:41,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-12 00:50:41,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 00:50:41,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 00:50:41,498 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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-12 00:50:42,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:42,317 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2023-11-12 00:50:42,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 00:50:42,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-12 00:50:42,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:42,319 INFO L225 Difference]: With dead ends: 126 [2023-11-12 00:50:42,319 INFO L226 Difference]: Without dead ends: 126 [2023-11-12 00:50:42,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-12 00:50:42,320 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 74 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:42,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 278 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 00:50:42,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-12 00:50:42,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 93. [2023-11-12 00:50:42,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 92 states have internal predecessors, (107), 0 states have call successors, (0), 0 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-12 00:50:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2023-11-12 00:50:42,325 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 20 [2023-11-12 00:50:42,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:42,326 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2023-11-12 00:50:42,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 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-12 00:50:42,326 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2023-11-12 00:50:42,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-12 00:50:42,327 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:42,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:50:42,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-12 00:50:42,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:42,540 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-12 00:50:42,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:42,540 INFO L85 PathProgramCache]: Analyzing trace with hash 413244523, now seen corresponding path program 1 times [2023-11-12 00:50:42,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-12 00:50:42,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703377598] [2023-11-12 00:50:42,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:42,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 00:50:42,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat [2023-11-12 00:50:42,541 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:42,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-12 00:50:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 00:50:42,627 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 00:50:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 00:50:42,691 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2023-11-12 00:50:42,692 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 00:50:42,693 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (37 of 38 remaining) [2023-11-12 00:50:42,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 38 remaining) [2023-11-12 00:50:42,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 38 remaining) [2023-11-12 00:50:42,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 38 remaining) [2023-11-12 00:50:42,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 38 remaining) [2023-11-12 00:50:42,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 38 remaining) [2023-11-12 00:50:42,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 38 remaining) [2023-11-12 00:50:42,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 38 remaining) [2023-11-12 00:50:42,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 38 remaining) [2023-11-12 00:50:42,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 38 remaining) [2023-11-12 00:50:42,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 38 remaining) [2023-11-12 00:50:42,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 38 remaining) [2023-11-12 00:50:42,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 38 remaining) [2023-11-12 00:50:42,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 38 remaining) [2023-11-12 00:50:42,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 38 remaining) [2023-11-12 00:50:42,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 38 remaining) [2023-11-12 00:50:42,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 38 remaining) [2023-11-12 00:50:42,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 38 remaining) [2023-11-12 00:50:42,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 38 remaining) [2023-11-12 00:50:42,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 38 remaining) [2023-11-12 00:50:42,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 38 remaining) [2023-11-12 00:50:42,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 38 remaining) [2023-11-12 00:50:42,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 38 remaining) [2023-11-12 00:50:42,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 38 remaining) [2023-11-12 00:50:42,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 38 remaining) [2023-11-12 00:50:42,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 38 remaining) [2023-11-12 00:50:42,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 38 remaining) [2023-11-12 00:50:42,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 38 remaining) [2023-11-12 00:50:42,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 38 remaining) [2023-11-12 00:50:42,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 38 remaining) [2023-11-12 00:50:42,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 38 remaining) [2023-11-12 00:50:42,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (6 of 38 remaining) [2023-11-12 00:50:42,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (5 of 38 remaining) [2023-11-12 00:50:42,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (4 of 38 remaining) [2023-11-12 00:50:42,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE (3 of 38 remaining) [2023-11-12 00:50:42,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (2 of 38 remaining) [2023-11-12 00:50:42,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (1 of 38 remaining) [2023-11-12 00:50:42,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK (0 of 38 remaining) [2023-11-12 00:50:42,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-12 00:50:42,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/mathsat -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-12 00:50:42,915 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:50:42,919 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 00:50:42,935 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-12 00:50:42,936 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short5 could not be translated [2023-11-12 00:50:42,937 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated [2023-11-12 00:50:42,937 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated [2023-11-12 00:50:42,938 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated [2023-11-12 00:50:42,938 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated [2023-11-12 00:50:42,939 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem20 could not be translated [2023-11-12 00:50:42,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:50:42 BoogieIcfgContainer [2023-11-12 00:50:42,947 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 00:50:42,948 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 00:50:42,948 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 00:50:42,948 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 00:50:42,949 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:50:32" (3/4) ... [2023-11-12 00:50:42,952 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 00:50:42,953 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 00:50:42,954 INFO L158 Benchmark]: Toolchain (without parser) took 11768.73ms. Allocated memory was 77.6MB in the beginning and 125.8MB in the end (delta: 48.2MB). Free memory was 47.8MB in the beginning and 67.2MB in the end (delta: -19.4MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2023-11-12 00:50:42,954 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 77.6MB. Free memory is still 53.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:50:42,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 605.15ms. Allocated memory is still 77.6MB. Free memory was 47.6MB in the beginning and 49.1MB in the end (delta: -1.4MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2023-11-12 00:50:42,955 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.60ms. Allocated memory is still 77.6MB. Free memory was 49.1MB in the beginning and 46.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:50:42,955 INFO L158 Benchmark]: Boogie Preprocessor took 69.84ms. Allocated memory is still 77.6MB. Free memory was 46.7MB in the beginning and 44.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 00:50:42,956 INFO L158 Benchmark]: RCFGBuilder took 920.13ms. Allocated memory was 77.6MB in the beginning and 104.9MB in the end (delta: 27.3MB). Free memory was 44.6MB in the beginning and 71.0MB in the end (delta: -26.4MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2023-11-12 00:50:42,956 INFO L158 Benchmark]: TraceAbstraction took 10101.64ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 70.0MB in the beginning and 67.2MB in the end (delta: 2.7MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2023-11-12 00:50:42,957 INFO L158 Benchmark]: Witness Printer took 5.08ms. Allocated memory is still 125.8MB. Free memory is still 67.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 00:50:42,959 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.24ms. Allocated memory is still 77.6MB. Free memory is still 53.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 605.15ms. Allocated memory is still 77.6MB. Free memory was 47.6MB in the beginning and 49.1MB in the end (delta: -1.4MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.60ms. Allocated memory is still 77.6MB. Free memory was 49.1MB in the beginning and 46.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.84ms. Allocated memory is still 77.6MB. Free memory was 46.7MB in the beginning and 44.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 920.13ms. Allocated memory was 77.6MB in the beginning and 104.9MB in the end (delta: 27.3MB). Free memory was 44.6MB in the beginning and 71.0MB in the end (delta: -26.4MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10101.64ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 70.0MB in the beginning and 67.2MB in the end (delta: 2.7MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * Witness Printer took 5.08ms. Allocated memory is still 125.8MB. Free memory is still 67.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~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem20 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 12]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 12. Possible FailurePath: [L532] int i = 0; [L533] int y = 0; [L534] List a = (List) malloc(sizeof(struct node)); [L535] COND FALSE !(a == 0) VAL [a={6:0}, i=0, y=0] [L536] List t; [L537] List p = a; VAL [a={6:0}, i=0, p={6:0}, y=0] [L538] i < 10 && __VERIFIER_nondet_int() [L538] i < 10 && __VERIFIER_nondet_int() VAL [a={6:0}, i=0, p={6:0}, y=0] [L538] COND FALSE !(i < 10 && __VERIFIER_nondet_int()) [L546] y < 10 && __VERIFIER_nondet_int() [L546] y < 10 && __VERIFIER_nondet_int() VAL [a={6:0}, i=0, p={6:0}, y=0] [L546] COND FALSE !(y < 10 && __VERIFIER_nondet_int()) [L554] p->h = 3 VAL [a={6:0}, i=0, p={6:0}, y=0] [L555] p->n = 0 VAL [a={6:0}, i=0, p={6:0}, y=0] [L556] i = 0 [L557] y = 0 [L558] p = a VAL [a={6:0}, i=0, p={6:0}, y=0] [L559] EXPR p->h VAL [a={6:0}, i=0, p={6:0}, y=0] [L559] COND FALSE !(p->h == 1) [L563] EXPR p->h VAL [a={6:0}, i=0, p={6:0}, y=0] [L563] COND FALSE !(p->h == 2) [L567] EXPR p->h VAL [a={6:0}, i=0, p={6:0}, y=0] [L567] COND TRUE p->h != 3 || (i + y) < 20 [L568] CALL reach_error() [L12] COND FALSE !(0) [L12] __assert_fail ("0", "list-ext.c", 3, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 572]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 575]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 38 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1021 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1021 mSDsluCounter, 1726 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1100 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1568 IncrementalHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 626 mSDtfsCounter, 1568 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=4, InterpolantAutomatonStates: 55, 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, 9 MinimizatonAttempts, 352 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 620 SizeOfPredicates, 37 NumberOfNonLiveVariables, 576 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 16/16 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-12 00:50:42,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f165065-e8c7-4a27-bea5-cc31305b76d4/bin/utaipan-verify-NcY6lQBIFX/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