./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4f531da4514da78f664dbd663145b26ee24930c7e93acdc31160c6cc4e4d5de8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 05:23:45,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 05:23:45,155 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2023-11-19 05:23:45,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 05:23:45,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 05:23:45,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 05:23:45,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 05:23:45,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 05:23:45,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 05:23:45,191 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 05:23:45,191 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-19 05:23:45,192 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-19 05:23:45,193 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-19 05:23:45,193 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-19 05:23:45,196 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-19 05:23:45,197 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-19 05:23:45,199 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-19 05:23:45,204 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-19 05:23:45,204 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-19 05:23:45,205 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-19 05:23:45,207 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-19 05:23:45,207 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-19 05:23:45,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 05:23:45,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 05:23:45,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 05:23:45,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 05:23:45,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 05:23:45,211 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 05:23:45,211 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 05:23:45,212 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 05:23:45,212 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 05:23:45,213 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 05:23:45,213 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 05:23:45,214 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 05:23:45,214 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 05:23:45,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 05:23:45,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:23:45,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 05:23:45,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 05:23:45,216 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-19 05:23:45,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 05:23:45,217 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-19 05:23:45,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 05:23:45,217 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_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f531da4514da78f664dbd663145b26ee24930c7e93acdc31160c6cc4e4d5de8 [2023-11-19 05:23:45,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 05:23:45,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 05:23:45,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 05:23:45,595 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 05:23:45,597 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 05:23:45,598 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i [2023-11-19 05:23:48,681 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 05:23:48,899 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 05:23:48,899 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i [2023-11-19 05:23:48,907 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/data/8d96d6cff/3e23ae1913bd476db27a9b4fc574318f/FLAGf731ff06a [2023-11-19 05:23:48,930 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/data/8d96d6cff/3e23ae1913bd476db27a9b4fc574318f [2023-11-19 05:23:48,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 05:23:48,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 05:23:48,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 05:23:48,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 05:23:48,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 05:23:48,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:23:48" (1/1) ... [2023-11-19 05:23:48,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17cc7b64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:48, skipping insertion in model container [2023-11-19 05:23:48,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:23:48" (1/1) ... [2023-11-19 05:23:48,969 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 05:23:49,154 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:23:49,162 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 05:23:49,174 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 05:23:49,186 INFO L206 MainTranslator]: Completed translation [2023-11-19 05:23:49,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49 WrapperNode [2023-11-19 05:23:49,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 05:23:49,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 05:23:49,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 05:23:49,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 05:23:49,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2023-11-19 05:23:49,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2023-11-19 05:23:49,225 INFO L138 Inliner]: procedures = 13, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 39 [2023-11-19 05:23:49,225 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 05:23:49,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 05:23:49,226 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 05:23:49,226 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 05:23:49,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2023-11-19 05:23:49,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2023-11-19 05:23:49,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2023-11-19 05:23:49,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2023-11-19 05:23:49,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2023-11-19 05:23:49,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2023-11-19 05:23:49,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2023-11-19 05:23:49,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2023-11-19 05:23:49,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 05:23:49,266 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 05:23:49,266 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 05:23:49,266 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 05:23:49,267 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (1/1) ... [2023-11-19 05:23:49,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 05:23:49,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:23:49,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 05:23:49,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 05:23:49,336 INFO L130 BoogieDeclarations]: Found specification of procedure rec_strcopy_helper [2023-11-19 05:23:49,336 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_strcopy_helper [2023-11-19 05:23:49,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 05:23:49,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 05:23:49,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 05:23:49,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 05:23:49,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 05:23:49,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 05:23:49,410 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 05:23:49,412 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 05:23:49,671 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 05:23:49,722 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 05:23:49,722 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 05:23:49,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:23:49 BoogieIcfgContainer [2023-11-19 05:23:49,727 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 05:23:49,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 05:23:49,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 05:23:49,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 05:23:49,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:23:48" (1/3) ... [2023-11-19 05:23:49,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1d2437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:23:49, skipping insertion in model container [2023-11-19 05:23:49,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:23:49" (2/3) ... [2023-11-19 05:23:49,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1d2437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:23:49, skipping insertion in model container [2023-11-19 05:23:49,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:23:49" (3/3) ... [2023-11-19 05:23:49,736 INFO L112 eAbstractionObserver]: Analyzing ICFG rec_strcopy_malloc.i [2023-11-19 05:23:49,755 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 05:23:49,755 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2023-11-19 05:23:49,803 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 05:23:49,810 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;@e0936a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-19 05:23:49,810 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-11-19 05:23:49,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 16 states have (on average 2.0) internal successors, (32), 32 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:23:49,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-19 05:23:49,820 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:49,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-19 05:23:49,822 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-19 05:23:49,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:49,827 INFO L85 PathProgramCache]: Analyzing trace with hash 3068, now seen corresponding path program 1 times [2023-11-19 05:23:49,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:49,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160953005] [2023-11-19 05:23:49,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:49,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:50,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:50,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:50,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160953005] [2023-11-19 05:23:50,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160953005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:50,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:50,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 05:23:50,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51757159] [2023-11-19 05:23:50,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:50,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:23:50,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:50,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:23:50,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:23:50,219 INFO L87 Difference]: Start difference. First operand has 35 states, 16 states have (on average 2.0) internal successors, (32), 32 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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-19 05:23:50,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:50,298 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2023-11-19 05:23:50,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:23:50,300 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-19 05:23:50,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:50,309 INFO L225 Difference]: With dead ends: 34 [2023-11-19 05:23:50,309 INFO L226 Difference]: Without dead ends: 33 [2023-11-19 05:23:50,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:23:50,315 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:50,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:23:50,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-19 05:23:50,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-19 05:23:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 16 states have (on average 1.875) internal successors, (30), 30 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:23:50,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2023-11-19 05:23:50,354 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 2 [2023-11-19 05:23:50,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:50,354 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2023-11-19 05:23:50,354 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-19 05:23:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2023-11-19 05:23:50,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-19 05:23:50,355 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:50,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-19 05:23:50,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 05:23:50,356 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-19 05:23:50,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:50,357 INFO L85 PathProgramCache]: Analyzing trace with hash 3069, now seen corresponding path program 1 times [2023-11-19 05:23:50,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:50,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581735986] [2023-11-19 05:23:50,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:50,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:50,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:50,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:50,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581735986] [2023-11-19 05:23:50,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581735986] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:50,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:50,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 05:23:50,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996438087] [2023-11-19 05:23:50,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:50,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 05:23:50,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:50,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 05:23:50,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:23:50,627 INFO L87 Difference]: Start difference. First operand 33 states and 34 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-19 05:23:50,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:50,667 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2023-11-19 05:23:50,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 05:23:50,668 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-19 05:23:50,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:50,669 INFO L225 Difference]: With dead ends: 32 [2023-11-19 05:23:50,669 INFO L226 Difference]: Without dead ends: 32 [2023-11-19 05:23:50,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 05:23:50,671 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:50,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:23:50,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-19 05:23:50,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-19 05:23:50,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.8125) internal successors, (29), 29 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:23:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2023-11-19 05:23:50,681 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 2 [2023-11-19 05:23:50,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:50,681 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2023-11-19 05:23:50,681 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-19 05:23:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2023-11-19 05:23:50,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 05:23:50,682 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:50,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 05:23:50,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 05:23:50,683 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-19 05:23:50,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:50,684 INFO L85 PathProgramCache]: Analyzing trace with hash 92347297, now seen corresponding path program 1 times [2023-11-19 05:23:50,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:50,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117774558] [2023-11-19 05:23:50,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:50,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:50,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:50,920 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:50,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117774558] [2023-11-19 05:23:50,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117774558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:50,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:50,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:23:50,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842841891] [2023-11-19 05:23:50,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:50,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:23:50,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:50,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:23:50,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:23:50,928 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:51,040 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2023-11-19 05:23:51,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:23:51,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-19 05:23:51,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:51,044 INFO L225 Difference]: With dead ends: 30 [2023-11-19 05:23:51,044 INFO L226 Difference]: Without dead ends: 30 [2023-11-19 05:23:51,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:23:51,050 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:51,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 59 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:23:51,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-19 05:23:51,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-19 05:23:51,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 16 states have (on average 1.6875) internal successors, (27), 27 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 05:23:51,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2023-11-19 05:23:51,065 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 5 [2023-11-19 05:23:51,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:51,067 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2023-11-19 05:23:51,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2023-11-19 05:23:51,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-19 05:23:51,070 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:51,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 05:23:51,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 05:23:51,071 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-19 05:23:51,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash 92347298, now seen corresponding path program 1 times [2023-11-19 05:23:51,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:51,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847054272] [2023-11-19 05:23:51,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:51,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:51,407 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:51,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847054272] [2023-11-19 05:23:51,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847054272] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:51,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:51,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:23:51,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524027925] [2023-11-19 05:23:51,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:51,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:23:51,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:51,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:23:51,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:23:51,411 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:51,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:51,495 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2023-11-19 05:23:51,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:23:51,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-19 05:23:51,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:51,497 INFO L225 Difference]: With dead ends: 39 [2023-11-19 05:23:51,497 INFO L226 Difference]: Without dead ends: 39 [2023-11-19 05:23:51,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:23:51,499 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:51,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 84 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:23:51,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-19 05:23:51,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2023-11-19 05:23:51,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 33 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:23:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2023-11-19 05:23:51,508 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 5 [2023-11-19 05:23:51,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:51,508 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-11-19 05:23:51,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2023-11-19 05:23:51,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 05:23:51,509 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:51,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 05:23:51,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 05:23:51,510 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-19 05:23:51,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:51,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1432201115, now seen corresponding path program 1 times [2023-11-19 05:23:51,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:51,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731647027] [2023-11-19 05:23:51,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:51,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:51,572 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:51,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731647027] [2023-11-19 05:23:51,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731647027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:51,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:51,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:23:51,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280360806] [2023-11-19 05:23:51,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:51,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:23:51,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:51,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:23:51,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:23:51,575 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:51,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:51,628 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2023-11-19 05:23:51,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 05:23:51,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-19 05:23:51,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:51,630 INFO L225 Difference]: With dead ends: 36 [2023-11-19 05:23:51,630 INFO L226 Difference]: Without dead ends: 36 [2023-11-19 05:23:51,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:23:51,632 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 16 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:51,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 47 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:23:51,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-19 05:23:51,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-19 05:23:51,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.5) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:23:51,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2023-11-19 05:23:51,639 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 6 [2023-11-19 05:23:51,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:51,639 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2023-11-19 05:23:51,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:51,640 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2023-11-19 05:23:51,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-19 05:23:51,640 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:51,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-19 05:23:51,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 05:23:51,641 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting rec_strcopy_helperErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-19 05:23:51,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:51,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1432201114, now seen corresponding path program 1 times [2023-11-19 05:23:51,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:51,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16060025] [2023-11-19 05:23:51,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:51,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:51,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:51,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:51,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16060025] [2023-11-19 05:23:51,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16060025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:51,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:51,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:23:51,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094031868] [2023-11-19 05:23:51,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:51,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 05:23:51,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:51,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 05:23:51,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 05:23:51,859 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:51,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:51,951 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2023-11-19 05:23:51,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:23:51,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-19 05:23:51,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:51,956 INFO L225 Difference]: With dead ends: 36 [2023-11-19 05:23:51,957 INFO L226 Difference]: Without dead ends: 36 [2023-11-19 05:23:51,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:23:51,960 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:51,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 87 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 05:23:51,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-19 05:23:51,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-19 05:23:51,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 32 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 05:23:51,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2023-11-19 05:23:51,983 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 6 [2023-11-19 05:23:51,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:51,983 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2023-11-19 05:23:51,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:51,984 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2023-11-19 05:23:51,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 05:23:51,984 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:51,984 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:23:51,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 05:23:51,985 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-19 05:23:51,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:51,986 INFO L85 PathProgramCache]: Analyzing trace with hash -483799689, now seen corresponding path program 1 times [2023-11-19 05:23:51,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:51,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263599250] [2023-11-19 05:23:51,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:51,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:52,585 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-19 05:23:52,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:52,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263599250] [2023-11-19 05:23:52,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263599250] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:23:52,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656846604] [2023-11-19 05:23:52,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:52,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:23:52,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:23:52,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:23:52,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 05:23:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:52,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-19 05:23:52,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:23:52,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 05:23:52,844 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 05:23:52,846 INFO L378 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 11 treesize of output 11 [2023-11-19 05:23:52,862 INFO L378 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 14 treesize of output 10 [2023-11-19 05:23:52,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-19 05:23:53,237 INFO L378 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 18 treesize of output 13 [2023-11-19 05:23:53,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:23:53,344 INFO L378 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 17 treesize of output 15 [2023-11-19 05:23:53,515 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-19 05:23:53,516 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:23:54,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:23:54,043 INFO L378 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 21 treesize of output 22 [2023-11-19 05:23:54,053 INFO L378 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 29 treesize of output 25 [2023-11-19 05:23:54,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:23:54,072 INFO L378 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 33 treesize of output 30 [2023-11-19 05:23:54,086 INFO L378 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 9 treesize of output 7 [2023-11-19 05:23:54,202 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-19 05:23:54,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656846604] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:23:54,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1470694483] [2023-11-19 05:23:54,223 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-19 05:23:54,223 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:23:54,229 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-19 05:23:54,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:23:54,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-11-19 05:23:54,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15054433] [2023-11-19 05:23:54,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:23:54,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-19 05:23:54,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:54,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-19 05:23:54,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=863, Unknown=2, NotChecked=0, Total=992 [2023-11-19 05:23:54,237 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 32 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:54,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:54,790 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2023-11-19 05:23:54,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-19 05:23:54,791 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-19 05:23:54,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:54,793 INFO L225 Difference]: With dead ends: 47 [2023-11-19 05:23:54,794 INFO L226 Difference]: Without dead ends: 47 [2023-11-19 05:23:54,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=198, Invalid=1206, Unknown=2, NotChecked=0, Total=1406 [2023-11-19 05:23:54,796 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 58 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:54,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 269 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 05:23:54,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-19 05:23:54,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2023-11-19 05:23:54,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 39 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 05:23:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2023-11-19 05:23:54,816 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 11 [2023-11-19 05:23:54,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:54,816 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2023-11-19 05:23:54,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:54,817 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2023-11-19 05:23:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 05:23:54,817 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:54,817 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:23:54,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 05:23:55,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:23:55,034 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting rec_strcopy_helperErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-19 05:23:55,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:55,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2112888527, now seen corresponding path program 1 times [2023-11-19 05:23:55,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:55,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053452993] [2023-11-19 05:23:55,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:55,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:55,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:55,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053452993] [2023-11-19 05:23:55,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053452993] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:23:55,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103320038] [2023-11-19 05:23:55,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:55,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:23:55,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:23:55,642 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:23:55,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 05:23:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:55,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-19 05:23:55,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:23:55,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-19 05:23:55,826 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-19 05:23:55,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 [2023-11-19 05:23:56,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:56,220 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:23:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:56,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103320038] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:23:56,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1213694046] [2023-11-19 05:23:56,677 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-19 05:23:56,677 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:23:56,678 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-19 05:23:56,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:23:56,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2023-11-19 05:23:56,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836157876] [2023-11-19 05:23:56,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:23:56,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-19 05:23:56,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:56,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-19 05:23:56,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2023-11-19 05:23:56,687 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 27 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:57,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:57,169 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2023-11-19 05:23:57,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 05:23:57,170 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-19 05:23:57,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:57,171 INFO L225 Difference]: With dead ends: 43 [2023-11-19 05:23:57,171 INFO L226 Difference]: Without dead ends: 43 [2023-11-19 05:23:57,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2023-11-19 05:23:57,173 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 122 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:57,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 261 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 05:23:57,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-19 05:23:57,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-19 05:23:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 38 states have internal predecessors, (38), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 05:23:57,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2023-11-19 05:23:57,177 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 12 [2023-11-19 05:23:57,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:57,178 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2023-11-19 05:23:57,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:23:57,179 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2023-11-19 05:23:57,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 05:23:57,179 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:57,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:23:57,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-19 05:23:57,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:23:57,390 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-19 05:23:57,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:57,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2111162600, now seen corresponding path program 1 times [2023-11-19 05:23:57,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:57,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921753890] [2023-11-19 05:23:57,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:57,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:57,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:57,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921753890] [2023-11-19 05:23:57,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921753890] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:57,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:57,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:23:57,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472268960] [2023-11-19 05:23:57,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:57,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:23:57,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:57,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:23:57,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:23:57,449 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:23:57,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:57,463 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2023-11-19 05:23:57,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:23:57,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-11-19 05:23:57,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:57,464 INFO L225 Difference]: With dead ends: 42 [2023-11-19 05:23:57,465 INFO L226 Difference]: Without dead ends: 42 [2023-11-19 05:23:57,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:23:57,468 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:57,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 54 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:23:57,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-19 05:23:57,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-19 05:23:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 37 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 05:23:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2023-11-19 05:23:57,475 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 12 [2023-11-19 05:23:57,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:57,476 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2023-11-19 05:23:57,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:23:57,476 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2023-11-19 05:23:57,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-19 05:23:57,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:57,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:23:57,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 05:23:57,478 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-19 05:23:57,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:57,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1021531088, now seen corresponding path program 1 times [2023-11-19 05:23:57,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:57,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101470573] [2023-11-19 05:23:57,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:57,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:57,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:57,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:57,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101470573] [2023-11-19 05:23:57,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101470573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:57,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:57,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:23:57,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152037789] [2023-11-19 05:23:57,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:57,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:23:57,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:57,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:23:57,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:23:57,531 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:23:57,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:57,557 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2023-11-19 05:23:57,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:23:57,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-11-19 05:23:57,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:57,559 INFO L225 Difference]: With dead ends: 41 [2023-11-19 05:23:57,559 INFO L226 Difference]: Without dead ends: 41 [2023-11-19 05:23:57,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:23:57,560 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:57,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 41 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:23:57,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-19 05:23:57,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-19 05:23:57,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 36 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 05:23:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2023-11-19 05:23:57,572 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 13 [2023-11-19 05:23:57,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:57,572 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2023-11-19 05:23:57,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:23:57,573 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2023-11-19 05:23:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 05:23:57,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:57,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:23:57,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 05:23:57,575 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-19 05:23:57,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:57,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1602692582, now seen corresponding path program 1 times [2023-11-19 05:23:57,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:57,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881462669] [2023-11-19 05:23:57,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:57,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:57,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:57,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881462669] [2023-11-19 05:23:57,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881462669] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:57,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:57,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 05:23:57,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121911430] [2023-11-19 05:23:57,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:57,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 05:23:57,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:57,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 05:23:57,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:23:57,690 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:23:57,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:57,745 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2023-11-19 05:23:57,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 05:23:57,746 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-11-19 05:23:57,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:57,747 INFO L225 Difference]: With dead ends: 40 [2023-11-19 05:23:57,747 INFO L226 Difference]: Without dead ends: 40 [2023-11-19 05:23:57,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 05:23:57,748 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 45 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.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:57,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 45 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:23:57,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-19 05:23:57,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-11-19 05:23:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 35 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 05:23:57,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2023-11-19 05:23:57,752 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 14 [2023-11-19 05:23:57,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:57,753 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2023-11-19 05:23:57,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 7 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:23:57,753 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2023-11-19 05:23:57,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-19 05:23:57,754 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:57,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:23:57,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 05:23:57,755 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-19 05:23:57,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:57,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1856137586, now seen corresponding path program 1 times [2023-11-19 05:23:57,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:57,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871077811] [2023-11-19 05:23:57,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:57,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:57,795 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:57,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871077811] [2023-11-19 05:23:57,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871077811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:23:57,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:23:57,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:23:57,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72890608] [2023-11-19 05:23:57,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:23:57,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:23:57,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:23:57,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:23:57,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:23:57,798 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:23:57,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:23:57,811 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2023-11-19 05:23:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:23:57,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-11-19 05:23:57,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:23:57,813 INFO L225 Difference]: With dead ends: 39 [2023-11-19 05:23:57,813 INFO L226 Difference]: Without dead ends: 39 [2023-11-19 05:23:57,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:23:57,814 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:23:57,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:23:57,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-19 05:23:57,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-19 05:23:57,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 34 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 05:23:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2023-11-19 05:23:57,818 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 15 [2023-11-19 05:23:57,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:23:57,819 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2023-11-19 05:23:57,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:23:57,819 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2023-11-19 05:23:57,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 05:23:57,820 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:23:57,820 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2023-11-19 05:23:57,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 05:23:57,821 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-19 05:23:57,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:23:57,821 INFO L85 PathProgramCache]: Analyzing trace with hash 358157196, now seen corresponding path program 2 times [2023-11-19 05:23:57,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:23:57,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067634808] [2023-11-19 05:23:57,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:23:57,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:23:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:23:58,749 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:58,750 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:23:58,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067634808] [2023-11-19 05:23:58,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067634808] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:23:58,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126651695] [2023-11-19 05:23:58,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 05:23:58,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:23:58,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:23:58,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:23:58,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 05:23:58,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-19 05:23:58,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:23:58,848 WARN L260 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 95 conjunts are in the unsatisfiable core [2023-11-19 05:23:58,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:23:58,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 05:23:58,925 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 05:23:58,925 INFO L378 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 11 treesize of output 11 [2023-11-19 05:23:58,935 INFO L378 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 13 treesize of output 9 [2023-11-19 05:23:58,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2023-11-19 05:23:59,165 INFO L378 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 18 treesize of output 13 [2023-11-19 05:23:59,663 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-19 05:23:59,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 38 [2023-11-19 05:23:59,788 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2023-11-19 05:23:59,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 26 [2023-11-19 05:23:59,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:23:59,963 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:24:00,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:24:00,984 INFO L378 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 68 treesize of output 46 [2023-11-19 05:24:00,992 INFO L378 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 29 treesize of output 25 [2023-11-19 05:24:01,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:24:01,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 84 [2023-11-19 05:24:01,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-11-19 05:24:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:24:01,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126651695] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:24:01,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [378543013] [2023-11-19 05:24:01,187 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-19 05:24:01,187 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:24:01,187 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-19 05:24:01,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:24:01,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 15] total 40 [2023-11-19 05:24:01,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663544948] [2023-11-19 05:24:01,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:24:01,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-19 05:24:01,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:24:01,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-19 05:24:01,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1541, Unknown=2, NotChecked=0, Total=1722 [2023-11-19 05:24:01,194 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 42 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 states have internal predecessors, (42), 9 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:24:03,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:24:03,138 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2023-11-19 05:24:03,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-19 05:24:03,139 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 states have internal predecessors, (42), 9 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-19 05:24:03,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:24:03,140 INFO L225 Difference]: With dead ends: 62 [2023-11-19 05:24:03,140 INFO L226 Difference]: Without dead ends: 62 [2023-11-19 05:24:03,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=462, Invalid=3442, Unknown=2, NotChecked=0, Total=3906 [2023-11-19 05:24:03,142 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 124 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-19 05:24:03,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 328 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-19 05:24:03,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-19 05:24:03,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2023-11-19 05:24:03,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.2) internal successors, (48), 48 states have internal predecessors, (48), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 05:24:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2023-11-19 05:24:03,149 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 17 [2023-11-19 05:24:03,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:24:03,149 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2023-11-19 05:24:03,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 32 states have internal predecessors, (42), 9 states have call successors, (9), 9 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:24:03,150 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2023-11-19 05:24:03,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 05:24:03,150 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:24:03,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:24:03,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 05:24:03,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-19 05:24:03,364 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-19 05:24:03,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:24:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1705690396, now seen corresponding path program 1 times [2023-11-19 05:24:03,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:24:03,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218389853] [2023-11-19 05:24:03,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:24:03,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:24:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:24:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:24:03,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:24:03,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218389853] [2023-11-19 05:24:03,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218389853] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:24:03,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:24:03,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 05:24:03,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335080898] [2023-11-19 05:24:03,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:24:03,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 05:24:03,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:24:03,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 05:24:03,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:24:03,421 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:24:03,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:24:03,440 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2023-11-19 05:24:03,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:24:03,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-11-19 05:24:03,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:24:03,443 INFO L225 Difference]: With dead ends: 54 [2023-11-19 05:24:03,443 INFO L226 Difference]: Without dead ends: 54 [2023-11-19 05:24:03,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 05:24:03,444 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:24:03,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 37 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:24:03,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-19 05:24:03,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-19 05:24:03,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.175) internal successors, (47), 47 states have internal predecessors, (47), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 05:24:03,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2023-11-19 05:24:03,455 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 16 [2023-11-19 05:24:03,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:24:03,456 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2023-11-19 05:24:03,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:24:03,456 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2023-11-19 05:24:03,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-19 05:24:03,459 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:24:03,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:24:03,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 05:24:03,460 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-19 05:24:03,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:24:03,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1336794804, now seen corresponding path program 1 times [2023-11-19 05:24:03,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:24:03,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858720432] [2023-11-19 05:24:03,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:24:03,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:24:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:24:03,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:24:03,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:24:03,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858720432] [2023-11-19 05:24:03,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858720432] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:24:03,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:24:03,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 05:24:03,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665401418] [2023-11-19 05:24:03,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:24:03,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 05:24:03,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:24:03,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 05:24:03,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:24:03,569 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:24:03,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:24:03,603 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2023-11-19 05:24:03,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 05:24:03,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-11-19 05:24:03,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:24:03,604 INFO L225 Difference]: With dead ends: 53 [2023-11-19 05:24:03,604 INFO L226 Difference]: Without dead ends: 53 [2023-11-19 05:24:03,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 05:24:03,606 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:24:03,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 37 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:24:03,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-19 05:24:03,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-11-19 05:24:03,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.15) internal successors, (46), 46 states have internal predecessors, (46), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 05:24:03,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2023-11-19 05:24:03,613 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 17 [2023-11-19 05:24:03,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:24:03,614 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2023-11-19 05:24:03,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:24:03,614 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2023-11-19 05:24:03,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 05:24:03,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:24:03,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:24:03,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 05:24:03,619 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-19 05:24:03,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:24:03,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1509033953, now seen corresponding path program 1 times [2023-11-19 05:24:03,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:24:03,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897907651] [2023-11-19 05:24:03,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:24:03,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:24:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:24:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:24:03,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:24:03,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897907651] [2023-11-19 05:24:03,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897907651] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 05:24:03,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 05:24:03,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 05:24:03,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135421001] [2023-11-19 05:24:03,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 05:24:03,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 05:24:03,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:24:03,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 05:24:03,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-19 05:24:03,815 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:24:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:24:03,882 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2023-11-19 05:24:03,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 05:24:03,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-11-19 05:24:03,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:24:03,883 INFO L225 Difference]: With dead ends: 52 [2023-11-19 05:24:03,883 INFO L226 Difference]: Without dead ends: 34 [2023-11-19 05:24:03,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-19 05:24:03,884 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 05:24:03,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 55 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 05:24:03,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-19 05:24:03,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2023-11-19 05:24:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:24:03,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2023-11-19 05:24:03,887 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 18 [2023-11-19 05:24:03,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:24:03,887 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2023-11-19 05:24:03,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 05:24:03,888 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2023-11-19 05:24:03,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-19 05:24:03,888 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 05:24:03,889 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2023-11-19 05:24:03,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 05:24:03,889 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-11-19 05:24:03,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 05:24:03,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1904634998, now seen corresponding path program 3 times [2023-11-19 05:24:03,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-19 05:24:03,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161991977] [2023-11-19 05:24:03,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 05:24:03,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 05:24:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 05:24:05,483 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:24:05,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-19 05:24:05,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161991977] [2023-11-19 05:24:05,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161991977] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 05:24:05,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662640598] [2023-11-19 05:24:05,484 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 05:24:05,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:24:05,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 [2023-11-19 05:24:05,487 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 05:24:05,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 05:24:05,603 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 05:24:05,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 05:24:05,607 WARN L260 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-19 05:24:05,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 05:24:05,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-19 05:24:05,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-19 05:24:05,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-19 05:24:05,722 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 05:24:05,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13 [2023-11-19 05:24:05,752 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 05:24:05,753 INFO L378 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 11 treesize of output 11 [2023-11-19 05:24:06,048 INFO L378 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 18 treesize of output 13 [2023-11-19 05:24:06,430 INFO L378 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 26 treesize of output 19 [2023-11-19 05:24:06,840 INFO L378 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 34 treesize of output 25 [2023-11-19 05:24:07,360 INFO L378 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 42 treesize of output 31 [2023-11-19 05:24:07,494 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2023-11-19 05:24:07,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 39 [2023-11-19 05:24:07,727 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:24:07,727 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 05:24:10,268 WARN L854 $PredicateComparison]: unable to prove that (or (and (<= (+ |c_ULTIMATE.start_rec_strcopy_~source#1.offset| 5) (select |c_#length| |c_ULTIMATE.start_rec_strcopy_~source#1.base|)) (<= 0 (+ |c_ULTIMATE.start_rec_strcopy_~source#1.offset| 4))) (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_rec_strcopy_~copyAlloc~0#1.base| v_ArrVal_190) |c_ULTIMATE.start_rec_strcopy_~source#1.base|) |c_ULTIMATE.start_rec_strcopy_~source#1.offset|) 0)) (forall ((v_ArrVal_193 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_rec_strcopy_~copyAlloc~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_rec_strcopy_~source#1.base|) (+ |c_ULTIMATE.start_rec_strcopy_~source#1.offset| 3)) 0)) (forall ((v_ArrVal_191 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_rec_strcopy_~copyAlloc~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_rec_strcopy_~source#1.base|) (+ |c_ULTIMATE.start_rec_strcopy_~source#1.offset| 1)) 0)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_rec_strcopy_~copyAlloc~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_rec_strcopy_~source#1.base|) (+ |c_ULTIMATE.start_rec_strcopy_~source#1.offset| 2)) 0))) is different from false [2023-11-19 05:24:10,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:24:10,313 INFO L378 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 91 treesize of output 58 [2023-11-19 05:24:10,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 05:24:10,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 111 [2023-11-19 05:24:10,365 INFO L378 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 11 treesize of output 7 [2023-11-19 05:24:10,377 INFO L378 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 9 treesize of output 7 [2023-11-19 05:24:10,389 INFO L378 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 11 treesize of output 7 [2023-11-19 05:24:10,400 INFO L378 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 11 treesize of output 7 [2023-11-19 05:24:10,706 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 05:24:10,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662640598] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 05:24:10,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1108007068] [2023-11-19 05:24:10,709 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-19 05:24:10,709 INFO L166 IcfgInterpreter]: Building call graph [2023-11-19 05:24:10,709 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-19 05:24:10,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 05:24:10,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22, 24] total 61 [2023-11-19 05:24:10,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213264782] [2023-11-19 05:24:10,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 05:24:10,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2023-11-19 05:24:10,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-19 05:24:10,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2023-11-19 05:24:10,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=3394, Unknown=54, NotChecked=120, Total=3906 [2023-11-19 05:24:10,716 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 63 states, 50 states have (on average 1.44) internal successors, (72), 47 states have internal predecessors, (72), 15 states have call successors, (15), 15 states have call predecessors, (15), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:24:17,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 05:24:21,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 05:24:21,273 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2023-11-19 05:24:21,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-19 05:24:21,274 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 50 states have (on average 1.44) internal successors, (72), 47 states have internal predecessors, (72), 15 states have call successors, (15), 15 states have call predecessors, (15), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-19 05:24:21,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 05:24:21,274 INFO L225 Difference]: With dead ends: 48 [2023-11-19 05:24:21,274 INFO L226 Difference]: Without dead ends: 0 [2023-11-19 05:24:21,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2273 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=1088, Invalid=9348, Unknown=74, NotChecked=202, Total=10712 [2023-11-19 05:24:21,280 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 161 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 15 mSolverCounterUnsat, 52 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 52 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-19 05:24:21,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 7 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 878 Invalid, 52 Unknown, 47 Unchecked, 3.2s Time] [2023-11-19 05:24:21,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-19 05:24:21,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-19 05:24:21,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:24:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-19 05:24:21,282 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2023-11-19 05:24:21,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 05:24:21,283 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-19 05:24:21,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 50 states have (on average 1.44) internal successors, (72), 47 states have internal predecessors, (72), 15 states have call successors, (15), 15 states have call predecessors, (15), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 05:24:21,283 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-19 05:24:21,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-19 05:24:21,286 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2023-11-19 05:24:21,286 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2023-11-19 05:24:21,287 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-11-19 05:24:21,287 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec_strcopy_helperErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-11-19 05:24:21,287 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec_strcopy_helperErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-11-19 05:24:21,287 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec_strcopy_helperErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-11-19 05:24:21,288 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-11-19 05:24:21,288 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-11-19 05:24:21,288 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (6 of 15 remaining) [2023-11-19 05:24:21,288 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (5 of 15 remaining) [2023-11-19 05:24:21,288 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (4 of 15 remaining) [2023-11-19 05:24:21,288 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (3 of 15 remaining) [2023-11-19 05:24:21,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (2 of 15 remaining) [2023-11-19 05:24:21,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (1 of 15 remaining) [2023-11-19 05:24:21,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2023-11-19 05:24:21,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-19 05:24:21,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 05:24:21,514 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 05:24:21,517 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 05:24:21,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:24:21 BoogieIcfgContainer [2023-11-19 05:24:21,523 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 05:24:21,524 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 05:24:21,524 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 05:24:21,525 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 05:24:21,525 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:23:49" (3/4) ... [2023-11-19 05:24:21,527 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-19 05:24:21,539 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure rec_strcopy_helper [2023-11-19 05:24:21,548 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2023-11-19 05:24:21,549 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2023-11-19 05:24:21,549 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-11-19 05:24:21,550 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-19 05:24:21,654 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/witness.graphml [2023-11-19 05:24:21,655 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/witness.yml [2023-11-19 05:24:21,655 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 05:24:21,656 INFO L158 Benchmark]: Toolchain (without parser) took 32717.14ms. Allocated memory was 134.2MB in the beginning and 333.4MB in the end (delta: 199.2MB). Free memory was 66.6MB in the beginning and 294.7MB in the end (delta: -228.1MB). Peak memory consumption was 164.0MB. Max. memory is 16.1GB. [2023-11-19 05:24:21,657 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 134.2MB. Free memory was 107.6MB in the beginning and 107.5MB in the end (delta: 81.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 05:24:21,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.37ms. Allocated memory was 134.2MB in the beginning and 190.8MB in the end (delta: 56.6MB). Free memory was 66.5MB in the beginning and 157.4MB in the end (delta: -90.9MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2023-11-19 05:24:21,657 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.84ms. Allocated memory is still 190.8MB. Free memory was 157.4MB in the beginning and 156.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 05:24:21,658 INFO L158 Benchmark]: Boogie Preprocessor took 39.03ms. Allocated memory is still 190.8MB. Free memory was 156.2MB in the beginning and 154.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 05:24:21,658 INFO L158 Benchmark]: RCFGBuilder took 460.96ms. Allocated memory is still 190.8MB. Free memory was 154.3MB in the beginning and 153.3MB in the end (delta: 1.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-19 05:24:21,659 INFO L158 Benchmark]: TraceAbstraction took 31794.21ms. Allocated memory was 190.8MB in the beginning and 333.4MB in the end (delta: 142.6MB). Free memory was 152.1MB in the beginning and 104.8MB in the end (delta: 47.3MB). Peak memory consumption was 191.0MB. Max. memory is 16.1GB. [2023-11-19 05:24:21,659 INFO L158 Benchmark]: Witness Printer took 131.33ms. Allocated memory is still 333.4MB. Free memory was 104.8MB in the beginning and 294.7MB in the end (delta: -189.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 05:24:21,662 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 134.2MB. Free memory was 107.6MB in the beginning and 107.5MB in the end (delta: 81.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.37ms. Allocated memory was 134.2MB in the beginning and 190.8MB in the end (delta: 56.6MB). Free memory was 66.5MB in the beginning and 157.4MB in the end (delta: -90.9MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.84ms. Allocated memory is still 190.8MB. Free memory was 157.4MB in the beginning and 156.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.03ms. Allocated memory is still 190.8MB. Free memory was 156.2MB in the beginning and 154.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 460.96ms. Allocated memory is still 190.8MB. Free memory was 154.3MB in the beginning and 153.3MB in the end (delta: 1.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 31794.21ms. Allocated memory was 190.8MB in the beginning and 333.4MB in the end (delta: 142.6MB). Free memory was 152.1MB in the beginning and 104.8MB in the end (delta: 47.3MB). Peak memory consumption was 191.0MB. Max. memory is 16.1GB. * Witness Printer took 131.33ms. Allocated memory is still 333.4MB. Free memory was 104.8MB in the beginning and 294.7MB in the end (delta: -189.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 43]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 44]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 44]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 44]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 33]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 31.7s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 52 mSolverCounterUnknown, 596 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 588 mSDsluCounter, 1560 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 47 IncrementalHoareTripleChecker+Unchecked, 1240 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2491 IncrementalHoareTripleChecker+Invalid, 2716 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 320 mSDtfsCounter, 2491 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3494 ImplicationChecksByTransitivity, 16.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=13, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 313 ConstructedInterpolants, 74 QuantifiedInterpolants, 6185 SizeOfPredicates, 92 NumberOfNonLiveVariables, 654 ConjunctsInSsa, 336 ConjunctsInUnsatCore, 25 InterpolantComputations, 13 PerfectInterpolantSequences, 8/177 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-19 05:24:21,702 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_374dbf36-ba76-4b6e-a87b-a2087704f35b/bin/utaipan-verify-t7M7D8N6sZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE