./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/termination-recursive-malloc/rec_strcopy_malloc.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/termination-recursive-malloc/rec_strcopy_malloc.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash afefe9da09bf30f968ae26d4648984157b8439f704a4c69c503e68e9af3a2aeb --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:29:14,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:29:14,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-04-29 11:29:14,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:29:14,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:29:14,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:29:14,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:29:14,775 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:29:14,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:29:14,775 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:29:14,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:29:14,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:29:14,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:29:14,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:29:14,775 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:29:14,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:29:14,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:29:14,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:29:14,775 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:29:14,775 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:29:14,776 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:29:14,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:29:14,776 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:29:14,776 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:29:14,776 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:29:14,776 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:29:14,776 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:29:14,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:29:14,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:29:14,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:29:14,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:29:14,776 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:29:14,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:29:14,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:29:14,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:29:14,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:29:14,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:29:14,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:29:14,776 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:29:14,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:29:14,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:29:14,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:29:14,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:29:14,777 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> afefe9da09bf30f968ae26d4648984157b8439f704a4c69c503e68e9af3a2aeb [2025-04-29 11:29:14,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:29:14,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:29:14,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:29:14,976 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:29:14,976 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:29:14,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/termination-recursive-malloc/rec_strcopy_malloc.c [2025-04-29 11:29:16,259 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3643f0b9/83e109a2fbc845348142c53d4a857ce4/FLAG8fbabcf3d [2025-04-29 11:29:16,458 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:29:16,458 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/termination-recursive-malloc/rec_strcopy_malloc.c [2025-04-29 11:29:16,464 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:29:16,486 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3643f0b9/83e109a2fbc845348142c53d4a857ce4/FLAG8fbabcf3d [2025-04-29 11:29:17,310 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3643f0b9/83e109a2fbc845348142c53d4a857ce4 [2025-04-29 11:29:17,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:29:17,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:29:17,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:29:17,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:29:17,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:29:17,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:29:17" (1/1) ... [2025-04-29 11:29:17,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c274ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:17, skipping insertion in model container [2025-04-29 11:29:17,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:29:17" (1/1) ... [2025-04-29 11:29:17,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:29:17,460 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-29 11:29:17,474 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-29 11:29:17,480 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:29:17,488 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:29:17,512 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:29:17,524 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:29:17,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:17 WrapperNode [2025-04-29 11:29:17,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:29:17,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:29:17,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:29:17,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:29:17,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:17" (1/1) ... [2025-04-29 11:29:17,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:17" (1/1) ... [2025-04-29 11:29:17,552 INFO L138 Inliner]: procedures = 11, calls = 14, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 39 [2025-04-29 11:29:17,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:29:17,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:29:17,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:29:17,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:29:17,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:17" (1/1) ... [2025-04-29 11:29:17,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:17" (1/1) ... [2025-04-29 11:29:17,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:17" (1/1) ... [2025-04-29 11:29:17,580 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [1, 3]. 75 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2025-04-29 11:29:17,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:17" (1/1) ... [2025-04-29 11:29:17,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:17" (1/1) ... [2025-04-29 11:29:17,586 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:17" (1/1) ... [2025-04-29 11:29:17,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:17" (1/1) ... [2025-04-29 11:29:17,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:17" (1/1) ... [2025-04-29 11:29:17,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:17" (1/1) ... [2025-04-29 11:29:17,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:17" (1/1) ... [2025-04-29 11:29:17,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:29:17,602 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:29:17,602 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:29:17,602 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:29:17,603 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:17" (1/1) ... [2025-04-29 11:29:17,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:29:17,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:29:17,633 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:29:17,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:29:17,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:29:17,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:29:17,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:29:17,652 INFO L130 BoogieDeclarations]: Found specification of procedure rec_strcopy_helper [2025-04-29 11:29:17,652 INFO L138 BoogieDeclarations]: Found implementation of procedure rec_strcopy_helper [2025-04-29 11:29:17,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:29:17,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:29:17,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:29:17,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:29:17,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:29:17,696 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:29:17,698 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:29:17,826 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-04-29 11:29:17,827 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:29:17,834 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:29:17,835 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:29:17,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:29:17 BoogieIcfgContainer [2025-04-29 11:29:17,835 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:29:17,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:29:17,838 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:29:17,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:29:17,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:29:17" (1/3) ... [2025-04-29 11:29:17,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a89b6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:29:17, skipping insertion in model container [2025-04-29 11:29:17,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:29:17" (2/3) ... [2025-04-29 11:29:17,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a89b6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:29:17, skipping insertion in model container [2025-04-29 11:29:17,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:29:17" (3/3) ... [2025-04-29 11:29:17,843 INFO L128 eAbstractionObserver]: Analyzing ICFG rec_strcopy_malloc.c [2025-04-29 11:29:17,854 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:29:17,855 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rec_strcopy_malloc.c that has 2 procedures, 43 locations, 47 edges, 1 initial locations, 0 loop locations, and 15 error locations. [2025-04-29 11:29:17,887 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:29:17,897 INFO L340 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@4dfd181c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:29:17,897 INFO L341 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-04-29 11:29:17,901 INFO L278 IsEmpty]: Start isEmpty. Operand has 43 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 40 states have internal predecessors, (41), 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) [2025-04-29 11:29:17,904 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:29:17,904 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:17,905 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:29:17,905 INFO L403 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)] === [2025-04-29 11:29:17,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:17,909 INFO L85 PathProgramCache]: Analyzing trace with hash 46825623, now seen corresponding path program 1 times [2025-04-29 11:29:17,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:17,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405622685] [2025-04-29 11:29:17,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:17,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:17,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:29:17,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:29:17,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:17,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:18,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:18,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:18,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405622685] [2025-04-29 11:29:18,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405622685] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:18,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:18,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:29:18,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846275005] [2025-04-29 11:29:18,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:18,066 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:29:18,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:18,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:29:18,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:29:18,084 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 40 states have internal predecessors, (41), 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 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:29:18,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:18,138 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2025-04-29 11:29:18,139 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:29:18,140 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-29 11:29:18,140 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:18,143 INFO L225 Difference]: With dead ends: 42 [2025-04-29 11:29:18,143 INFO L226 Difference]: Without dead ends: 40 [2025-04-29 11:29:18,144 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:29:18,147 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:18,148 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:29:18,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-29 11:29:18,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-04-29 11:29:18,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 37 states have internal predecessors, (38), 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) [2025-04-29 11:29:18,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2025-04-29 11:29:18,176 INFO L79 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 5 [2025-04-29 11:29:18,176 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:18,176 INFO L485 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2025-04-29 11:29:18,177 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:29:18,177 INFO L278 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2025-04-29 11:29:18,177 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:29:18,177 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:18,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:29:18,178 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:29:18,178 INFO L403 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)] === [2025-04-29 11:29:18,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:18,179 INFO L85 PathProgramCache]: Analyzing trace with hash 46825624, now seen corresponding path program 1 times [2025-04-29 11:29:18,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:18,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214688852] [2025-04-29 11:29:18,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:18,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:18,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:29:18,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:29:18,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:18,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:18,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:18,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:18,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214688852] [2025-04-29 11:29:18,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214688852] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:18,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:18,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:29:18,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809974984] [2025-04-29 11:29:18,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:18,326 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:29:18,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:18,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:29:18,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:29:18,327 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:29:18,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:18,372 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2025-04-29 11:29:18,372 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:29:18,373 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-29 11:29:18,373 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:18,373 INFO L225 Difference]: With dead ends: 44 [2025-04-29 11:29:18,374 INFO L226 Difference]: Without dead ends: 44 [2025-04-29 11:29:18,374 INFO L436 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 [2025-04-29 11:29:18,375 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:18,375 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 107 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:29:18,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-29 11:29:18,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-04-29 11:29:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.6) internal successors, (40), 39 states have internal predecessors, (40), 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) [2025-04-29 11:29:18,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2025-04-29 11:29:18,378 INFO L79 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 5 [2025-04-29 11:29:18,378 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:18,378 INFO L485 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2025-04-29 11:29:18,378 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:29:18,378 INFO L278 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2025-04-29 11:29:18,379 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-29 11:29:18,379 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:18,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-29 11:29:18,379 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:29:18,379 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:29:18,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:18,379 INFO L85 PathProgramCache]: Analyzing trace with hash 46827546, now seen corresponding path program 1 times [2025-04-29 11:29:18,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:18,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595926002] [2025-04-29 11:29:18,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:18,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:18,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-29 11:29:18,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-29 11:29:18,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:18,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:18,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:18,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595926002] [2025-04-29 11:29:18,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595926002] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:18,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:18,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:29:18,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732149854] [2025-04-29 11:29:18,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:18,519 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:29:18,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:18,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:29:18,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:29:18,519 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:29:18,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:18,562 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2025-04-29 11:29:18,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:29:18,562 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-29 11:29:18,563 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:18,564 INFO L225 Difference]: With dead ends: 41 [2025-04-29 11:29:18,564 INFO L226 Difference]: Without dead ends: 41 [2025-04-29 11:29:18,565 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:29:18,565 INFO L437 NwaCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:18,566 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:29:18,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-04-29 11:29:18,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2025-04-29 11:29:18,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.608695652173913) internal successors, (37), 36 states have internal predecessors, (37), 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) [2025-04-29 11:29:18,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2025-04-29 11:29:18,570 INFO L79 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 5 [2025-04-29 11:29:18,570 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:18,571 INFO L485 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2025-04-29 11:29:18,571 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:29:18,571 INFO L278 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2025-04-29 11:29:18,571 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:29:18,571 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:18,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:18,572 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:29:18,572 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:29:18,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:18,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1718638621, now seen corresponding path program 1 times [2025-04-29 11:29:18,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:18,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105487552] [2025-04-29 11:29:18,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:18,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:18,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:29:18,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:29:18,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:18,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:18,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:18,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:18,729 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105487552] [2025-04-29 11:29:18,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105487552] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:18,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:18,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:29:18,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131092025] [2025-04-29 11:29:18,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:18,730 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:29:18,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:18,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:29:18,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:29:18,730 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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) [2025-04-29 11:29:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:18,807 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2025-04-29 11:29:18,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:29:18,808 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 10 [2025-04-29 11:29:18,808 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:18,808 INFO L225 Difference]: With dead ends: 37 [2025-04-29 11:29:18,808 INFO L226 Difference]: Without dead ends: 37 [2025-04-29 11:29:18,808 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:29:18,809 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:18,809 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 100 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:29:18,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-04-29 11:29:18,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-04-29 11:29:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 34 states have internal predecessors, (35), 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) [2025-04-29 11:29:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2025-04-29 11:29:18,811 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2025-04-29 11:29:18,812 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:18,812 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2025-04-29 11:29:18,812 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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) [2025-04-29 11:29:18,812 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2025-04-29 11:29:18,812 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-29 11:29:18,812 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:18,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:18,812 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:29:18,812 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:29:18,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:18,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1718638620, now seen corresponding path program 1 times [2025-04-29 11:29:18,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:18,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168938383] [2025-04-29 11:29:18,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:18,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:18,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:29:18,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:29:18,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:18,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:18,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:18,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168938383] [2025-04-29 11:29:18,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168938383] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:18,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:18,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:29:18,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607968775] [2025-04-29 11:29:18,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:18,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:29:18,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:18,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:29:18,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:29:18,995 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 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) [2025-04-29 11:29:19,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:19,124 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2025-04-29 11:29:19,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:29:19,124 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 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 10 [2025-04-29 11:29:19,124 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:19,125 INFO L225 Difference]: With dead ends: 48 [2025-04-29 11:29:19,125 INFO L226 Difference]: Without dead ends: 48 [2025-04-29 11:29:19,125 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-04-29 11:29:19,126 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:19,126 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 186 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:29:19,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-04-29 11:29:19,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2025-04-29 11:29:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.5) internal successors, (45), 42 states have internal predecessors, (45), 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) [2025-04-29 11:29:19,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2025-04-29 11:29:19,129 INFO L79 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 10 [2025-04-29 11:29:19,129 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:19,129 INFO L485 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2025-04-29 11:29:19,129 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 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) [2025-04-29 11:29:19,129 INFO L278 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2025-04-29 11:29:19,129 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:29:19,129 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:19,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:19,130 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:29:19,130 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:29:19,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:19,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1738189725, now seen corresponding path program 1 times [2025-04-29 11:29:19,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:19,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876374070] [2025-04-29 11:29:19,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:19,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:19,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:29:19,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:29:19,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:19,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:19,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:19,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:19,176 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876374070] [2025-04-29 11:29:19,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876374070] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:19,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:19,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:29:19,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064936900] [2025-04-29 11:29:19,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:19,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:29:19,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:19,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:29:19,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:29:19,177 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 5 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:29:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:19,219 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2025-04-29 11:29:19,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:29:19,219 INFO L79 Accepts]: Start accepts. Automaton has has 5 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-29 11:29:19,219 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:19,219 INFO L225 Difference]: With dead ends: 45 [2025-04-29 11:29:19,220 INFO L226 Difference]: Without dead ends: 45 [2025-04-29 11:29:19,220 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:29:19,220 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:19,220 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 71 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:29:19,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-29 11:29:19,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-04-29 11:29:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 41 states have internal predecessors, (43), 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) [2025-04-29 11:29:19,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-04-29 11:29:19,223 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 11 [2025-04-29 11:29:19,223 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:19,223 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-04-29 11:29:19,223 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:29:19,223 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-04-29 11:29:19,223 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:29:19,223 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:19,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:19,223 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:29:19,224 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting rec_strcopy_helperErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:29:19,224 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:19,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1738189724, now seen corresponding path program 1 times [2025-04-29 11:29:19,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:19,224 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549738373] [2025-04-29 11:29:19,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:19,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:19,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:29:19,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:29:19,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:19,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:19,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:19,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:19,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549738373] [2025-04-29 11:29:19,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549738373] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:19,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:19,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:29:19,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211822665] [2025-04-29 11:29:19,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:19,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:29:19,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:19,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:29:19,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:29:19,312 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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) [2025-04-29 11:29:19,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:19,364 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2025-04-29 11:29:19,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:29:19,364 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 11 [2025-04-29 11:29:19,365 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:19,365 INFO L225 Difference]: With dead ends: 60 [2025-04-29 11:29:19,365 INFO L226 Difference]: Without dead ends: 60 [2025-04-29 11:29:19,365 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:29:19,366 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:19,366 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 130 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:29:19,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-29 11:29:19,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2025-04-29 11:29:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 54 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-29 11:29:19,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2025-04-29 11:29:19,369 INFO L79 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 11 [2025-04-29 11:29:19,369 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:19,369 INFO L485 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2025-04-29 11:29:19,369 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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) [2025-04-29 11:29:19,369 INFO L278 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2025-04-29 11:29:19,369 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-29 11:29:19,369 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:19,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:19,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:29:19,370 INFO L403 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)] === [2025-04-29 11:29:19,370 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:19,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1058131354, now seen corresponding path program 1 times [2025-04-29 11:29:19,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:19,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883971727] [2025-04-29 11:29:19,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:19,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:19,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:29:19,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:29:19,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:19,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:19,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:19,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883971727] [2025-04-29 11:29:19,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883971727] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:19,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:19,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:29:19,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677244030] [2025-04-29 11:29:19,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:19,456 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:29:19,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:19,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:29:19,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:29:19,457 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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) [2025-04-29 11:29:19,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:19,517 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2025-04-29 11:29:19,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:29:19,517 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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 11 [2025-04-29 11:29:19,517 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:19,518 INFO L225 Difference]: With dead ends: 59 [2025-04-29 11:29:19,519 INFO L226 Difference]: Without dead ends: 59 [2025-04-29 11:29:19,519 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:29:19,519 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:19,519 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 116 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:29:19,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-29 11:29:19,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2025-04-29 11:29:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.4) internal successors, (42), 41 states have internal predecessors, (42), 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) [2025-04-29 11:29:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2025-04-29 11:29:19,523 INFO L79 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 11 [2025-04-29 11:29:19,523 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:19,523 INFO L485 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2025-04-29 11:29:19,523 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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) [2025-04-29 11:29:19,523 INFO L278 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2025-04-29 11:29:19,523 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:29:19,523 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:19,523 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:19,524 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:29:19,524 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:29:19,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:19,524 INFO L85 PathProgramCache]: Analyzing trace with hash -794664304, now seen corresponding path program 1 times [2025-04-29 11:29:19,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:19,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339894066] [2025-04-29 11:29:19,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:19,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:19,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:29:19,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:29:19,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:19,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:19,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:19,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:19,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339894066] [2025-04-29 11:29:19,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339894066] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:19,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:19,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:29:19,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963129678] [2025-04-29 11:29:19,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:19,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:29:19,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:19,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:29:19,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:29:19,715 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:29:19,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:19,799 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2025-04-29 11:29:19,799 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:29:19,799 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-29 11:29:19,800 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:19,800 INFO L225 Difference]: With dead ends: 60 [2025-04-29 11:29:19,800 INFO L226 Difference]: Without dead ends: 60 [2025-04-29 11:29:19,800 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:29:19,801 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:19,801 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 250 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:29:19,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-29 11:29:19,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2025-04-29 11:29:19,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 53 states have internal predecessors, (53), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-04-29 11:29:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2025-04-29 11:29:19,804 INFO L79 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 17 [2025-04-29 11:29:19,804 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:19,804 INFO L485 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2025-04-29 11:29:19,804 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:29:19,805 INFO L278 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2025-04-29 11:29:19,805 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:29:19,805 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:19,805 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:19,805 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:29:19,805 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:29:19,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:19,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2074527982, now seen corresponding path program 1 times [2025-04-29 11:29:19,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:19,807 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092863705] [2025-04-29 11:29:19,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:19,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:19,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:29:19,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:29:19,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:19,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:20,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:20,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092863705] [2025-04-29 11:29:20,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092863705] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:29:20,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955876069] [2025-04-29 11:29:20,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:20,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:20,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:29:20,143 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:29:20,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:29:20,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:29:20,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:29:20,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:20,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:20,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-29 11:29:20,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:29:20,235 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:29:20,238 INFO L354 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 [2025-04-29 11:29:20,260 INFO L354 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 [2025-04-29 11:29:20,407 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:29:20,408 INFO L354 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 16 treesize of output 15 [2025-04-29 11:29:20,462 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:29:20,462 INFO L354 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 [2025-04-29 11:29:20,712 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:29:20,713 INFO L354 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 19 [2025-04-29 11:29:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:20,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:29:21,288 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2025-04-29 11:29:21,296 INFO L354 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 22 treesize of output 20 [2025-04-29 11:29:21,456 INFO L354 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 27 treesize of output 25 [2025-04-29 11:29:21,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:21,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955876069] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:29:21,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:29:21,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 32 [2025-04-29 11:29:21,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850652653] [2025-04-29 11:29:21,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:29:21,468 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-29 11:29:21,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:21,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-29 11:29:21,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=952, Unknown=0, NotChecked=0, Total=1056 [2025-04-29 11:29:21,469 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 33 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:29:22,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:22,082 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2025-04-29 11:29:22,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:29:22,083 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 5 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 17 [2025-04-29 11:29:22,083 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:22,083 INFO L225 Difference]: With dead ends: 69 [2025-04-29 11:29:22,083 INFO L226 Difference]: Without dead ends: 69 [2025-04-29 11:29:22,084 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=191, Invalid=1531, Unknown=0, NotChecked=0, Total=1722 [2025-04-29 11:29:22,084 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 74 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:22,084 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 460 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-29 11:29:22,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-04-29 11:29:22,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2025-04-29 11:29:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 60 states have internal predecessors, (61), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-29 11:29:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2025-04-29 11:29:22,087 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 17 [2025-04-29 11:29:22,087 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:22,087 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2025-04-29 11:29:22,087 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 28 states have internal predecessors, (38), 6 states have call successors, (6), 5 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:29:22,089 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2025-04-29 11:29:22,089 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-29 11:29:22,089 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:22,089 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:22,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:29:22,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-29 11:29:22,290 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting rec_strcopy_helperErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:29:22,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:22,290 INFO L85 PathProgramCache]: Analyzing trace with hash 114141942, now seen corresponding path program 1 times [2025-04-29 11:29:22,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:22,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348161471] [2025-04-29 11:29:22,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:22,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:22,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:29:22,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:29:22,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:22,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:22,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:22,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348161471] [2025-04-29 11:29:22,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348161471] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:29:22,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323540783] [2025-04-29 11:29:22,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:22,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:22,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:29:22,643 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:29:22,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:29:22,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:29:22,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:29:22,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:22,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:22,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-04-29 11:29:22,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:29:22,696 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-29 11:29:22,755 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:29:22,755 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2025-04-29 11:29:22,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:22,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:29:23,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:23,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323540783] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:29:23,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:29:23,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 28 [2025-04-29 11:29:23,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093645100] [2025-04-29 11:29:23,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:29:23,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-29 11:29:23,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:23,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-29 11:29:23,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2025-04-29 11:29:23,291 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 29 states, 25 states have (on average 1.68) internal successors, (42), 23 states have internal predecessors, (42), 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) [2025-04-29 11:29:23,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:23,756 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2025-04-29 11:29:23,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:29:23,756 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 1.68) internal successors, (42), 23 states have internal predecessors, (42), 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 18 [2025-04-29 11:29:23,756 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:23,756 INFO L225 Difference]: With dead ends: 65 [2025-04-29 11:29:23,756 INFO L226 Difference]: Without dead ends: 65 [2025-04-29 11:29:23,757 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=195, Invalid=1365, Unknown=0, NotChecked=0, Total=1560 [2025-04-29 11:29:23,757 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 135 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:23,758 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 384 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-29 11:29:23,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-04-29 11:29:23,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-04-29 11:29:23,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 59 states have internal predecessors, (59), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-29 11:29:23,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2025-04-29 11:29:23,762 INFO L79 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 18 [2025-04-29 11:29:23,762 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:23,762 INFO L485 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2025-04-29 11:29:23,762 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 1.68) internal successors, (42), 23 states have internal predecessors, (42), 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) [2025-04-29 11:29:23,762 INFO L278 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2025-04-29 11:29:23,762 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-29 11:29:23,762 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:23,762 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:23,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:29:23,966 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-29 11:29:23,967 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:29:23,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:23,967 INFO L85 PathProgramCache]: Analyzing trace with hash 885260528, now seen corresponding path program 1 times [2025-04-29 11:29:23,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:23,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254174471] [2025-04-29 11:29:23,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:23,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:23,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:29:23,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:29:23,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:23,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:24,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:24,001 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254174471] [2025-04-29 11:29:24,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254174471] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:24,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:24,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:29:24,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489706652] [2025-04-29 11:29:24,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:24,001 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:29:24,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:24,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:29:24,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:29:24,002 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) [2025-04-29 11:29:24,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:24,011 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2025-04-29 11:29:24,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:29:24,012 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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 19 [2025-04-29 11:29:24,012 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:24,013 INFO L225 Difference]: With dead ends: 64 [2025-04-29 11:29:24,013 INFO L226 Difference]: Without dead ends: 64 [2025-04-29 11:29:24,013 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:29:24,013 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:24,013 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:29:24,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-04-29 11:29:24,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-04-29 11:29:24,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 58 states have internal predecessors, (58), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-29 11:29:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2025-04-29 11:29:24,017 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 19 [2025-04-29 11:29:24,017 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:24,017 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2025-04-29 11:29:24,018 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 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) [2025-04-29 11:29:24,018 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2025-04-29 11:29:24,018 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 11:29:24,018 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:24,018 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:24,018 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:29:24,018 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:29:24,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:24,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1673272664, now seen corresponding path program 1 times [2025-04-29 11:29:24,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:24,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935122210] [2025-04-29 11:29:24,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:24,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:24,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:29:24,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:29:24,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:24,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:24,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:24,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935122210] [2025-04-29 11:29:24,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935122210] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:24,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:24,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:29:24,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453091379] [2025-04-29 11:29:24,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:24,052 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:29:24,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:24,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:29:24,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:29:24,052 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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) [2025-04-29 11:29:24,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:24,072 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2025-04-29 11:29:24,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:29:24,073 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 20 [2025-04-29 11:29:24,073 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:24,073 INFO L225 Difference]: With dead ends: 63 [2025-04-29 11:29:24,073 INFO L226 Difference]: Without dead ends: 63 [2025-04-29 11:29:24,073 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:29:24,074 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:24,074 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:29:24,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-04-29 11:29:24,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-04-29 11:29:24,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.1875) internal successors, (57), 57 states have internal predecessors, (57), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-29 11:29:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2025-04-29 11:29:24,078 INFO L79 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 20 [2025-04-29 11:29:24,078 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:24,078 INFO L485 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2025-04-29 11:29:24,078 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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) [2025-04-29 11:29:24,078 INFO L278 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2025-04-29 11:29:24,078 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-29 11:29:24,078 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:24,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:24,078 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:29:24,078 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:29:24,078 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:24,078 INFO L85 PathProgramCache]: Analyzing trace with hash 331845106, now seen corresponding path program 1 times [2025-04-29 11:29:24,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:24,078 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620658778] [2025-04-29 11:29:24,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:24,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:24,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:29:24,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:29:24,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:24,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:24,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:24,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:24,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620658778] [2025-04-29 11:29:24,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620658778] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:24,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:24,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:29:24,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856181004] [2025-04-29 11:29:24,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:24,123 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:29:24,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:24,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:29:24,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:29:24,123 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 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) [2025-04-29 11:29:24,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:24,165 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2025-04-29 11:29:24,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:29:24,165 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 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 21 [2025-04-29 11:29:24,165 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:24,166 INFO L225 Difference]: With dead ends: 62 [2025-04-29 11:29:24,166 INFO L226 Difference]: Without dead ends: 62 [2025-04-29 11:29:24,166 INFO L436 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 [2025-04-29 11:29:24,166 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:24,166 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 96 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:29:24,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-04-29 11:29:24,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-04-29 11:29:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 56 states have internal predecessors, (56), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-29 11:29:24,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2025-04-29 11:29:24,169 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 21 [2025-04-29 11:29:24,173 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:24,173 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2025-04-29 11:29:24,173 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 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) [2025-04-29 11:29:24,173 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2025-04-29 11:29:24,173 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 11:29:24,173 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:24,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:24,173 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:29:24,173 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:29:24,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:24,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1697263770, now seen corresponding path program 1 times [2025-04-29 11:29:24,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:24,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970779012] [2025-04-29 11:29:24,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:24,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:24,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:29:24,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:29:24,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:24,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:24,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:24,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970779012] [2025-04-29 11:29:24,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970779012] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:24,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:24,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:29:24,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711305285] [2025-04-29 11:29:24,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:24,213 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:29:24,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:24,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:29:24,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:29:24,213 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2025-04-29 11:29:24,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:24,220 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2025-04-29 11:29:24,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:29:24,220 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 22 [2025-04-29 11:29:24,220 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:24,221 INFO L225 Difference]: With dead ends: 61 [2025-04-29 11:29:24,221 INFO L226 Difference]: Without dead ends: 61 [2025-04-29 11:29:24,222 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:29:24,222 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 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 [2025-04-29 11:29:24,222 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:29:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-04-29 11:29:24,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-04-29 11:29:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 55 states have internal predecessors, (55), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2025-04-29 11:29:24,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2025-04-29 11:29:24,225 INFO L79 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 22 [2025-04-29 11:29:24,225 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:24,225 INFO L485 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2025-04-29 11:29:24,225 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2025-04-29 11:29:24,225 INFO L278 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2025-04-29 11:29:24,225 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:29:24,225 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:24,225 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:24,225 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:29:24,228 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:29:24,228 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:24,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1413481378, now seen corresponding path program 2 times [2025-04-29 11:29:24,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:24,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788557247] [2025-04-29 11:29:24,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:29:24,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:24,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-29 11:29:24,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:29:24,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:29:24,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:24,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:24,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788557247] [2025-04-29 11:29:24,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788557247] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:29:24,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912638820] [2025-04-29 11:29:24,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:29:24,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:24,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:29:24,776 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:29:24,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:29:24,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-29 11:29:24,828 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:29:24,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:29:24,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:24,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-04-29 11:29:24,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:29:24,849 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-29 11:29:24,879 INFO L354 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 [2025-04-29 11:29:24,979 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:29:24,979 INFO L354 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 43 treesize of output 37 [2025-04-29 11:29:25,581 INFO L325 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2025-04-29 11:29:25,581 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2025-04-29 11:29:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:25,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:29:26,470 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-04-29 11:29:26,476 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-29 11:29:26,584 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:26,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912638820] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:29:26,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:29:26,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 46 [2025-04-29 11:29:26,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857481205] [2025-04-29 11:29:26,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:29:26,584 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-04-29 11:29:26,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:26,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-04-29 11:29:26,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1983, Unknown=0, NotChecked=0, Total=2162 [2025-04-29 11:29:26,585 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 47 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 38 states have internal predecessors, (58), 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) [2025-04-29 11:29:28,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:28,423 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2025-04-29 11:29:28,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-29 11:29:28,424 INFO L79 Accepts]: Start accepts. Automaton has has 47 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 38 states have internal predecessors, (58), 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 24 [2025-04-29 11:29:28,424 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:28,424 INFO L225 Difference]: With dead ends: 96 [2025-04-29 11:29:28,424 INFO L226 Difference]: Without dead ends: 96 [2025-04-29 11:29:28,425 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=475, Invalid=4217, Unknown=0, NotChecked=0, Total=4692 [2025-04-29 11:29:28,426 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 198 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:28,426 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 561 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 11:29:28,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-04-29 11:29:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2025-04-29 11:29:28,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.144927536231884) internal successors, (79), 79 states have internal predecessors, (79), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-29 11:29:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2025-04-29 11:29:28,429 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 24 [2025-04-29 11:29:28,430 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:28,430 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2025-04-29 11:29:28,430 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 38 states have internal predecessors, (58), 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) [2025-04-29 11:29:28,430 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2025-04-29 11:29:28,430 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 11:29:28,430 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:28,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:28,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:29:28,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:28,630 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:29:28,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:28,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1075569396, now seen corresponding path program 1 times [2025-04-29 11:29:28,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:28,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678521549] [2025-04-29 11:29:28,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:28,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:28,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:29:28,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:29:28,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:28,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:28,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:28,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:28,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678521549] [2025-04-29 11:29:28,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678521549] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:28,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:28,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:29:28,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108849726] [2025-04-29 11:29:28,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:28,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:29:28,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:28,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:29:28,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:29:28,669 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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) [2025-04-29 11:29:28,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:28,686 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2025-04-29 11:29:28,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:29:28,687 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 23 [2025-04-29 11:29:28,688 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:28,688 INFO L225 Difference]: With dead ends: 87 [2025-04-29 11:29:28,688 INFO L226 Difference]: Without dead ends: 87 [2025-04-29 11:29:28,688 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:29:28,689 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:28,689 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 81 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:29:28,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-04-29 11:29:28,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-04-29 11:29:28,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 78 states have internal predecessors, (78), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-29 11:29:28,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2025-04-29 11:29:28,693 INFO L79 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 23 [2025-04-29 11:29:28,693 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:28,694 INFO L485 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2025-04-29 11:29:28,694 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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) [2025-04-29 11:29:28,694 INFO L278 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2025-04-29 11:29:28,694 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-29 11:29:28,694 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:28,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:28,694 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:29:28,694 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:29:28,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:28,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1017087012, now seen corresponding path program 1 times [2025-04-29 11:29:28,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:28,694 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808437842] [2025-04-29 11:29:28,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:28,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:28,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:29:28,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:29:28,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:28,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:28,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:28,767 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808437842] [2025-04-29 11:29:28,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808437842] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:28,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:28,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 11:29:28,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094570869] [2025-04-29 11:29:28,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:28,768 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:29:28,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:28,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:29:28,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:29:28,769 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 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) [2025-04-29 11:29:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:28,814 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2025-04-29 11:29:28,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:29:28,814 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 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 24 [2025-04-29 11:29:28,815 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:28,815 INFO L225 Difference]: With dead ends: 86 [2025-04-29 11:29:28,815 INFO L226 Difference]: Without dead ends: 86 [2025-04-29 11:29:28,815 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:29:28,815 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:28,815 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:29:28,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-04-29 11:29:28,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-04-29 11:29:28,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 77 states have internal predecessors, (77), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-04-29 11:29:28,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2025-04-29 11:29:28,819 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 24 [2025-04-29 11:29:28,820 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:28,820 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2025-04-29 11:29:28,820 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 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) [2025-04-29 11:29:28,820 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2025-04-29 11:29:28,821 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-29 11:29:28,822 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:28,822 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:28,822 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:29:28,822 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:29:28,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:28,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1464926217, now seen corresponding path program 1 times [2025-04-29 11:29:28,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:28,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585771774] [2025-04-29 11:29:28,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:29:28,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:28,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-29 11:29:28,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 11:29:28,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:29:28,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:29:28,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:28,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585771774] [2025-04-29 11:29:28,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585771774] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:29:28,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:29:28,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:29:28,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546084059] [2025-04-29 11:29:28,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:29:28,974 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:29:28,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:29:28,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:29:28,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:29:28,975 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 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) [2025-04-29 11:29:29,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:29:29,031 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2025-04-29 11:29:29,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:29:29,032 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 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 25 [2025-04-29 11:29:29,032 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:29:29,032 INFO L225 Difference]: With dead ends: 85 [2025-04-29 11:29:29,032 INFO L226 Difference]: Without dead ends: 51 [2025-04-29 11:29:29,032 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:29:29,033 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:29:29,033 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 111 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:29:29,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-04-29 11:29:29,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2025-04-29 11:29:29,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 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) [2025-04-29 11:29:29,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2025-04-29 11:29:29,035 INFO L79 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 25 [2025-04-29 11:29:29,035 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:29:29,035 INFO L485 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2025-04-29 11:29:29,035 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 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) [2025-04-29 11:29:29,035 INFO L278 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2025-04-29 11:29:29,035 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:29:29,035 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:29:29,035 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:29:29,035 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:29:29,035 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [rec_strcopy_helperErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, rec_strcopy_helperErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2025-04-29 11:29:29,036 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:29:29,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1253297390, now seen corresponding path program 3 times [2025-04-29 11:29:29,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:29:29,037 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265632539] [2025-04-29 11:29:29,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:29:29,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:29:29,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 6 equivalence classes. [2025-04-29 11:29:29,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:29:29,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-29 11:29:29,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:29,577 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-29 11:29:29,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:29:29,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265632539] [2025-04-29 11:29:29,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265632539] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:29:29,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230648818] [2025-04-29 11:29:29,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:29:29,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:29:29,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:29:29,579 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:29:29,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:29:29,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 6 equivalence classes. [2025-04-29 11:29:29,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:29:29,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-29 11:29:29,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:29:29,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-04-29 11:29:29,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:29:29,667 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-29 11:29:29,668 INFO L354 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 [2025-04-29 11:29:29,695 INFO L354 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 [2025-04-29 11:29:29,768 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:29:29,768 INFO L354 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 [2025-04-29 11:29:29,772 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-29 11:30:15,657 INFO L325 Elim1Store]: treesize reduction 16, result has 88.7 percent of original size [2025-04-29 11:30:15,657 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 147 [2025-04-29 11:30:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:30:16,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:30:18,180 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2025-04-29 11:30:18,228 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:30:18,228 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 176 [2025-04-29 11:30:18,628 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:30:18,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230648818] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:30:18,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:30:18,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 28, 28] total 69 [2025-04-29 11:30:18,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766923832] [2025-04-29 11:30:18,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:30:18,629 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2025-04-29 11:30:18,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:30:18,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2025-04-29 11:30:18,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=4370, Unknown=9, NotChecked=0, Total=4830 [2025-04-29 11:30:18,630 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 70 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 56 states have internal predecessors, (95), 15 states have call successors, (15), 14 states have call predecessors, (15), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:30:22,819 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15