./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 38b53e6a 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_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/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_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 22:36:00,207 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:36:00,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:36:00,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:36:00,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:36:00,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:36:00,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:36:00,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:36:00,252 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:36:00,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:36:00,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:36:00,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:36:00,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:36:00,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:36:00,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:36:00,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:36:00,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:36:00,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:36:00,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:36:00,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:36:00,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:36:00,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:36:00,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:36:00,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:36:00,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:36:00,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:36:00,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:36:00,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:36:00,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:36:00,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:36:00,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:36:00,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:36:00,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:36:00,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:36:00,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:36:00,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:36:00,306 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:36:00,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:36:00,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:36:00,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:36:00,317 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:36:00,318 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2022-11-25 22:36:00,361 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:36:00,361 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:36:00,362 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:36:00,368 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:36:00,369 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:36:00,369 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:36:00,370 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:36:00,370 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:36:00,370 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:36:00,371 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 22:36:00,372 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:36:00,372 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:36:00,373 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 22:36:00,373 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 22:36:00,373 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:36:00,374 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 22:36:00,374 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 22:36:00,374 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 22:36:00,376 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 22:36:00,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 22:36:00,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:36:00,376 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 22:36:00,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:36:00,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:36:00,378 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 22:36:00,378 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 22:36:00,378 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 22:36:00,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:36:00,379 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 22:36:00,379 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:36:00,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:36:00,380 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:36:00,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:36:00,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:36:00,381 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 22:36:00,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:36:00,381 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 22:36:00,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 22:36:00,382 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:36:00,382 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/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_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 [2022-11-25 22:36:00,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:36:00,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:36:00,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:36:00,764 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:36:00,764 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:36:00,766 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i [2022-11-25 22:36:03,898 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:36:04,121 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:36:04,122 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/sv-benchmarks/c/termination-recursive-malloc/rec_strcopy_malloc.i [2022-11-25 22:36:04,132 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/data/cdf701460/5e1cd972b01344588c4d1afcd7343617/FLAG204323339 [2022-11-25 22:36:04,164 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/data/cdf701460/5e1cd972b01344588c4d1afcd7343617 [2022-11-25 22:36:04,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:36:04,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:36:04,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:36:04,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:36:04,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:36:04,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:36:04" (1/1) ... [2022-11-25 22:36:04,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f8754e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:04, skipping insertion in model container [2022-11-25 22:36:04,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:36:04" (1/1) ... [2022-11-25 22:36:04,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:36:04,211 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:36:04,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:36:04,401 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:36:04,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:36:04,439 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:36:04,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:04 WrapperNode [2022-11-25 22:36:04,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:36:04,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:36:04,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:36:04,442 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:36:04,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:04" (1/1) ... [2022-11-25 22:36:04,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:04" (1/1) ... [2022-11-25 22:36:04,483 INFO L138 Inliner]: procedures = 13, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 39 [2022-11-25 22:36:04,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:36:04,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:36:04,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:36:04,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:36:04,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:04" (1/1) ... [2022-11-25 22:36:04,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:04" (1/1) ... [2022-11-25 22:36:04,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:04" (1/1) ... [2022-11-25 22:36:04,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:04" (1/1) ... [2022-11-25 22:36:04,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:04" (1/1) ... [2022-11-25 22:36:04,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:04" (1/1) ... [2022-11-25 22:36:04,523 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:04" (1/1) ... [2022-11-25 22:36:04,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:04" (1/1) ... [2022-11-25 22:36:04,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:36:04,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:36:04,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:36:04,534 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:36:04,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:04" (1/1) ... [2022-11-25 22:36:04,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:36:04,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:36:04,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:36:04,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:36:04,636 INFO L130 BoogieDeclarations]: Found specification of procedure rec_strcopy_helper [2022-11-25 22:36:04,636 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_strcopy_helper [2022-11-25 22:36:04,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 22:36:04,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 22:36:04,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:36:04,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:36:04,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 22:36:04,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 22:36:04,772 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:36:04,774 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:36:05,055 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:36:05,132 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:36:05,132 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 22:36:05,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:36:05 BoogieIcfgContainer [2022-11-25 22:36:05,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:36:05,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:36:05,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:36:05,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:36:05,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:36:04" (1/3) ... [2022-11-25 22:36:05,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652514ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:36:05, skipping insertion in model container [2022-11-25 22:36:05,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:36:04" (2/3) ... [2022-11-25 22:36:05,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652514ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:36:05, skipping insertion in model container [2022-11-25 22:36:05,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:36:05" (3/3) ... [2022-11-25 22:36:05,148 INFO L112 eAbstractionObserver]: Analyzing ICFG rec_strcopy_malloc.i [2022-11-25 22:36:05,187 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:36:05,188 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2022-11-25 22:36:05,279 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:36:05,289 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;@3e1e880c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:36:05,289 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-11-25 22:36:05,298 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) [2022-11-25 22:36:05,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-25 22:36:05,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:05,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-25 22:36:05,312 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)] === [2022-11-25 22:36:05,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:05,321 INFO L85 PathProgramCache]: Analyzing trace with hash 3068, now seen corresponding path program 1 times [2022-11-25 22:36:05,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:36:05,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777616899] [2022-11-25 22:36:05,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:05,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:36:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:05,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:36:05,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777616899] [2022-11-25 22:36:05,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777616899] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:05,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:05,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 22:36:05,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814632497] [2022-11-25 22:36:05,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:05,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:36:05,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:36:05,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:36:05,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:36:05,736 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) [2022-11-25 22:36:05,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:05,816 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-11-25 22:36:05,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:36:05,819 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 [2022-11-25 22:36:05,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:05,828 INFO L225 Difference]: With dead ends: 34 [2022-11-25 22:36:05,828 INFO L226 Difference]: Without dead ends: 33 [2022-11-25 22:36:05,830 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 [2022-11-25 22:36:05,834 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:05,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 40 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:36:05,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-25 22:36:05,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-25 22:36:05,870 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) [2022-11-25 22:36:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-11-25 22:36:05,873 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 2 [2022-11-25 22:36:05,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:05,873 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-11-25 22:36:05,874 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) [2022-11-25 22:36:05,874 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-11-25 22:36:05,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-25 22:36:05,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:05,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-25 22:36:05,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 22:36:05,875 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)] === [2022-11-25 22:36:05,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:05,877 INFO L85 PathProgramCache]: Analyzing trace with hash 3069, now seen corresponding path program 1 times [2022-11-25 22:36:05,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:36:05,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113455591] [2022-11-25 22:36:05,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:05,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:36:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:06,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:06,252 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:36:06,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113455591] [2022-11-25 22:36:06,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113455591] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:06,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:06,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 22:36:06,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857482274] [2022-11-25 22:36:06,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:06,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:36:06,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:36:06,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:36:06,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:36:06,257 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) [2022-11-25 22:36:06,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:06,321 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-11-25 22:36:06,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:36:06,322 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 [2022-11-25 22:36:06,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:06,323 INFO L225 Difference]: With dead ends: 32 [2022-11-25 22:36:06,323 INFO L226 Difference]: Without dead ends: 32 [2022-11-25 22:36:06,324 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 [2022-11-25 22:36:06,325 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 14 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:06,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 38 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:36:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-25 22:36:06,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-25 22:36:06,337 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) [2022-11-25 22:36:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-11-25 22:36:06,340 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 2 [2022-11-25 22:36:06,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:06,342 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-11-25 22:36:06,342 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) [2022-11-25 22:36:06,343 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-11-25 22:36:06,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 22:36:06,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:06,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 22:36:06,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 22:36:06,347 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)] === [2022-11-25 22:36:06,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:06,350 INFO L85 PathProgramCache]: Analyzing trace with hash 92466461, now seen corresponding path program 1 times [2022-11-25 22:36:06,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:36:06,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621599470] [2022-11-25 22:36:06,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:06,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:36:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:06,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:06,738 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:36:06,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621599470] [2022-11-25 22:36:06,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621599470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:06,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:06,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:36:06,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761550144] [2022-11-25 22:36:06,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:06,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:36:06,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:36:06,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:36:06,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:36:06,742 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) [2022-11-25 22:36:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:06,881 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-11-25 22:36:06,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:36:06,882 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 [2022-11-25 22:36:06,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:06,883 INFO L225 Difference]: With dead ends: 30 [2022-11-25 22:36:06,883 INFO L226 Difference]: Without dead ends: 30 [2022-11-25 22:36:06,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:36:06,885 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:06,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 49 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:36:06,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-25 22:36:06,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-25 22:36:06,890 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) [2022-11-25 22:36:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-11-25 22:36:06,892 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 5 [2022-11-25 22:36:06,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:06,892 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-11-25 22:36:06,892 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) [2022-11-25 22:36:06,893 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-11-25 22:36:06,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 22:36:06,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:06,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 22:36:06,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 22:36:06,897 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)] === [2022-11-25 22:36:06,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:06,902 INFO L85 PathProgramCache]: Analyzing trace with hash 92466462, now seen corresponding path program 1 times [2022-11-25 22:36:06,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:36:06,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575135162] [2022-11-25 22:36:06,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:06,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:36:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:07,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:07,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:36:07,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575135162] [2022-11-25 22:36:07,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575135162] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:07,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:07,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:36:07,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772795270] [2022-11-25 22:36:07,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:07,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:36:07,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:36:07,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:36:07,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:36:07,193 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) [2022-11-25 22:36:07,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:07,294 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2022-11-25 22:36:07,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:36:07,295 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 [2022-11-25 22:36:07,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:07,295 INFO L225 Difference]: With dead ends: 40 [2022-11-25 22:36:07,296 INFO L226 Difference]: Without dead ends: 40 [2022-11-25 22:36:07,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:36:07,297 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 45 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:07,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 69 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:36:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-25 22:36:07,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2022-11-25 22:36:07,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 34 states have internal predecessors, (36), 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) [2022-11-25 22:36:07,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-11-25 22:36:07,305 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 5 [2022-11-25 22:36:07,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:07,305 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-11-25 22:36:07,306 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) [2022-11-25 22:36:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-11-25 22:36:07,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 22:36:07,306 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:07,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 22:36:07,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 22:36:07,307 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)] === [2022-11-25 22:36:07,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:07,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1428507031, now seen corresponding path program 1 times [2022-11-25 22:36:07,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:36:07,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778373199] [2022-11-25 22:36:07,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:07,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:36:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:07,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:07,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:36:07,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778373199] [2022-11-25 22:36:07,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778373199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:07,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:07,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:36:07,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430268397] [2022-11-25 22:36:07,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:07,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:36:07,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:36:07,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:36:07,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:36:07,479 INFO L87 Difference]: Start difference. First operand 38 states and 42 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) [2022-11-25 22:36:07,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:07,580 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-11-25 22:36:07,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:36:07,581 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 [2022-11-25 22:36:07,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:07,582 INFO L225 Difference]: With dead ends: 37 [2022-11-25 22:36:07,583 INFO L226 Difference]: Without dead ends: 37 [2022-11-25 22:36:07,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:36:07,592 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:07,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 52 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:36:07,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-25 22:36:07,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-25 22:36:07,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 33 states have internal predecessors, (34), 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) [2022-11-25 22:36:07,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2022-11-25 22:36:07,599 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 6 [2022-11-25 22:36:07,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:07,600 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2022-11-25 22:36:07,600 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) [2022-11-25 22:36:07,600 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2022-11-25 22:36:07,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 22:36:07,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:07,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 22:36:07,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 22:36:07,601 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)] === [2022-11-25 22:36:07,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:07,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1428507030, now seen corresponding path program 1 times [2022-11-25 22:36:07,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:36:07,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283931550] [2022-11-25 22:36:07,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:07,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:36:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:07,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:07,816 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:36:07,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283931550] [2022-11-25 22:36:07,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283931550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:07,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:07,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:36:07,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104537856] [2022-11-25 22:36:07,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:07,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 22:36:07,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:36:07,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 22:36:07,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:36:07,819 INFO L87 Difference]: Start difference. First operand 37 states and 40 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) [2022-11-25 22:36:07,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:07,923 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-11-25 22:36:07,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:36:07,924 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 [2022-11-25 22:36:07,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:07,927 INFO L225 Difference]: With dead ends: 37 [2022-11-25 22:36:07,927 INFO L226 Difference]: Without dead ends: 37 [2022-11-25 22:36:07,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:36:07,934 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 40 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:07,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 65 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:36:07,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-25 22:36:07,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-25 22:36:07,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.5) internal successors, (33), 33 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) [2022-11-25 22:36:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-11-25 22:36:07,954 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 6 [2022-11-25 22:36:07,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:07,954 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-11-25 22:36:07,954 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) [2022-11-25 22:36:07,955 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-11-25 22:36:07,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 22:36:07,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:07,956 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:07,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 22:36:07,957 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)] === [2022-11-25 22:36:07,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:07,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1298482860, now seen corresponding path program 1 times [2022-11-25 22:36:07,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:36:07,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832090939] [2022-11-25 22:36:07,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:07,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:36:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:08,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:08,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:36:08,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832090939] [2022-11-25 22:36:08,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832090939] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:36:08,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703544564] [2022-11-25 22:36:08,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:08,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:36:08,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:36:08,457 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:36:08,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 22:36:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:08,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-25 22:36:08,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:08,611 INFO L350 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 [2022-11-25 22:36:08,688 INFO L350 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 14 treesize of output 10 [2022-11-25 22:36:08,705 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:36:08,706 INFO L350 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 20 [2022-11-25 22:36:08,755 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 22:36:08,755 INFO L350 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 [2022-11-25 22:36:09,039 INFO L350 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 17 treesize of output 19 [2022-11-25 22:36:09,117 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:36:09,117 INFO L350 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 18 treesize of output 15 [2022-11-25 22:36:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:09,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:36:09,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:36:09,744 INFO L350 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 [2022-11-25 22:36:09,761 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:36:09,762 INFO L350 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 [2022-11-25 22:36:09,773 INFO L350 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 30 treesize of output 26 [2022-11-25 22:36:09,783 INFO L350 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 [2022-11-25 22:36:09,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:09,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703544564] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:36:09,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [620603189] [2022-11-25 22:36:09,905 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-25 22:36:09,905 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:36:09,910 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:94) 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-25 22:36:09,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:36:09,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2022-11-25 22:36:09,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606390994] [2022-11-25 22:36:09,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:36:09,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 22:36:09,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:36:09,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 22:36:09,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=763, Unknown=3, NotChecked=0, Total=870 [2022-11-25 22:36:09,919 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 5 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) [2022-11-25 22:36:10,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:10,795 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-11-25 22:36:10,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 22:36:10,796 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 5 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 [2022-11-25 22:36:10,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:10,798 INFO L225 Difference]: With dead ends: 47 [2022-11-25 22:36:10,798 INFO L226 Difference]: Without dead ends: 47 [2022-11-25 22:36:10,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=211, Invalid=1268, Unknown=3, NotChecked=0, Total=1482 [2022-11-25 22:36:10,799 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 86 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:10,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 259 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 22:36:10,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-25 22:36:10,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2022-11-25 22:36:10,803 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) [2022-11-25 22:36:10,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-11-25 22:36:10,804 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 11 [2022-11-25 22:36:10,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:10,805 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-11-25 22:36:10,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 5 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) [2022-11-25 22:36:10,805 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-11-25 22:36:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 22:36:10,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:10,806 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:10,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 22:36:11,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-25 22:36:11,007 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)] === [2022-11-25 22:36:11,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:11,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1598263052, now seen corresponding path program 1 times [2022-11-25 22:36:11,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:36:11,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358992213] [2022-11-25 22:36:11,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:11,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:36:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:11,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:36:11,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358992213] [2022-11-25 22:36:11,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358992213] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:36:11,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219521286] [2022-11-25 22:36:11,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:11,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:36:11,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:36:11,578 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:36:11,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 22:36:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:11,651 WARN L261 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-25 22:36:11,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:11,669 INFO L350 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 [2022-11-25 22:36:11,679 INFO L350 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 [2022-11-25 22:36:11,782 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 22:36:11,782 INFO L350 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 [2022-11-25 22:36:11,801 INFO L350 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 19 treesize of output 15 [2022-11-25 22:36:11,813 INFO L350 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 28 treesize of output 28 [2022-11-25 22:36:12,253 INFO L350 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 22 treesize of output 24 [2022-11-25 22:36:12,429 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:36:12,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 22:36:12,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:12,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:36:13,382 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:36:13,383 INFO L350 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 [2022-11-25 22:36:13,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:36:13,396 INFO L350 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 [2022-11-25 22:36:13,404 INFO L350 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 [2022-11-25 22:36:13,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:13,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219521286] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:36:13,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1632038920] [2022-11-25 22:36:13,515 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-25 22:36:13,515 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:36:13,515 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:94) 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-25 22:36:13,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:36:13,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2022-11-25 22:36:13,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603054500] [2022-11-25 22:36:13,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:36:13,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 22:36:13,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:36:13,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 22:36:13,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2022-11-25 22:36:13,519 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 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) [2022-11-25 22:36:18,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:18,267 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-11-25 22:36:18,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 22:36:18,268 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 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 [2022-11-25 22:36:18,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:18,269 INFO L225 Difference]: With dead ends: 56 [2022-11-25 22:36:18,269 INFO L226 Difference]: Without dead ends: 56 [2022-11-25 22:36:18,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=295, Invalid=1960, Unknown=1, NotChecked=0, Total=2256 [2022-11-25 22:36:18,271 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 159 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 38 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:18,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 247 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 424 Invalid, 3 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 22:36:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-25 22:36:18,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2022-11-25 22:36:18,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 45 states have internal predecessors, (46), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 22:36:18,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-11-25 22:36:18,277 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 12 [2022-11-25 22:36:18,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:18,277 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-11-25 22:36:18,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 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) [2022-11-25 22:36:18,278 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-11-25 22:36:18,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 22:36:18,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:18,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:18,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 22:36:18,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:36:18,479 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)] === [2022-11-25 22:36:18,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:18,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1596537156, now seen corresponding path program 1 times [2022-11-25 22:36:18,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:36:18,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050248408] [2022-11-25 22:36:18,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:18,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:36:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:18,517 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:36:18,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050248408] [2022-11-25 22:36:18,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050248408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:18,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:18,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:36:18,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308225084] [2022-11-25 22:36:18,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:18,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:36:18,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:36:18,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:36:18,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:36:18,520 INFO L87 Difference]: Start difference. First operand 51 states and 56 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) [2022-11-25 22:36:18,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:18,537 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-11-25 22:36:18,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:36:18,538 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 [2022-11-25 22:36:18,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:18,539 INFO L225 Difference]: With dead ends: 50 [2022-11-25 22:36:18,539 INFO L226 Difference]: Without dead ends: 50 [2022-11-25 22:36:18,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:36:18,540 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 26 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:18,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 42 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:36:18,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-25 22:36:18,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-25 22:36:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 44 states have internal predecessors, (45), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 22:36:18,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-11-25 22:36:18,552 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 12 [2022-11-25 22:36:18,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:18,552 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-11-25 22:36:18,553 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) [2022-11-25 22:36:18,553 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-11-25 22:36:18,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 22:36:18,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:18,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:18,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 22:36:18,554 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)] === [2022-11-25 22:36:18,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:18,555 INFO L85 PathProgramCache]: Analyzing trace with hash 2046955788, now seen corresponding path program 1 times [2022-11-25 22:36:18,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:36:18,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188913211] [2022-11-25 22:36:18,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:18,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:36:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:18,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:18,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:36:18,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188913211] [2022-11-25 22:36:18,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188913211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:18,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:18,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:36:18,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666665442] [2022-11-25 22:36:18,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:18,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:36:18,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:36:18,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:36:18,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:36:18,614 INFO L87 Difference]: Start difference. First operand 50 states and 55 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) [2022-11-25 22:36:18,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:18,645 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-11-25 22:36:18,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:36:18,645 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 [2022-11-25 22:36:18,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:18,646 INFO L225 Difference]: With dead ends: 49 [2022-11-25 22:36:18,646 INFO L226 Difference]: Without dead ends: 49 [2022-11-25 22:36:18,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:36:18,647 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:18,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 35 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:36:18,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-25 22:36:18,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-25 22:36:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 43 states have internal predecessors, (44), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 22:36:18,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-11-25 22:36:18,652 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 13 [2022-11-25 22:36:18,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:18,652 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-11-25 22:36:18,652 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) [2022-11-25 22:36:18,653 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-11-25 22:36:18,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 22:36:18,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:18,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:18,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 22:36:18,654 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)] === [2022-11-25 22:36:18,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:18,654 INFO L85 PathProgramCache]: Analyzing trace with hash -968879938, now seen corresponding path program 1 times [2022-11-25 22:36:18,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:36:18,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121034425] [2022-11-25 22:36:18,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:18,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:36:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:18,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:36:18,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121034425] [2022-11-25 22:36:18,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121034425] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:18,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:18,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:36:18,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387440867] [2022-11-25 22:36:18,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:18,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:36:18,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:36:18,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:36:18,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:36:18,741 INFO L87 Difference]: Start difference. First operand 49 states and 54 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) [2022-11-25 22:36:18,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:18,797 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-11-25 22:36:18,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 22:36:18,798 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 [2022-11-25 22:36:18,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:18,799 INFO L225 Difference]: With dead ends: 48 [2022-11-25 22:36:18,799 INFO L226 Difference]: Without dead ends: 48 [2022-11-25 22:36:18,799 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 [2022-11-25 22:36:18,800 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:18,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 36 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:36:18,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-25 22:36:18,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-25 22:36:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 42 states have internal predecessors, (43), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 22:36:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-11-25 22:36:18,807 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 14 [2022-11-25 22:36:18,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:18,808 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-11-25 22:36:18,808 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) [2022-11-25 22:36:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-11-25 22:36:18,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 22:36:18,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:18,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:18,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 22:36:18,810 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)] === [2022-11-25 22:36:18,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:18,810 INFO L85 PathProgramCache]: Analyzing trace with hash 29493070, now seen corresponding path program 1 times [2022-11-25 22:36:18,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:36:18,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614535365] [2022-11-25 22:36:18,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:18,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:36:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:18,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:18,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:36:18,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614535365] [2022-11-25 22:36:18,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614535365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:18,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:18,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:36:18,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436767341] [2022-11-25 22:36:18,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:18,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:36:18,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:36:18,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:36:18,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:36:18,849 INFO L87 Difference]: Start difference. First operand 48 states and 53 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) [2022-11-25 22:36:18,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:18,866 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-11-25 22:36:18,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:36:18,867 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 [2022-11-25 22:36:18,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:18,868 INFO L225 Difference]: With dead ends: 47 [2022-11-25 22:36:18,868 INFO L226 Difference]: Without dead ends: 47 [2022-11-25 22:36:18,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:36:18,869 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 16 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 38 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 [2022-11-25 22:36:18,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 38 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:36:18,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-25 22:36:18,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-11-25 22:36:18,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 41 states have internal predecessors, (42), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 22:36:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-11-25 22:36:18,872 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 15 [2022-11-25 22:36:18,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:18,873 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-11-25 22:36:18,873 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) [2022-11-25 22:36:18,873 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-11-25 22:36:18,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 22:36:18,874 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:18,874 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-11-25 22:36:18,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 22:36:18,875 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)] === [2022-11-25 22:36:18,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:18,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1841691382, now seen corresponding path program 2 times [2022-11-25 22:36:18,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:36:18,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012922745] [2022-11-25 22:36:18,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:18,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:36:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:19,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:19,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:36:19,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012922745] [2022-11-25 22:36:19,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012922745] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:36:19,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828941980] [2022-11-25 22:36:19,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 22:36:19,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:36:19,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:36:19,683 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:36:19,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 22:36:19,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 22:36:19,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:36:19,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-25 22:36:19,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:19,789 INFO L350 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 [2022-11-25 22:36:19,839 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 22:36:19,839 INFO L350 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 [2022-11-25 22:36:19,846 INFO L350 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 [2022-11-25 22:36:19,852 INFO L350 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 12 treesize of output 14 [2022-11-25 22:36:20,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 22:36:20,402 INFO L350 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 24 treesize of output 24 [2022-11-25 22:36:20,507 INFO L321 Elim1Store]: treesize reduction 4, result has 85.2 percent of original size [2022-11-25 22:36:20,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 33 [2022-11-25 22:36:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:20,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:36:21,822 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_rec_strcopy_helper_~source.offset_13 Int) (v_ArrVal_130 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_rec_strcopy_helper_#in~dest.base| v_ArrVal_130) |c_rec_strcopy_helper_#in~source.base|) v_rec_strcopy_helper_~source.offset_13) 0) (<= (+ v_rec_strcopy_helper_~source.offset_13 2) (select |c_#length| |c_rec_strcopy_helper_#in~source.base|)) (not (<= 0 v_rec_strcopy_helper_~source.offset_13)) (< (+ 1 |c_rec_strcopy_helper_#in~source.offset|) v_rec_strcopy_helper_~source.offset_13))) (forall ((v_ArrVal_129 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_rec_strcopy_helper_#in~dest.base| v_ArrVal_129) |c_rec_strcopy_helper_#in~source.base|) |c_rec_strcopy_helper_#in~source.offset|) 0))) is different from false [2022-11-25 22:36:22,025 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:36:22,025 INFO L350 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 43 treesize of output 32 [2022-11-25 22:36:22,051 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:36:22,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 67 [2022-11-25 22:36:22,066 INFO L350 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 30 treesize of output 26 [2022-11-25 22:36:22,078 INFO L350 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 [2022-11-25 22:36:22,088 INFO L350 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 [2022-11-25 22:36:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 22:36:22,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828941980] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:36:22,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [933970992] [2022-11-25 22:36:22,289 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-25 22:36:22,289 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:36:22,290 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:94) 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-25 22:36:22,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:36:22,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 15] total 41 [2022-11-25 22:36:22,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725902519] [2022-11-25 22:36:22,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:36:22,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-25 22:36:22,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:36:22,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-25 22:36:22,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1545, Unknown=9, NotChecked=80, Total=1806 [2022-11-25 22:36:22,292 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 43 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 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) [2022-11-25 22:36:24,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:24,945 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-11-25 22:36:24,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 22:36:24,945 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 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 [2022-11-25 22:36:24,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:24,946 INFO L225 Difference]: With dead ends: 61 [2022-11-25 22:36:24,946 INFO L226 Difference]: Without dead ends: 61 [2022-11-25 22:36:24,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=468, Invalid=3309, Unknown=9, NotChecked=120, Total=3906 [2022-11-25 22:36:24,948 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 146 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:24,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 364 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 837 Invalid, 0 Unknown, 49 Unchecked, 0.9s Time] [2022-11-25 22:36:24,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-25 22:36:24,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2022-11-25 22:36:24,952 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) [2022-11-25 22:36:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-11-25 22:36:24,952 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 17 [2022-11-25 22:36:24,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:24,953 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-11-25 22:36:24,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 33 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) [2022-11-25 22:36:24,953 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-11-25 22:36:24,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 22:36:24,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:24,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:24,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 22:36:25,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 22:36:25,155 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)] === [2022-11-25 22:36:25,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:25,155 INFO L85 PathProgramCache]: Analyzing trace with hash 914285248, now seen corresponding path program 1 times [2022-11-25 22:36:25,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:36:25,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941909079] [2022-11-25 22:36:25,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:25,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:36:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:25,200 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:36:25,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941909079] [2022-11-25 22:36:25,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941909079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:25,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:25,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:36:25,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498449195] [2022-11-25 22:36:25,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:25,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:36:25,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:36:25,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:36:25,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:36:25,202 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) [2022-11-25 22:36:25,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:25,226 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2022-11-25 22:36:25,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:36:25,227 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 [2022-11-25 22:36:25,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:25,228 INFO L225 Difference]: With dead ends: 54 [2022-11-25 22:36:25,228 INFO L226 Difference]: Without dead ends: 54 [2022-11-25 22:36:25,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:36:25,229 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:25,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 33 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:36:25,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-25 22:36:25,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-25 22:36:25,232 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) [2022-11-25 22:36:25,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-11-25 22:36:25,233 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 16 [2022-11-25 22:36:25,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:25,233 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-11-25 22:36:25,233 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) [2022-11-25 22:36:25,234 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-11-25 22:36:25,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 22:36:25,234 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:25,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:25,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 22:36:25,235 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)] === [2022-11-25 22:36:25,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:25,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1721928304, now seen corresponding path program 1 times [2022-11-25 22:36:25,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:36:25,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595846380] [2022-11-25 22:36:25,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:25,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:36:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:25,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:36:25,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595846380] [2022-11-25 22:36:25,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595846380] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:25,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:25,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:36:25,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364129677] [2022-11-25 22:36:25,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:25,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 22:36:25,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:36:25,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 22:36:25,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:36:25,338 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) [2022-11-25 22:36:25,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:25,376 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-11-25 22:36:25,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:36:25,376 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 [2022-11-25 22:36:25,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:25,377 INFO L225 Difference]: With dead ends: 53 [2022-11-25 22:36:25,377 INFO L226 Difference]: Without dead ends: 53 [2022-11-25 22:36:25,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-25 22:36:25,378 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:25,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:36:25,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-25 22:36:25,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-25 22:36:25,381 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) [2022-11-25 22:36:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-11-25 22:36:25,382 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 17 [2022-11-25 22:36:25,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:25,382 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-11-25 22:36:25,383 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) [2022-11-25 22:36:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-11-25 22:36:25,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 22:36:25,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:25,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:25,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 22:36:25,384 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)] === [2022-11-25 22:36:25,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:25,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1840169789, now seen corresponding path program 1 times [2022-11-25 22:36:25,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:36:25,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524589448] [2022-11-25 22:36:25,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:25,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:36:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:25,539 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:36:25,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524589448] [2022-11-25 22:36:25,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524589448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:25,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:25,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 22:36:25,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553648696] [2022-11-25 22:36:25,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:25,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:36:25,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:36:25,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:36:25,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:36:25,541 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) [2022-11-25 22:36:25,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:25,642 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-11-25 22:36:25,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:36:25,643 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 [2022-11-25 22:36:25,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:25,643 INFO L225 Difference]: With dead ends: 52 [2022-11-25 22:36:25,643 INFO L226 Difference]: Without dead ends: 34 [2022-11-25 22:36:25,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-25 22:36:25,644 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:25,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 53 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:36:25,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-25 22:36:25,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-11-25 22:36:25,645 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) [2022-11-25 22:36:25,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-11-25 22:36:25,646 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 18 [2022-11-25 22:36:25,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:25,646 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-11-25 22:36:25,646 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) [2022-11-25 22:36:25,646 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-11-25 22:36:25,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 22:36:25,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:25,647 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1] [2022-11-25 22:36:25,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 22:36:25,647 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)] === [2022-11-25 22:36:25,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:25,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1792056054, now seen corresponding path program 3 times [2022-11-25 22:36:25,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:36:25,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906854665] [2022-11-25 22:36:25,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:25,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:36:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:27,033 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:36:27,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906854665] [2022-11-25 22:36:27,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906854665] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:36:27,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743990363] [2022-11-25 22:36:27,034 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 22:36:27,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:36:27,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:36:27,039 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:36:27,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 22:36:27,154 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 22:36:27,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:36:27,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-25 22:36:27,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:27,169 INFO L350 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 [2022-11-25 22:36:27,175 INFO L350 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 [2022-11-25 22:36:27,224 INFO L350 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 14 treesize of output 10 [2022-11-25 22:36:27,239 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:36:27,239 INFO L350 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 20 [2022-11-25 22:36:27,292 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 22:36:27,293 INFO L350 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 [2022-11-25 22:36:27,692 INFO L350 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 17 treesize of output 19 [2022-11-25 22:36:28,123 INFO L350 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 27 treesize of output 27 [2022-11-25 22:36:28,654 INFO L350 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 37 treesize of output 35 [2022-11-25 22:36:29,274 INFO L350 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 47 treesize of output 43 [2022-11-25 22:36:29,446 INFO L321 Elim1Store]: treesize reduction 12, result has 73.3 percent of original size [2022-11-25 22:36:29,446 INFO L350 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 48 treesize of output 51 [2022-11-25 22:36:29,759 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:36:29,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:36:30,730 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_194 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_rec_strcopy_helper_#in~dest.base| v_ArrVal_194) |c_rec_strcopy_helper_#in~source.base|) |c_rec_strcopy_helper_#in~source.offset|) 0)) (forall ((v_ArrVal_195 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_rec_strcopy_helper_#in~dest.base| v_ArrVal_195) |c_rec_strcopy_helper_#in~source.base|) (+ 1 |c_rec_strcopy_helper_#in~source.offset|)) 0)) (and (<= 0 (+ 2 |c_rec_strcopy_helper_#in~source.offset|)) (<= (+ 3 |c_rec_strcopy_helper_#in~source.offset|) (select |c_#length| |c_rec_strcopy_helper_#in~source.base|)))) is different from false [2022-11-25 22:36:34,059 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_194 (Array Int Int))) (= (select (select (store |c_#memory_int| c_rec_strcopy_helper_~dest.base v_ArrVal_194) c_rec_strcopy_helper_~source.base) (+ c_rec_strcopy_helper_~source.offset 2)) 0)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#memory_int| c_rec_strcopy_helper_~dest.base v_ArrVal_192) c_rec_strcopy_helper_~source.base) c_rec_strcopy_helper_~source.offset) 0)) (and (<= 0 (+ c_rec_strcopy_helper_~source.offset 4)) (<= (+ 5 c_rec_strcopy_helper_~source.offset) (select |c_#length| c_rec_strcopy_helper_~source.base))) (forall ((v_ArrVal_193 (Array Int Int))) (= (select (select (store |c_#memory_int| c_rec_strcopy_helper_~dest.base v_ArrVal_193) c_rec_strcopy_helper_~source.base) (+ c_rec_strcopy_helper_~source.offset 1)) 0)) (forall ((v_ArrVal_195 (Array Int Int))) (= (select (select (store |c_#memory_int| c_rec_strcopy_helper_~dest.base v_ArrVal_195) c_rec_strcopy_helper_~source.base) (+ c_rec_strcopy_helper_~source.offset 3)) 0))) is different from false [2022-11-25 22:36:34,807 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:36:34,808 INFO L350 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 [2022-11-25 22:36:34,850 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:36:34,851 INFO L350 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 127 [2022-11-25 22:36:34,870 INFO L350 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 [2022-11-25 22:36:34,883 INFO L350 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 [2022-11-25 22:36:34,895 INFO L350 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 [2022-11-25 22:36:34,908 INFO L350 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 [2022-11-25 22:36:35,329 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-25 22:36:35,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743990363] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:36:35,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1833524865] [2022-11-25 22:36:35,332 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-25 22:36:35,332 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:36:35,332 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:94) 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:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) 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:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) 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) [2022-11-25 22:36:35,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:36:35,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22, 25] total 62 [2022-11-25 22:36:35,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436020582] [2022-11-25 22:36:35,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:36:35,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-25 22:36:35,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:36:35,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-25 22:36:35,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=3418, Unknown=44, NotChecked=242, Total=4032 [2022-11-25 22:36:35,337 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 64 states, 51 states have (on average 1.411764705882353) internal successors, (72), 48 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) [2022-11-25 22:36:49,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 22:36:53,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:53,761 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-11-25 22:36:53,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-25 22:36:53,767 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 51 states have (on average 1.411764705882353) internal successors, (72), 48 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 [2022-11-25 22:36:53,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:53,767 INFO L225 Difference]: With dead ends: 48 [2022-11-25 22:36:53,768 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 22:36:53,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 2 IntricatePredicates, 3 DeprecatedPredicates, 2398 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=1125, Invalid=9736, Unknown=67, NotChecked=414, Total=11342 [2022-11-25 22:36:53,774 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 165 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 23 mSolverCounterUnsat, 32 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 32 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:53,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 6 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1082 Invalid, 32 Unknown, 83 Unchecked, 3.9s Time] [2022-11-25 22:36:53,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 22:36:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 22:36:53,776 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) [2022-11-25 22:36:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 22:36:53,776 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-11-25 22:36:53,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:53,776 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 22:36:53,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 51 states have (on average 1.411764705882353) internal successors, (72), 48 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) [2022-11-25 22:36:53,777 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 22:36:53,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 22:36:53,780 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2022-11-25 22:36:53,780 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2022-11-25 22:36:53,780 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2022-11-25 22:36:53,781 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec_strcopy_helperErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2022-11-25 22:36:53,781 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec_strcopy_helperErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2022-11-25 22:36:53,781 INFO L805 garLoopResultBuilder]: Registering result SAFE for location rec_strcopy_helperErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2022-11-25 22:36:53,781 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2022-11-25 22:36:53,781 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2022-11-25 22:36:53,782 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (6 of 15 remaining) [2022-11-25 22:36:53,782 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (5 of 15 remaining) [2022-11-25 22:36:53,782 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (4 of 15 remaining) [2022-11-25 22:36:53,782 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (3 of 15 remaining) [2022-11-25 22:36:53,782 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (2 of 15 remaining) [2022-11-25 22:36:53,783 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (1 of 15 remaining) [2022-11-25 22:36:53,783 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2022-11-25 22:36:53,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 22:36:53,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 22:36:53,991 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:53,993 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 22:36:53,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 10:36:53 BoogieIcfgContainer [2022-11-25 22:36:53,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 22:36:53,996 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 22:36:53,996 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 22:36:53,996 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 22:36:53,997 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:36:05" (3/4) ... [2022-11-25 22:36:54,000 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 22:36:54,006 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure rec_strcopy_helper [2022-11-25 22:36:54,015 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-25 22:36:54,015 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-25 22:36:54,015 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 22:36:54,015 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 22:36:54,058 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 22:36:54,059 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 22:36:54,060 INFO L158 Benchmark]: Toolchain (without parser) took 49889.25ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 124.9MB in the beginning and 126.0MB in the end (delta: -1.1MB). Peak memory consumption was 84.9MB. Max. memory is 16.1GB. [2022-11-25 22:36:54,060 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 107.0MB. Free memory is still 54.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:36:54,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.29ms. Allocated memory is still 167.8MB. Free memory was 124.9MB in the beginning and 115.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 22:36:54,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.51ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 113.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:36:54,061 INFO L158 Benchmark]: Boogie Preprocessor took 46.82ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 111.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 22:36:54,061 INFO L158 Benchmark]: RCFGBuilder took 602.98ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 96.6MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 22:36:54,066 INFO L158 Benchmark]: TraceAbstraction took 48856.28ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 96.1MB in the beginning and 128.7MB in the end (delta: -32.6MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2022-11-25 22:36:54,066 INFO L158 Benchmark]: Witness Printer took 62.97ms. Allocated memory is still 251.7MB. Free memory was 128.7MB in the beginning and 126.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 22:36:54,068 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42ms. Allocated memory is still 107.0MB. Free memory is still 54.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.29ms. Allocated memory is still 167.8MB. Free memory was 124.9MB in the beginning and 115.0MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.51ms. Allocated memory is still 167.8MB. Free memory was 115.0MB in the beginning and 113.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.82ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 111.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 602.98ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 96.6MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 48856.28ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 96.1MB in the beginning and 128.7MB in the end (delta: -32.6MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. * Witness Printer took 62.97ms. Allocated memory is still 251.7MB. Free memory was 128.7MB in the beginning and 126.0MB in the end (delta: 2.7MB). 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: 48.7s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 27.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 35 mSolverCounterUnknown, 843 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 838 mSDsluCounter, 1454 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 132 IncrementalHoareTripleChecker+Unchecked, 1141 mSDsCounter, 170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3165 IncrementalHoareTripleChecker+Invalid, 3502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 170 mSolverCounterUnsat, 313 mSDtfsCounter, 3165 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 334 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 305 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 3556 ImplicationChecksByTransitivity, 31.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=13, InterpolantAutomatonStates: 169, 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, 20 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 18.9s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 313 ConstructedInterpolants, 90 QuantifiedInterpolants, 6793 SizeOfPredicates, 104 NumberOfNonLiveVariables, 670 ConjunctsInSsa, 323 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! [2022-11-25 22:36:54,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cac89a17-a545-468c-b617-b6b3a18c3a33/bin/utaipan-ByfvJB40ur/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