./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/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_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/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 64bit --witnessprinter.graph.data.programhash 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 00:50:42,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 00:50:42,608 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2023-11-12 00:50:42,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 00:50:42,617 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 00:50:42,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 00:50:42,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 00:50:42,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 00:50:42,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 00:50:42,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 00:50:42,669 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 00:50:42,670 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 00:50:42,670 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 00:50:42,672 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 00:50:42,673 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 00:50:42,673 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 00:50:42,674 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 00:50:42,674 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 00:50:42,675 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 00:50:42,675 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 00:50:42,676 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 00:50:42,677 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 00:50:42,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 00:50:42,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 00:50:42,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 00:50:42,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 00:50:42,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 00:50:42,681 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 00:50:42,681 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 00:50:42,682 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 00:50:42,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 00:50:42,683 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 00:50:42,684 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 00:50:42,684 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 00:50:42,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 00:50:42,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 00:50:42,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:50:42,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 00:50:42,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 00:50:42,686 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 00:50:42,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 00:50:42,687 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 00:50:42,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 00:50:42,688 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_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/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_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 [2023-11-12 00:50:42,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 00:50:43,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 00:50:43,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 00:50:43,024 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 00:50:43,027 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 00:50:43,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2023-11-12 00:50:46,091 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 00:50:46,311 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 00:50:46,311 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2023-11-12 00:50:46,319 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/data/82c61cf33/237ddfd841f44713b52f7d0341fc255d/FLAG627ca90d4 [2023-11-12 00:50:46,337 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/data/82c61cf33/237ddfd841f44713b52f7d0341fc255d [2023-11-12 00:50:46,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 00:50:46,346 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 00:50:46,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 00:50:46,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 00:50:46,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 00:50:46,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:50:46" (1/1) ... [2023-11-12 00:50:46,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24aba5c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:46, skipping insertion in model container [2023-11-12 00:50:46,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:50:46" (1/1) ... [2023-11-12 00:50:46,385 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 00:50:46,632 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:50:46,643 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 00:50:46,656 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 00:50:46,671 INFO L206 MainTranslator]: Completed translation [2023-11-12 00:50:46,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:46 WrapperNode [2023-11-12 00:50:46,672 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 00:50:46,673 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 00:50:46,673 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 00:50:46,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 00:50:46,681 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:46" (1/1) ... [2023-11-12 00:50:46,690 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:46" (1/1) ... [2023-11-12 00:50:46,715 INFO L138 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2023-11-12 00:50:46,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 00:50:46,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 00:50:46,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 00:50:46,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 00:50:46,723 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:46" (1/1) ... [2023-11-12 00:50:46,724 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:46" (1/1) ... [2023-11-12 00:50:46,738 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:46" (1/1) ... [2023-11-12 00:50:46,740 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:46" (1/1) ... [2023-11-12 00:50:46,744 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:46" (1/1) ... [2023-11-12 00:50:46,746 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:46" (1/1) ... [2023-11-12 00:50:46,751 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:46" (1/1) ... [2023-11-12 00:50:46,752 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:46" (1/1) ... [2023-11-12 00:50:46,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 00:50:46,755 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 00:50:46,755 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 00:50:46,755 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 00:50:46,756 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:46" (1/1) ... [2023-11-12 00:50:46,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 00:50:46,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:50:46,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/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:46,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/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:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 00:50:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 00:50:46,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 00:50:46,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 00:50:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 00:50:46,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 00:50:46,903 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 00:50:46,904 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 00:50:47,218 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 00:50:47,250 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 00:50:47,250 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 00:50:47,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:50:47 BoogieIcfgContainer [2023-11-12 00:50:47,253 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 00:50:47,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 00:50:47,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 00:50:47,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 00:50:47,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:50:46" (1/3) ... [2023-11-12 00:50:47,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e82df82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:50:47, skipping insertion in model container [2023-11-12 00:50:47,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:46" (2/3) ... [2023-11-12 00:50:47,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e82df82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:50:47, skipping insertion in model container [2023-11-12 00:50:47,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:50:47" (3/3) ... [2023-11-12 00:50:47,265 INFO L112 eAbstractionObserver]: Analyzing ICFG 4BitCounterPointer.c [2023-11-12 00:50:47,311 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 00:50:47,312 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2023-11-12 00:50:47,394 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 00:50:47,402 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;@5fcf7398, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 00:50:47,402 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-11-12 00:50:47,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 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:47,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-12 00:50:47,413 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:47,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-12 00:50:47,415 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-12 00:50:47,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:47,421 INFO L85 PathProgramCache]: Analyzing trace with hash 3476, now seen corresponding path program 1 times [2023-11-12 00:50:47,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:50:47,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572786648] [2023-11-12 00:50:47,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:47,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:50:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:47,848 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:47,848 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:50:47,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572786648] [2023-11-12 00:50:47,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572786648] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:47,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:47,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:50:47,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119704524] [2023-11-12 00:50:47,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:47,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:50:47,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:50:47,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:50:47,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:50:47,890 INFO L87 Difference]: Start difference. First operand has 54 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:47,972 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2023-11-12 00:50:47,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:50:47,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-12 00:50:47,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:47,983 INFO L225 Difference]: With dead ends: 50 [2023-11-12 00:50:47,984 INFO L226 Difference]: Without dead ends: 49 [2023-11-12 00:50:47,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:50:47,989 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:47,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 20 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:50:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-12 00:50:48,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-12 00:50:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 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:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2023-11-12 00:50:48,023 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 2 [2023-11-12 00:50:48,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:48,024 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2023-11-12 00:50:48,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:48,024 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2023-11-12 00:50:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-12 00:50:48,025 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:48,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-12 00:50:48,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 00:50:48,026 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-12 00:50:48,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:48,027 INFO L85 PathProgramCache]: Analyzing trace with hash 3477, now seen corresponding path program 1 times [2023-11-12 00:50:48,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:50:48,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658084104] [2023-11-12 00:50:48,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:48,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:50:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:48,296 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:48,297 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:50:48,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658084104] [2023-11-12 00:50:48,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658084104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:48,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:48,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:50:48,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838825553] [2023-11-12 00:50:48,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:48,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:50:48,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:50:48,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:50:48,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:50:48,304 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:48,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:48,380 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2023-11-12 00:50:48,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:50:48,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-12 00:50:48,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:48,382 INFO L225 Difference]: With dead ends: 45 [2023-11-12 00:50:48,382 INFO L226 Difference]: Without dead ends: 45 [2023-11-12 00:50:48,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:50:48,384 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:48,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 21 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:50:48,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-12 00:50:48,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-11-12 00:50:48,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 44 states have internal predecessors, (48), 0 states have call successors, (0), 0 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:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2023-11-12 00:50:48,392 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 2 [2023-11-12 00:50:48,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:48,393 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2023-11-12 00:50:48,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:48,393 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2023-11-12 00:50:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-12 00:50:48,393 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:48,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-12 00:50:48,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 00:50:48,394 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-12 00:50:48,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:48,395 INFO L85 PathProgramCache]: Analyzing trace with hash 107732, now seen corresponding path program 1 times [2023-11-12 00:50:48,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:50:48,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253810897] [2023-11-12 00:50:48,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:48,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:50:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:48,504 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:48,504 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:50:48,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253810897] [2023-11-12 00:50:48,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253810897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:48,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:48,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:50:48,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017505559] [2023-11-12 00:50:48,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:48,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:50:48,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:50:48,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:50:48,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:50:48,509 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:48,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:48,581 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2023-11-12 00:50:48,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:50:48,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2023-11-12 00:50:48,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:48,583 INFO L225 Difference]: With dead ends: 41 [2023-11-12 00:50:48,583 INFO L226 Difference]: Without dead ends: 41 [2023-11-12 00:50:48,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:50:48,594 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:48,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 16 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:50:48,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-12 00:50:48,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-12 00:50:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 22 states have (on average 2.0) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 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:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2023-11-12 00:50:48,610 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 3 [2023-11-12 00:50:48,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:48,611 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2023-11-12 00:50:48,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:48,613 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2023-11-12 00:50:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-12 00:50:48,614 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:48,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-12 00:50:48,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 00:50:48,615 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-12 00:50:48,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:48,619 INFO L85 PathProgramCache]: Analyzing trace with hash 107733, now seen corresponding path program 1 times [2023-11-12 00:50:48,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:50:48,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127140370] [2023-11-12 00:50:48,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:48,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:50:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:48,819 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:48,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:50:48,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127140370] [2023-11-12 00:50:48,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127140370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:48,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:48,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:50:48,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901521714] [2023-11-12 00:50:48,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:48,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:50:48,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:50:48,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:50:48,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:50:48,823 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:48,882 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2023-11-12 00:50:48,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:50:48,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2023-11-12 00:50:48,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:48,884 INFO L225 Difference]: With dead ends: 37 [2023-11-12 00:50:48,884 INFO L226 Difference]: Without dead ends: 37 [2023-11-12 00:50:48,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:50:48,895 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:48,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 17 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:50:48,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-12 00:50:48,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-12 00:50:48,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:48,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2023-11-12 00:50:48,901 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 3 [2023-11-12 00:50:48,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:48,901 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2023-11-12 00:50:48,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2023-11-12 00:50:48,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-12 00:50:48,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:48,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-12 00:50:48,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 00:50:48,903 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-12 00:50:48,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:48,903 INFO L85 PathProgramCache]: Analyzing trace with hash 3339671, now seen corresponding path program 1 times [2023-11-12 00:50:48,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:50:48,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256282541] [2023-11-12 00:50:48,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:48,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:50:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:49,010 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:49,010 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:50:49,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256282541] [2023-11-12 00:50:49,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256282541] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:49,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:49,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:50:49,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155954754] [2023-11-12 00:50:49,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:49,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:50:49,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:50:49,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:50:49,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:50:49,013 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 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:49,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:49,062 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2023-11-12 00:50:49,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:50:49,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-11-12 00:50:49,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:49,066 INFO L225 Difference]: With dead ends: 33 [2023-11-12 00:50:49,066 INFO L226 Difference]: Without dead ends: 33 [2023-11-12 00:50:49,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:50:49,067 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:49,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 12 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:50:49,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-12 00:50:49,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-12 00:50:49,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:49,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2023-11-12 00:50:49,081 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 4 [2023-11-12 00:50:49,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:49,081 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2023-11-12 00:50:49,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 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:49,082 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2023-11-12 00:50:49,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-12 00:50:49,082 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:49,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-12 00:50:49,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 00:50:49,083 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-12 00:50:49,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:49,083 INFO L85 PathProgramCache]: Analyzing trace with hash 3339672, now seen corresponding path program 1 times [2023-11-12 00:50:49,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:50:49,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446489054] [2023-11-12 00:50:49,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:49,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:50:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:49,198 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:49,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:50:49,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446489054] [2023-11-12 00:50:49,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446489054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:49,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:49,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:50:49,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998754307] [2023-11-12 00:50:49,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:49,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:50:49,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:50:49,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:50:49,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:50:49,201 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 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:49,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:49,244 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2023-11-12 00:50:49,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:50:49,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2023-11-12 00:50:49,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:49,246 INFO L225 Difference]: With dead ends: 29 [2023-11-12 00:50:49,246 INFO L226 Difference]: Without dead ends: 29 [2023-11-12 00:50:49,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:50:49,251 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:49,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 13 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:50:49,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-12 00:50:49,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-12 00:50:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-11-12 00:50:49,256 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 4 [2023-11-12 00:50:49,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:49,261 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-11-12 00:50:49,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 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:49,262 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-11-12 00:50:49,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:50:49,263 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:49,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:50:49,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 00:50:49,263 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-12 00:50:49,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:49,264 INFO L85 PathProgramCache]: Analyzing trace with hash 103529783, now seen corresponding path program 1 times [2023-11-12 00:50:49,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:50:49,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382432701] [2023-11-12 00:50:49,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:49,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:50:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:49,326 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:49,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:50:49,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382432701] [2023-11-12 00:50:49,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382432701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:49,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:49,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:50:49,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193928329] [2023-11-12 00:50:49,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:49,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:50:49,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:50:49,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:50:49,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:50:49,330 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:49,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:49,366 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2023-11-12 00:50:49,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:50:49,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-12 00:50:49,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:49,371 INFO L225 Difference]: With dead ends: 26 [2023-11-12 00:50:49,371 INFO L226 Difference]: Without dead ends: 26 [2023-11-12 00:50:49,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:50:49,372 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:49,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 9 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:50:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-12 00:50:49,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-12 00:50:49,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 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:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-11-12 00:50:49,387 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 5 [2023-11-12 00:50:49,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:49,387 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-11-12 00:50:49,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:49,387 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-11-12 00:50:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 00:50:49,388 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:49,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 00:50:49,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 00:50:49,388 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-12 00:50:49,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:49,389 INFO L85 PathProgramCache]: Analyzing trace with hash 103529784, now seen corresponding path program 1 times [2023-11-12 00:50:49,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:50:49,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291940982] [2023-11-12 00:50:49,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:49,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:50:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:49,470 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:49,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:50:49,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291940982] [2023-11-12 00:50:49,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291940982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:49,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:49,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 00:50:49,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793931151] [2023-11-12 00:50:49,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:49,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 00:50:49,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:50:49,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 00:50:49,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:50:49,473 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:49,500 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2023-11-12 00:50:49,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 00:50:49,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-12 00:50:49,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:49,501 INFO L225 Difference]: With dead ends: 23 [2023-11-12 00:50:49,501 INFO L226 Difference]: Without dead ends: 23 [2023-11-12 00:50:49,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 00:50:49,503 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:49,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 10 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 00:50:49,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-12 00:50:49,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-12 00:50:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-11-12 00:50:49,510 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 5 [2023-11-12 00:50:49,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:49,510 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-11-12 00:50:49,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:49,511 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-11-12 00:50:49,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-12 00:50:49,511 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:49,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:50:49,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 00:50:49,512 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-12 00:50:49,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:49,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1661417693, now seen corresponding path program 1 times [2023-11-12 00:50:49,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:50:49,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730044574] [2023-11-12 00:50:49,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:49,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:50:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:49,601 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:49,601 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:50:49,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730044574] [2023-11-12 00:50:49,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730044574] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:50:49,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 00:50:49,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 00:50:49,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891903068] [2023-11-12 00:50:49,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:50:49,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 00:50:49,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:50:49,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 00:50:49,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 00:50:49,604 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:50:49,678 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2023-11-12 00:50:49,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 00:50:49,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-12 00:50:49,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:50:49,680 INFO L225 Difference]: With dead ends: 38 [2023-11-12 00:50:49,680 INFO L226 Difference]: Without dead ends: 38 [2023-11-12 00:50:49,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:49,681 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:50:49,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 35 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:50:49,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-12 00:50:49,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 25. [2023-11-12 00:50:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 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:49,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-11-12 00:50:49,685 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 9 [2023-11-12 00:50:49,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:50:49,686 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-11-12 00:50:49,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:50:49,686 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-11-12 00:50:49,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 00:50:49,687 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:50:49,687 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:50:49,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 00:50:49,688 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-12 00:50:49,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:50:49,688 INFO L85 PathProgramCache]: Analyzing trace with hash -723063482, now seen corresponding path program 1 times [2023-11-12 00:50:49,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:50:49,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825196103] [2023-11-12 00:50:49,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:49,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:50:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:49,959 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:49,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:50:49,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825196103] [2023-11-12 00:50:49,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825196103] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:50:49,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385251642] [2023-11-12 00:50:49,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:50:49,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:50:49,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:50:49,967 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:50:49,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 00:50:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:50:50,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-12 00:50:50,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:50:50,171 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-12 00:50:50,172 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 218 treesize of output 211 [2023-11-12 00:50:50,268 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:50,305 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:50:50,315 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:50,315 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:50:50,337 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_158 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_158) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2023-11-12 00:50:50,363 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:50:50,363 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-11-12 00:50:50,367 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 30 treesize of output 22 [2023-11-12 00:50:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-12 00:50:50,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385251642] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:50:50,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [256557369] [2023-11-12 00:50:50,398 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-11-12 00:50:50,398 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:50:50,403 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:50:50,408 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:50:50,409 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:50:55,063 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:51:01,095 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '803#(and (= 0 |ULTIMATE.start_main_~x3~0#1.offset|) (<= 1 |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (<= 2 |ULTIMATE.start_main_~x1~0#1.base|) (= |ULTIMATE.start_main_~x1~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~x0~0#1.base|) (<= 2 |ULTIMATE.start_main_~x3~0#1.base|) (= |ULTIMATE.start_main_~x0~0#1.offset| 0) (= |ULTIMATE.start_main_~x2~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~x3~0#1.base|)) (<= 2 |ULTIMATE.start_main_~x2~0#1.base|) (exists ((|v_ULTIMATE.start_main_#t~malloc1#1.base_10| Int) (|v_#valid_53| (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_10| Int) (|v_ULTIMATE.start_main_#t~malloc2#1.base_10| Int) (|v_ULTIMATE.start_main_#t~malloc0#1.base_10| Int)) (and (<= 2 |v_ULTIMATE.start_main_#t~malloc3#1.base_10|) (<= 2 |v_ULTIMATE.start_main_#t~malloc0#1.base_10|) (<= 2 |v_ULTIMATE.start_main_#t~malloc1#1.base_10|) (<= 2 |v_ULTIMATE.start_main_#t~malloc2#1.base_10|) (= (store (store (store (store |v_#valid_53| |v_ULTIMATE.start_main_#t~malloc0#1.base_10| 0) |v_ULTIMATE.start_main_#t~malloc1#1.base_10| 0) |v_ULTIMATE.start_main_#t~malloc2#1.base_10| 0) |v_ULTIMATE.start_main_#t~malloc3#1.base_10| 0) |#valid|) (= (select |v_#valid_53| |ULTIMATE.start_main_~x3~0#1.base|) 1))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~x3~0#1.base|) 0) 0)) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2023-11-12 00:51:01,096 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:51:01,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:51:01,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2023-11-12 00:51:01,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296313141] [2023-11-12 00:51:01,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:51:01,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 00:51:01,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:01,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 00:51:01,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=276, Unknown=5, NotChecked=34, Total=380 [2023-11-12 00:51:01,099 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:01,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:01,205 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2023-11-12 00:51:01,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 00:51:01,206 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-12 00:51:01,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:01,206 INFO L225 Difference]: With dead ends: 27 [2023-11-12 00:51:01,206 INFO L226 Difference]: Without dead ends: 27 [2023-11-12 00:51:01,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=72, Invalid=307, Unknown=5, NotChecked=36, Total=420 [2023-11-12 00:51:01,207 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:01,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 32 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 23 Unchecked, 0.1s Time] [2023-11-12 00:51:01,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-12 00:51:01,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2023-11-12 00:51:01,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 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:51:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-11-12 00:51:01,211 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2023-11-12 00:51:01,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:01,211 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-11-12 00:51:01,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:01,212 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-11-12 00:51:01,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 00:51:01,212 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:01,213 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:01,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 00:51:01,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-12 00:51:01,414 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-12 00:51:01,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:01,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1100115378, now seen corresponding path program 1 times [2023-11-12 00:51:01,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:01,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89971550] [2023-11-12 00:51:01,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:01,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:01,969 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:51:01,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:01,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89971550] [2023-11-12 00:51:01,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89971550] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:51:01,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148354813] [2023-11-12 00:51:01,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:01,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:51:01,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:51:01,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:51:01,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 00:51:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:02,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-12 00:51:02,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:51:02,085 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-12 00:51:02,129 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:51:02,172 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:51:02,230 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-12 00:51:02,230 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 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-12 00:51:02,292 INFO L322 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-12 00:51:02,292 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2023-11-12 00:51:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:51:02,382 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 00:51:02,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148354813] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 00:51:02,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-12 00:51:02,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2023-11-12 00:51:02,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486177137] [2023-11-12 00:51:02,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 00:51:02,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 00:51:02,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:02,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 00:51:02,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-11-12 00:51:02,385 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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:51:02,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:02,494 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2023-11-12 00:51:02,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 00:51:02,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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:51:02,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:02,497 INFO L225 Difference]: With dead ends: 35 [2023-11-12 00:51:02,497 INFO L226 Difference]: Without dead ends: 35 [2023-11-12 00:51:02,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-11-12 00:51:02,498 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 25 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:02,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 35 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 00:51:02,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-12 00:51:02,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2023-11-12 00:51:02,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:51:02,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-11-12 00:51:02,504 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 17 [2023-11-12 00:51:02,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:02,505 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-11-12 00:51:02,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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:51:02,505 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-11-12 00:51:02,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-12 00:51:02,506 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:02,506 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:02,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 00:51:02,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-12 00:51:02,713 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-12 00:51:02,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:02,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1385146651, now seen corresponding path program 1 times [2023-11-12 00:51:02,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:02,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851944678] [2023-11-12 00:51:02,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:02,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:51:03,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:03,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851944678] [2023-11-12 00:51:03,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851944678] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:51:03,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030204936] [2023-11-12 00:51:03,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:03,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:51:03,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:51:03,423 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:51:03,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 00:51:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:03,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-12 00:51:03,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:51:03,540 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 105 treesize of output 101 [2023-11-12 00:51:03,638 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:51:03,797 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 00:51:03,797 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 20 [2023-11-12 00:51:03,855 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:51:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:51:03,886 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:51:03,897 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_273 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_273) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|))) is different from false [2023-11-12 00:51:04,100 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 129 treesize of output 117 [2023-11-12 00:51:04,108 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 13 [2023-11-12 00:51:04,119 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 20 [2023-11-12 00:51:04,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:51:04,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030204936] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:51:04,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [549887744] [2023-11-12 00:51:04,220 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2023-11-12 00:51:04,220 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:51:04,221 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:51:04,221 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:51:04,221 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:51:09,516 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:51:14,551 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1152#(and (= 0 |ULTIMATE.start_main_~x3~0#1.offset|) (<= 1 |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (exists ((|v_ULTIMATE.start_main_#t~malloc1#1.base_11| Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_11| Int) (|v_ULTIMATE.start_main_#t~malloc2#1.base_11| Int) (|v_ULTIMATE.start_main_#t~malloc0#1.base_11| Int) (|v_#valid_58| (Array Int Int))) (and (<= 2 |v_ULTIMATE.start_main_#t~malloc2#1.base_11|) (= (select |v_#valid_58| |ULTIMATE.start_main_~x3~0#1.base|) 1) (<= 2 |v_ULTIMATE.start_main_#t~malloc3#1.base_11|) (<= 2 |v_ULTIMATE.start_main_#t~malloc1#1.base_11|) (<= 2 |v_ULTIMATE.start_main_#t~malloc0#1.base_11|) (= |#valid| (store (store (store (store |v_#valid_58| |v_ULTIMATE.start_main_#t~malloc0#1.base_11| 0) |v_ULTIMATE.start_main_#t~malloc1#1.base_11| 0) |v_ULTIMATE.start_main_#t~malloc2#1.base_11| 0) |v_ULTIMATE.start_main_#t~malloc3#1.base_11| 0)))) (<= 2 |ULTIMATE.start_main_~x1~0#1.base|) (= |ULTIMATE.start_main_~x1~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~x0~0#1.base|) (<= 2 |ULTIMATE.start_main_~x3~0#1.base|) (= |ULTIMATE.start_main_~x0~0#1.offset| 0) (= |ULTIMATE.start_main_~x2~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~x3~0#1.base|)) (<= 2 |ULTIMATE.start_main_~x2~0#1.base|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~x3~0#1.base|) 0) 0)) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2023-11-12 00:51:14,551 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:51:14,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:51:14,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 23 [2023-11-12 00:51:14,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436983772] [2023-11-12 00:51:14,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:51:14,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-12 00:51:14,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:14,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-12 00:51:14,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1273, Unknown=19, NotChecked=74, Total=1560 [2023-11-12 00:51:14,554 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 24 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 23 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:51:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:17,245 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2023-11-12 00:51:17,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-12 00:51:17,246 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 23 states have internal predecessors, (59), 0 states have call successors, (0), 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 22 [2023-11-12 00:51:17,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:17,247 INFO L225 Difference]: With dead ends: 40 [2023-11-12 00:51:17,247 INFO L226 Difference]: Without dead ends: 40 [2023-11-12 00:51:17,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=385, Invalid=2049, Unknown=20, NotChecked=96, Total=2550 [2023-11-12 00:51:17,249 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 51 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:17,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 68 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 224 Invalid, 0 Unknown, 38 Unchecked, 0.3s Time] [2023-11-12 00:51:17,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-12 00:51:17,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2023-11-12 00:51:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 00:51:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-11-12 00:51:17,251 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 22 [2023-11-12 00:51:17,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:17,252 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-11-12 00:51:17,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 23 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:51:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-11-12 00:51:17,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-12 00:51:17,253 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:17,253 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:17,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-12 00:51:17,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-12 00:51:17,459 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-12 00:51:17,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:17,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1435305227, now seen corresponding path program 1 times [2023-11-12 00:51:17,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:17,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115042195] [2023-11-12 00:51:17,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:17,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:51:18,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:18,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115042195] [2023-11-12 00:51:18,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115042195] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:51:18,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860692440] [2023-11-12 00:51:18,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:18,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:51:18,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:51:18,018 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:51:18,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 00:51:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:18,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-12 00:51:18,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:51:18,150 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 152 treesize of output 144 [2023-11-12 00:51:18,219 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:51:18,323 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-12 00:51:18,324 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-11-12 00:51:18,548 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 00:51:18,548 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 20 [2023-11-12 00:51:18,681 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-12 00:51:18,682 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 21 [2023-11-12 00:51:18,737 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 00:51:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:51:18,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:51:18,821 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_339 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_339) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|))) is different from false [2023-11-12 00:51:25,536 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:51:25,536 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 42 [2023-11-12 00:51:25,552 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:51:25,553 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 507 treesize of output 494 [2023-11-12 00:51:25,573 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 54 treesize of output 50 [2023-11-12 00:51:25,584 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 96 treesize of output 88 [2023-11-12 00:51:25,601 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:51:25,602 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 51 treesize of output 55 [2023-11-12 00:51:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 00:51:25,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860692440] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:51:25,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [212237824] [2023-11-12 00:51:25,806 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2023-11-12 00:51:25,806 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:51:25,806 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:51:25,806 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:51:25,807 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-12 00:51:32,511 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-12 00:51:36,639 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1433#(and (= 0 |ULTIMATE.start_main_~x3~0#1.offset|) (<= 1 |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_old_#valid#1| |#valid|)) (<= 2 |ULTIMATE.start_main_~x1~0#1.base|) (= |ULTIMATE.start_main_~x1~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~x0~0#1.base|) (<= 2 |ULTIMATE.start_main_~x3~0#1.base|) (= |ULTIMATE.start_main_~x0~0#1.offset| 0) (= |ULTIMATE.start_main_~x2~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~x3~0#1.base|)) (exists ((|v_#valid_62| (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_12| Int) (|v_ULTIMATE.start_main_#t~malloc2#1.base_12| Int) (|v_ULTIMATE.start_main_#t~malloc0#1.base_12| Int) (|v_ULTIMATE.start_main_#t~malloc1#1.base_12| Int)) (and (= (store (store (store (store |v_#valid_62| |v_ULTIMATE.start_main_#t~malloc0#1.base_12| 0) |v_ULTIMATE.start_main_#t~malloc1#1.base_12| 0) |v_ULTIMATE.start_main_#t~malloc2#1.base_12| 0) |v_ULTIMATE.start_main_#t~malloc3#1.base_12| 0) |#valid|) (<= 2 |v_ULTIMATE.start_main_#t~malloc2#1.base_12|) (= (select |v_#valid_62| |ULTIMATE.start_main_~x3~0#1.base|) 1) (<= 2 |v_ULTIMATE.start_main_#t~malloc3#1.base_12|) (<= 2 |v_ULTIMATE.start_main_#t~malloc1#1.base_12|) (<= 2 |v_ULTIMATE.start_main_#t~malloc0#1.base_12|))) (<= 2 |ULTIMATE.start_main_~x2~0#1.base|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~x3~0#1.base|) 0) 0)) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2023-11-12 00:51:36,639 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-12 00:51:36,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-12 00:51:36,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 28 [2023-11-12 00:51:36,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826339097] [2023-11-12 00:51:36,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-12 00:51:36,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-12 00:51:36,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 00:51:36,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-12 00:51:36,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1886, Unknown=45, NotChecked=90, Total=2256 [2023-11-12 00:51:36,643 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 29 states, 29 states have (on average 2.413793103448276) internal successors, (70), 28 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:51:39,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 00:51:39,970 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2023-11-12 00:51:39,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-12 00:51:39,971 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.413793103448276) internal successors, (70), 28 states have internal predecessors, (70), 0 states have call successors, (0), 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 25 [2023-11-12 00:51:39,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 00:51:39,971 INFO L225 Difference]: With dead ends: 65 [2023-11-12 00:51:39,972 INFO L226 Difference]: Without dead ends: 65 [2023-11-12 00:51:39,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=807, Invalid=4484, Unknown=115, NotChecked=144, Total=5550 [2023-11-12 00:51:39,975 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 187 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 96 mSolverCounterUnsat, 72 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 72 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-12 00:51:39,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 76 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 318 Invalid, 72 Unknown, 65 Unchecked, 0.9s Time] [2023-11-12 00:51:39,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-12 00:51:39,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 41. [2023-11-12 00:51:39,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 0 states have call successors, (0), 0 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:51:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2023-11-12 00:51:39,979 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 25 [2023-11-12 00:51:39,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 00:51:39,979 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2023-11-12 00:51:39,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.413793103448276) internal successors, (70), 28 states have internal predecessors, (70), 0 states have call successors, (0), 0 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:51:39,980 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2023-11-12 00:51:39,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-12 00:51:39,981 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 00:51:39,981 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 00:51:39,992 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 00:51:40,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-12 00:51:40,188 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-11-12 00:51:40,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 00:51:40,188 INFO L85 PathProgramCache]: Analyzing trace with hash -275586710, now seen corresponding path program 1 times [2023-11-12 00:51:40,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 00:51:40,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005103726] [2023-11-12 00:51:40,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:40,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 00:51:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-12 00:51:41,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 00:51:41,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005103726] [2023-11-12 00:51:41,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005103726] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 00:51:41,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521245252] [2023-11-12 00:51:41,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 00:51:41,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 00:51:41,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 00:51:41,259 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 00:51:41,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_029e0b67-88f6-4b2c-8ce8-1e258afe5fca/bin/utaipan-verify-NcY6lQBIFX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 00:51:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 00:51:41,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-12 00:51:41,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 00:51:41,421 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 98 treesize of output 94 [2023-11-12 00:51:41,480 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:51:41,542 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:51:41,542 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-12 00:51:41,670 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:51:41,671 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2023-11-12 00:51:41,852 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:51:41,852 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2023-11-12 00:51:41,934 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2023-11-12 00:51:42,095 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-12 00:51:42,096 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2023-11-12 00:51:42,327 INFO L322 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2023-11-12 00:51:42,328 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2023-11-12 00:51:42,471 INFO L322 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-12 00:51:42,471 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2023-11-12 00:51:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-12 00:51:42,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 00:51:42,565 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0)) is different from false [2023-11-12 00:51:42,815 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_420 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_420 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_420) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) is different from false [2023-11-12 00:51:42,878 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_419 (Array Int Int)) (v_ArrVal_420 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_419) |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_420) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_420 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0))) is different from false [2023-11-12 00:51:42,963 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_419 (Array Int Int)) (v_ArrVal_420 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_420 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_419) |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_420) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) is different from false [2023-11-12 00:51:43,020 WARN L854 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (v_ArrVal_416 (Array Int Int)) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_419 (Array Int Int)) (v_ArrVal_420 (Array Int Int)) (v_ArrVal_423 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_416))) (or (= (select (select (store (store .cse0 |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_420 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_423) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_419) |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_420) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))))) is different from false [2023-11-12 00:51:43,031 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:51:43,031 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 45 [2023-11-12 00:51:43,037 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 1076 treesize of output 1040 [2023-11-12 00:51:43,059 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:51:43,060 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 118 treesize of output 118 [2023-11-12 00:51:43,077 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 00:51:43,078 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 100 treesize of output 104 [2023-11-12 00:51:43,087 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 48 treesize of output 46 [2023-11-12 00:51:43,098 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 54 treesize of output 46 [2023-11-12 00:51:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2023-11-12 00:51:43,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521245252] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-12 00:51:43,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [685259613] [2023-11-12 00:51:43,432 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2023-11-12 00:51:43,432 INFO L166 IcfgInterpreter]: Building call graph [2023-11-12 00:51:43,432 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-12 00:51:43,432 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-12 00:51:43,433 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs