/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/termination-15/cstrncmp_malloc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:53:20,809 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:53:20,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:53:20,861 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:53:20,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:53:20,863 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:53:20,865 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:53:20,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:53:20,870 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:53:20,871 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:53:20,872 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:53:20,874 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:53:20,874 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:53:20,875 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:53:20,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:53:20,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:53:20,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:53:20,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:53:20,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:53:20,885 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:53:20,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:53:20,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:53:20,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:53:20,895 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:53:20,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:53:20,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:53:20,906 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:53:20,908 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:53:20,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:53:20,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:53:20,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:53:20,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:53:20,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:53:20,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:53:20,920 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:53:20,920 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:53:20,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:53:20,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:53:20,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:53:20,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:53:20,924 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:53:20,926 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 17:53:20,989 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:53:20,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:53:20,990 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:53:20,990 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:53:20,991 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:53:20,992 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:53:20,994 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:53:20,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:53:20,995 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:53:20,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:53:20,996 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:53:20,997 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:53:20,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:53:20,997 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:53:20,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:53:20,998 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:53:20,998 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:53:20,998 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:53:20,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:53:20,998 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:53:20,999 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:53:20,999 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:53:20,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:53:20,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:53:20,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:53:21,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:53:21,000 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:53:21,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:53:21,000 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:53:21,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:53:21,001 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 17:53:21,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:53:21,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:53:21,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:53:21,459 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:53:21,460 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:53:21,461 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrncmp_malloc.i [2022-10-15 17:53:21,536 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8e79e755/5a8fcf3f13c64e07aaf65fdd5fa95af7/FLAG375f483a1 [2022-10-15 17:53:22,320 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:53:22,320 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrncmp_malloc.i [2022-10-15 17:53:22,337 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8e79e755/5a8fcf3f13c64e07aaf65fdd5fa95af7/FLAG375f483a1 [2022-10-15 17:53:22,587 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8e79e755/5a8fcf3f13c64e07aaf65fdd5fa95af7 [2022-10-15 17:53:22,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:53:22,599 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:53:22,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:53:22,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:53:22,608 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:53:22,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:53:22" (1/1) ... [2022-10-15 17:53:22,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71faa181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:22, skipping insertion in model container [2022-10-15 17:53:22,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:53:22" (1/1) ... [2022-10-15 17:53:22,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:53:22,652 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:53:23,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:53:23,066 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:53:23,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:53:23,198 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:53:23,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:23 WrapperNode [2022-10-15 17:53:23,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:53:23,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:53:23,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:53:23,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:53:23,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:23" (1/1) ... [2022-10-15 17:53:23,226 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:23" (1/1) ... [2022-10-15 17:53:23,257 INFO L138 Inliner]: procedures = 152, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95 [2022-10-15 17:53:23,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:53:23,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:53:23,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:53:23,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:53:23,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:23" (1/1) ... [2022-10-15 17:53:23,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:23" (1/1) ... [2022-10-15 17:53:23,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:23" (1/1) ... [2022-10-15 17:53:23,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:23" (1/1) ... [2022-10-15 17:53:23,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:23" (1/1) ... [2022-10-15 17:53:23,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:23" (1/1) ... [2022-10-15 17:53:23,287 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:23" (1/1) ... [2022-10-15 17:53:23,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:23" (1/1) ... [2022-10-15 17:53:23,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:53:23,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:53:23,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:53:23,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:53:23,294 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:23" (1/1) ... [2022-10-15 17:53:23,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:53:23,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:53:23,340 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 17:53:23,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 17:53:23,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 17:53:23,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 17:53:23,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 17:53:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 17:53:23,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:53:23,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:53:23,590 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:53:23,594 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:53:24,012 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:53:24,022 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:53:24,022 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-15 17:53:24,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:53:24 BoogieIcfgContainer [2022-10-15 17:53:24,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:53:24,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:53:24,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:53:24,033 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:53:24,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:53:22" (1/3) ... [2022-10-15 17:53:24,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d34b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:53:24, skipping insertion in model container [2022-10-15 17:53:24,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:53:23" (2/3) ... [2022-10-15 17:53:24,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d34b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:53:24, skipping insertion in model container [2022-10-15 17:53:24,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:53:24" (3/3) ... [2022-10-15 17:53:24,038 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrncmp_malloc.i [2022-10-15 17:53:24,083 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:53:24,083 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-10-15 17:53:24,166 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:53:24,176 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5b8d74e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:53:24,177 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-10-15 17:53:24,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 55 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:24,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 17:53:24,192 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:24,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 17:53:24,193 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 17:53:24,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:24,202 INFO L85 PathProgramCache]: Analyzing trace with hash 889510731, now seen corresponding path program 1 times [2022-10-15 17:53:24,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:24,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051477934] [2022-10-15 17:53:24,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:24,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:24,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:24,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051477934] [2022-10-15 17:53:24,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051477934] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:24,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:24,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:53:24,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948545379] [2022-10-15 17:53:24,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:24,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:53:24,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:24,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:53:24,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:53:24,651 INFO L87 Difference]: Start difference. First operand has 56 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 55 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:24,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:24,766 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2022-10-15 17:53:24,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:53:24,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-15 17:53:24,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:24,781 INFO L225 Difference]: With dead ends: 54 [2022-10-15 17:53:24,782 INFO L226 Difference]: Without dead ends: 52 [2022-10-15 17:53:24,785 INFO L412 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 [2022-10-15 17:53:24,793 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 44 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:24,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 52 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:53:24,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-10-15 17:53:24,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-10-15 17:53:24,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-10-15 17:53:24,849 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 6 [2022-10-15 17:53:24,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:24,849 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-10-15 17:53:24,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:24,850 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-10-15 17:53:24,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 17:53:24,851 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:24,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 17:53:24,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:53:24,853 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 17:53:24,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:24,855 INFO L85 PathProgramCache]: Analyzing trace with hash 889510732, now seen corresponding path program 1 times [2022-10-15 17:53:24,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:24,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11851104] [2022-10-15 17:53:24,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:24,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:25,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:25,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11851104] [2022-10-15 17:53:25,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11851104] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:25,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:25,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:53:25,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840775332] [2022-10-15 17:53:25,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:25,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:53:25,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:25,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:53:25,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:53:25,104 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:25,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:25,153 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-10-15 17:53:25,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:53:25,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-15 17:53:25,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:25,155 INFO L225 Difference]: With dead ends: 50 [2022-10-15 17:53:25,155 INFO L226 Difference]: Without dead ends: 50 [2022-10-15 17:53:25,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:53:25,158 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 52 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:25,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:25,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-10-15 17:53:25,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-10-15 17:53:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 49 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2022-10-15 17:53:25,166 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 6 [2022-10-15 17:53:25,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:25,167 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2022-10-15 17:53:25,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:25,167 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-10-15 17:53:25,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 17:53:25,168 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:25,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:25,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:53:25,169 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 17:53:25,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:25,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028874, now seen corresponding path program 1 times [2022-10-15 17:53:25,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:25,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537185035] [2022-10-15 17:53:25,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:25,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:25,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:25,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:25,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537185035] [2022-10-15 17:53:25,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537185035] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:25,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:25,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:53:25,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409373969] [2022-10-15 17:53:25,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:25,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:53:25,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:25,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:53:25,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:53:25,270 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:25,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:25,307 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-10-15 17:53:25,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:53:25,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-15 17:53:25,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:25,309 INFO L225 Difference]: With dead ends: 49 [2022-10-15 17:53:25,309 INFO L226 Difference]: Without dead ends: 49 [2022-10-15 17:53:25,310 INFO L412 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 [2022-10-15 17:53:25,311 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 40 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:25,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 47 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:25,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-10-15 17:53:25,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-10-15 17:53:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.696969696969697) internal successors, (56), 48 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:25,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-10-15 17:53:25,320 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 7 [2022-10-15 17:53:25,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:25,321 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-10-15 17:53:25,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:25,321 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-10-15 17:53:25,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-15 17:53:25,322 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:25,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:25,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:53:25,323 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 17:53:25,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:25,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028875, now seen corresponding path program 1 times [2022-10-15 17:53:25,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:25,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665109448] [2022-10-15 17:53:25,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:25,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:25,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:25,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665109448] [2022-10-15 17:53:25,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665109448] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:25,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:25,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:53:25,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49669304] [2022-10-15 17:53:25,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:25,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:53:25,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:25,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:53:25,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:53:25,425 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:25,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:25,480 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-10-15 17:53:25,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:53:25,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-15 17:53:25,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:25,485 INFO L225 Difference]: With dead ends: 47 [2022-10-15 17:53:25,485 INFO L226 Difference]: Without dead ends: 47 [2022-10-15 17:53:25,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:53:25,488 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 48 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:25,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 41 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:25,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-15 17:53:25,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-10-15 17:53:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2022-10-15 17:53:25,508 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 7 [2022-10-15 17:53:25,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:25,509 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2022-10-15 17:53:25,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:25,510 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-10-15 17:53:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 17:53:25,510 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:25,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:25,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 17:53:25,513 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 17:53:25,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:25,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1024427030, now seen corresponding path program 1 times [2022-10-15 17:53:25,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:25,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154913214] [2022-10-15 17:53:25,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:25,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:25,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:25,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:25,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154913214] [2022-10-15 17:53:25,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154913214] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:25,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:25,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:53:25,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546552340] [2022-10-15 17:53:25,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:25,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:53:25,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:25,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:53:25,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:53:25,607 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:25,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:25,631 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-10-15 17:53:25,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:53:25,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 17:53:25,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:25,636 INFO L225 Difference]: With dead ends: 46 [2022-10-15 17:53:25,636 INFO L226 Difference]: Without dead ends: 46 [2022-10-15 17:53:25,636 INFO L412 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 [2022-10-15 17:53:25,641 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 40 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:25,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 51 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:25,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-15 17:53:25,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-10-15 17:53:25,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.606060606060606) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:25,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-10-15 17:53:25,651 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 12 [2022-10-15 17:53:25,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:25,651 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-10-15 17:53:25,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:25,652 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-10-15 17:53:25,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 17:53:25,652 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:25,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:25,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 17:53:25,653 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 17:53:25,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:25,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1024420044, now seen corresponding path program 1 times [2022-10-15 17:53:25,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:25,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724407301] [2022-10-15 17:53:25,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:25,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:25,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:25,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724407301] [2022-10-15 17:53:25,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724407301] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:25,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:25,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:53:25,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135573977] [2022-10-15 17:53:25,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:25,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:53:25,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:25,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:53:25,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:53:25,758 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:25,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:25,808 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-10-15 17:53:25,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:53:25,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 17:53:25,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:25,810 INFO L225 Difference]: With dead ends: 43 [2022-10-15 17:53:25,810 INFO L226 Difference]: Without dead ends: 43 [2022-10-15 17:53:25,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:53:25,812 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 62 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:25,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 48 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:25,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-10-15 17:53:25,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-10-15 17:53:25,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:25,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2022-10-15 17:53:25,819 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 12 [2022-10-15 17:53:25,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:25,820 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-10-15 17:53:25,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:25,820 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-10-15 17:53:25,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 17:53:25,821 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:25,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:25,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 17:53:25,822 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 17:53:25,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:25,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1024420043, now seen corresponding path program 1 times [2022-10-15 17:53:25,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:25,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890773174] [2022-10-15 17:53:25,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:25,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:25,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:25,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:25,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890773174] [2022-10-15 17:53:25,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890773174] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:25,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:25,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:53:25,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005612789] [2022-10-15 17:53:25,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:25,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:53:25,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:25,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:53:25,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:53:25,987 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:26,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:26,072 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2022-10-15 17:53:26,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:53:26,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 17:53:26,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:26,073 INFO L225 Difference]: With dead ends: 74 [2022-10-15 17:53:26,073 INFO L226 Difference]: Without dead ends: 74 [2022-10-15 17:53:26,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:53:26,075 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 264 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:26,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 70 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:53:26,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-10-15 17:53:26,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2022-10-15 17:53:26,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 51 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:26,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2022-10-15 17:53:26,083 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 12 [2022-10-15 17:53:26,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:26,083 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2022-10-15 17:53:26,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:26,084 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-10-15 17:53:26,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 17:53:26,084 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:26,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:26,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 17:53:26,085 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 17:53:26,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:26,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1692250283, now seen corresponding path program 1 times [2022-10-15 17:53:26,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:26,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533048754] [2022-10-15 17:53:26,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:26,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:26,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:26,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:26,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533048754] [2022-10-15 17:53:26,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533048754] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:26,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:26,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:53:26,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870412704] [2022-10-15 17:53:26,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:26,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:53:26,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:26,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:53:26,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:53:26,155 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:26,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:26,200 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2022-10-15 17:53:26,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 17:53:26,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-15 17:53:26,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:26,203 INFO L225 Difference]: With dead ends: 50 [2022-10-15 17:53:26,203 INFO L226 Difference]: Without dead ends: 50 [2022-10-15 17:53:26,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:53:26,208 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 58 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:26,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 48 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:26,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-10-15 17:53:26,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-10-15 17:53:26,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.4523809523809523) internal successors, (61), 49 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:26,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2022-10-15 17:53:26,227 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 13 [2022-10-15 17:53:26,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:26,227 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2022-10-15 17:53:26,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:26,228 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2022-10-15 17:53:26,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 17:53:26,230 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:26,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:26,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 17:53:26,232 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 17:53:26,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:26,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1692250282, now seen corresponding path program 1 times [2022-10-15 17:53:26,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:26,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402831898] [2022-10-15 17:53:26,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:26,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:26,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:26,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402831898] [2022-10-15 17:53:26,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402831898] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:26,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:26,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:53:26,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852270844] [2022-10-15 17:53:26,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:26,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 17:53:26,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:26,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 17:53:26,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:53:26,399 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:26,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:26,460 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2022-10-15 17:53:26,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:53:26,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-15 17:53:26,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:26,461 INFO L225 Difference]: With dead ends: 68 [2022-10-15 17:53:26,462 INFO L226 Difference]: Without dead ends: 68 [2022-10-15 17:53:26,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:53:26,463 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 240 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:26,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 62 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:26,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-10-15 17:53:26,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 52. [2022-10-15 17:53:26,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 51 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:26,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-10-15 17:53:26,468 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 13 [2022-10-15 17:53:26,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:26,468 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-10-15 17:53:26,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:26,469 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-10-15 17:53:26,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 17:53:26,470 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:26,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:26,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 17:53:26,470 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 17:53:26,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:26,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1332074865, now seen corresponding path program 1 times [2022-10-15 17:53:26,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:26,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471494214] [2022-10-15 17:53:26,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:26,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:26,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:26,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:26,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471494214] [2022-10-15 17:53:26,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471494214] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:26,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:26,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:53:26,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35357298] [2022-10-15 17:53:26,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:26,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:53:26,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:26,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:53:26,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:53:26,508 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:26,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:26,521 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-10-15 17:53:26,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:53:26,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 17:53:26,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:26,522 INFO L225 Difference]: With dead ends: 51 [2022-10-15 17:53:26,522 INFO L226 Difference]: Without dead ends: 51 [2022-10-15 17:53:26,523 INFO L412 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 [2022-10-15 17:53:26,524 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 31 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:26,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:26,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-10-15 17:53:26,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-10-15 17:53:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 50 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:26,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-10-15 17:53:26,528 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 15 [2022-10-15 17:53:26,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:26,529 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-10-15 17:53:26,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:26,529 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-10-15 17:53:26,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 17:53:26,530 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:26,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:26,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 17:53:26,530 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 17:53:26,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:26,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1655352018, now seen corresponding path program 1 times [2022-10-15 17:53:26,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:26,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812233788] [2022-10-15 17:53:26,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:26,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:26,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:26,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:26,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812233788] [2022-10-15 17:53:26,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812233788] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:26,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:26,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:53:26,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508840456] [2022-10-15 17:53:26,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:26,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 17:53:26,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:26,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 17:53:26,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:53:26,695 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:26,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:26,723 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-10-15 17:53:26,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:53:26,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-15 17:53:26,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:26,725 INFO L225 Difference]: With dead ends: 50 [2022-10-15 17:53:26,725 INFO L226 Difference]: Without dead ends: 50 [2022-10-15 17:53:26,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 17:53:26,728 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 36 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:26,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 42 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-10-15 17:53:26,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-10-15 17:53:26,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:26,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2022-10-15 17:53:26,733 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 16 [2022-10-15 17:53:26,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:26,733 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2022-10-15 17:53:26,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:26,734 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2022-10-15 17:53:26,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 17:53:26,735 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:26,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:26,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 17:53:26,735 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 17:53:26,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:26,748 INFO L85 PathProgramCache]: Analyzing trace with hash 223695124, now seen corresponding path program 1 times [2022-10-15 17:53:26,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:26,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587752930] [2022-10-15 17:53:26,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:26,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:26,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:26,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:26,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587752930] [2022-10-15 17:53:26,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587752930] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:26,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:26,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 17:53:26,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343434224] [2022-10-15 17:53:26,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:26,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:53:26,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:26,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:53:26,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:53:26,988 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:27,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:27,074 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-10-15 17:53:27,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 17:53:27,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-15 17:53:27,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:27,075 INFO L225 Difference]: With dead ends: 49 [2022-10-15 17:53:27,075 INFO L226 Difference]: Without dead ends: 35 [2022-10-15 17:53:27,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 17:53:27,076 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:27,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 91 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:27,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-10-15 17:53:27,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-10-15 17:53:27,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:27,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-10-15 17:53:27,080 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 17 [2022-10-15 17:53:27,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:27,080 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-10-15 17:53:27,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:27,081 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-10-15 17:53:27,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 17:53:27,081 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:27,082 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:27,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 17:53:27,082 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 17:53:27,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:27,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1931361025, now seen corresponding path program 1 times [2022-10-15 17:53:27,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:27,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297258821] [2022-10-15 17:53:27,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:27,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:27,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:27,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297258821] [2022-10-15 17:53:27,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297258821] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:27,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:27,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:53:27,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500933270] [2022-10-15 17:53:27,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:27,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:53:27,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:27,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:53:27,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:53:27,115 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:27,128 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-10-15 17:53:27,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:53:27,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-15 17:53:27,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:27,129 INFO L225 Difference]: With dead ends: 37 [2022-10-15 17:53:27,129 INFO L226 Difference]: Without dead ends: 36 [2022-10-15 17:53:27,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:53:27,130 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:27,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:27,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-10-15 17:53:27,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-10-15 17:53:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-10-15 17:53:27,134 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 17 [2022-10-15 17:53:27,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:27,134 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-10-15 17:53:27,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:27,135 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-10-15 17:53:27,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 17:53:27,136 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:27,136 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:27,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-15 17:53:27,136 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 17:53:27,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:27,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1820690373, now seen corresponding path program 1 times [2022-10-15 17:53:27,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:27,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505578934] [2022-10-15 17:53:27,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:27,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:27,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:27,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505578934] [2022-10-15 17:53:27,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505578934] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:27,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:27,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 17:53:27,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336405849] [2022-10-15 17:53:27,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:27,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:53:27,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:27,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:53:27,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:53:27,172 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:27,178 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-10-15 17:53:27,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:53:27,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-10-15 17:53:27,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:27,179 INFO L225 Difference]: With dead ends: 37 [2022-10-15 17:53:27,179 INFO L226 Difference]: Without dead ends: 36 [2022-10-15 17:53:27,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:53:27,180 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:27,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:27,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-10-15 17:53:27,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-10-15 17:53:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-10-15 17:53:27,184 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 20 [2022-10-15 17:53:27,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:27,184 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-10-15 17:53:27,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-10-15 17:53:27,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 17:53:27,185 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:27,185 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:27,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 17:53:27,186 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 17:53:27,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:27,186 INFO L85 PathProgramCache]: Analyzing trace with hash -88589824, now seen corresponding path program 1 times [2022-10-15 17:53:27,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:27,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95384058] [2022-10-15 17:53:27,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:27,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:27,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:27,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95384058] [2022-10-15 17:53:27,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95384058] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:27,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:53:27,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 17:53:27,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55374856] [2022-10-15 17:53:27,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:27,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 17:53:27,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:27,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 17:53:27,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:53:27,462 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:27,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:27,605 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-10-15 17:53:27,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 17:53:27,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 17:53:27,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:27,606 INFO L225 Difference]: With dead ends: 52 [2022-10-15 17:53:27,606 INFO L226 Difference]: Without dead ends: 36 [2022-10-15 17:53:27,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:53:27,609 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:27,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 128 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:27,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-10-15 17:53:27,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-10-15 17:53:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 35 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:27,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-10-15 17:53:27,616 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 22 [2022-10-15 17:53:27,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:27,616 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-10-15 17:53:27,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-10-15 17:53:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 17:53:27,644 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:27,645 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:27,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 17:53:27,645 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 17:53:27,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:27,646 INFO L85 PathProgramCache]: Analyzing trace with hash -906238274, now seen corresponding path program 1 times [2022-10-15 17:53:27,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:27,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156537408] [2022-10-15 17:53:27,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:27,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:28,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:28,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156537408] [2022-10-15 17:53:28,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156537408] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:53:28,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433958990] [2022-10-15 17:53:28,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:28,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:53:28,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:53:28,022 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) [2022-10-15 17:53:28,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 17:53:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:28,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 26 conjunts are in the unsatisfiable core [2022-10-15 17:53:28,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:53:28,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-10-15 17:53:28,604 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-10-15 17:53:28,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 10 [2022-10-15 17:53:28,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:28,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 17:53:28,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433958990] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:53:28,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 17:53:28,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 19 [2022-10-15 17:53:28,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882105085] [2022-10-15 17:53:28,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:53:28,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 17:53:28,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:28,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 17:53:28,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2022-10-15 17:53:28,655 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:28,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:28,822 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2022-10-15 17:53:28,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 17:53:28,822 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 17:53:28,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:28,823 INFO L225 Difference]: With dead ends: 51 [2022-10-15 17:53:28,823 INFO L226 Difference]: Without dead ends: 36 [2022-10-15 17:53:28,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2022-10-15 17:53:28,824 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:28,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 168 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 51 Unchecked, 0.0s Time] [2022-10-15 17:53:28,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-10-15 17:53:28,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-10-15 17:53:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-10-15 17:53:28,827 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 22 [2022-10-15 17:53:28,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:28,827 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-10-15 17:53:28,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:28,828 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-10-15 17:53:28,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 17:53:28,828 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:28,829 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:28,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 17:53:29,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-15 17:53:29,030 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 17:53:29,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:29,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1699785280, now seen corresponding path program 1 times [2022-10-15 17:53:29,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:29,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162431346] [2022-10-15 17:53:29,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:29,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:29,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:29,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:29,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162431346] [2022-10-15 17:53:29,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162431346] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:53:29,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229116352] [2022-10-15 17:53:29,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:29,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:53:29,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:53:29,362 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) [2022-10-15 17:53:29,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 17:53:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:29,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 39 conjunts are in the unsatisfiable core [2022-10-15 17:53:29,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:53:29,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-15 17:53:29,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-10-15 17:53:29,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-10-15 17:53:29,732 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:53:29,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-10-15 17:53:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:29,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:53:30,149 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:53:30,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-10-15 17:53:30,158 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:53:30,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 30 [2022-10-15 17:53:30,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 treesize of output 3 [2022-10-15 17:53:30,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-10-15 17:53:30,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-15 17:53:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:30,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229116352] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:53:30,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:53:30,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 10] total 21 [2022-10-15 17:53:30,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545941165] [2022-10-15 17:53:30,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:53:30,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-10-15 17:53:30,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:30,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-10-15 17:53:30,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=395, Unknown=1, NotChecked=0, Total=462 [2022-10-15 17:53:30,247 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 22 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:30,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:30,439 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-10-15 17:53:30,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-15 17:53:30,440 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 22 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 17:53:30,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:30,441 INFO L225 Difference]: With dead ends: 54 [2022-10-15 17:53:30,441 INFO L226 Difference]: Without dead ends: 54 [2022-10-15 17:53:30,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=467, Unknown=1, NotChecked=0, Total=552 [2022-10-15 17:53:30,443 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 49 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:30,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 219 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 158 Invalid, 0 Unknown, 26 Unchecked, 0.1s Time] [2022-10-15 17:53:30,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-15 17:53:30,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2022-10-15 17:53:30,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-10-15 17:53:30,446 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 22 [2022-10-15 17:53:30,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:30,447 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-10-15 17:53:30,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 22 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-10-15 17:53:30,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-15 17:53:30,452 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:30,452 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:30,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 17:53:30,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-15 17:53:30,667 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 17:53:30,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:30,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1153736107, now seen corresponding path program 1 times [2022-10-15 17:53:30,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:30,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871912130] [2022-10-15 17:53:30,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:30,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:31,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:31,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:31,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871912130] [2022-10-15 17:53:31,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871912130] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:53:31,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891004753] [2022-10-15 17:53:31,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:31,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:53:31,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:53:31,159 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) [2022-10-15 17:53:31,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 17:53:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:31,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 28 conjunts are in the unsatisfiable core [2022-10-15 17:53:31,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:53:31,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-10-15 17:53:31,705 INFO L356 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-10-15 17:53:31,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 38 [2022-10-15 17:53:31,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:31,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:53:32,369 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:53:32,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 91 treesize of output 91 [2022-10-15 17:53:32,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-10-15 17:53:32,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 30 [2022-10-15 17:53:32,430 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:53:32,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 49 [2022-10-15 17:53:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:32,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891004753] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:53:32,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:53:32,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 29 [2022-10-15 17:53:32,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193134867] [2022-10-15 17:53:32,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:53:32,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-15 17:53:32,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:32,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-15 17:53:32,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2022-10-15 17:53:32,459 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:33,115 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-10-15 17:53:33,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-15 17:53:33,116 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 30 states have internal predecessors, (55), 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 23 [2022-10-15 17:53:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:33,117 INFO L225 Difference]: With dead ends: 54 [2022-10-15 17:53:33,117 INFO L226 Difference]: Without dead ends: 47 [2022-10-15 17:53:33,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=184, Invalid=1298, Unknown=0, NotChecked=0, Total=1482 [2022-10-15 17:53:33,119 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 27 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:33,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 245 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 230 Invalid, 0 Unknown, 79 Unchecked, 0.2s Time] [2022-10-15 17:53:33,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-15 17:53:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-10-15 17:53:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 40 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-10-15 17:53:33,122 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 23 [2022-10-15 17:53:33,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:33,122 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-10-15 17:53:33,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.896551724137931) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-10-15 17:53:33,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 17:53:33,123 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:33,123 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:33,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 17:53:33,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-10-15 17:53:33,325 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 17:53:33,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:33,326 INFO L85 PathProgramCache]: Analyzing trace with hash -2077213877, now seen corresponding path program 2 times [2022-10-15 17:53:33,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:33,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233819376] [2022-10-15 17:53:33,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:33,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:34,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:34,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233819376] [2022-10-15 17:53:34,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233819376] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:53:34,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187064565] [2022-10-15 17:53:34,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 17:53:34,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:53:34,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:53:34,156 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) [2022-10-15 17:53:34,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 17:53:34,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 17:53:34,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:53:34,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 45 conjunts are in the unsatisfiable core [2022-10-15 17:53:34,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:53:34,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-15 17:53:34,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-10-15 17:53:34,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-10-15 17:53:35,026 INFO L356 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2022-10-15 17:53:35,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 29 [2022-10-15 17:53:35,161 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:35,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:53:35,729 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncmp_~s1#1.offset_20| Int) (v_ArrVal_213 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetString2~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (= (select .cse0 |v_ULTIMATE.start_cstrncmp_~s1#1.offset_20|) 0) (not (<= 0 |v_ULTIMATE.start_cstrncmp_~s1#1.offset_20|)) (<= (+ |v_ULTIMATE.start_cstrncmp_~s1#1.offset_20| 3) (select |c_#length| |c_ULTIMATE.start_main_~nondetString1~0#1.base|)) (= (select .cse0 (+ |v_ULTIMATE.start_cstrncmp_~s1#1.offset_20| 1)) 0) (< |c_ULTIMATE.start_main_~nondetString1~0#1.offset| |v_ULTIMATE.start_cstrncmp_~s1#1.offset_20|)))) is different from false [2022-10-15 17:53:35,752 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:53:35,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 34 [2022-10-15 17:53:35,773 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:53:35,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 65 [2022-10-15 17:53:35,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2022-10-15 17:53:35,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-10-15 17:53:35,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-15 17:53:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:35,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187064565] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:53:35,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:53:35,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 30 [2022-10-15 17:53:35,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275695975] [2022-10-15 17:53:35,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:53:35,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-10-15 17:53:35,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:35,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-10-15 17:53:35,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=768, Unknown=1, NotChecked=56, Total=930 [2022-10-15 17:53:35,901 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 31 states, 30 states have (on average 2.9) internal successors, (87), 31 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:36,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:36,518 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-10-15 17:53:36,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 17:53:36,519 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.9) internal successors, (87), 31 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-10-15 17:53:36,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:36,519 INFO L225 Difference]: With dead ends: 40 [2022-10-15 17:53:36,519 INFO L226 Difference]: Without dead ends: 40 [2022-10-15 17:53:36,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=204, Invalid=1281, Unknown=1, NotChecked=74, Total=1560 [2022-10-15 17:53:36,521 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 36 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:36,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 304 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 51 Unchecked, 0.0s Time] [2022-10-15 17:53:36,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-10-15 17:53:36,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-10-15 17:53:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-10-15 17:53:36,526 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 32 [2022-10-15 17:53:36,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:36,527 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-10-15 17:53:36,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.9) internal successors, (87), 31 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:36,527 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-10-15 17:53:36,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-15 17:53:36,528 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:36,528 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:36,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-15 17:53:36,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:53:36,742 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 17:53:36,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:36,743 INFO L85 PathProgramCache]: Analyzing trace with hash 30879232, now seen corresponding path program 2 times [2022-10-15 17:53:36,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:36,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635972676] [2022-10-15 17:53:36,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:36,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:37,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:37,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635972676] [2022-10-15 17:53:37,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635972676] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:53:37,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933927637] [2022-10-15 17:53:37,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 17:53:37,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:53:37,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:53:37,415 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:53:37,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-15 17:53:37,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 17:53:37,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:53:37,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 33 conjunts are in the unsatisfiable core [2022-10-15 17:53:37,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:53:37,510 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-10-15 17:53:37,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-10-15 17:53:37,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2022-10-15 17:53:37,871 INFO L356 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-10-15 17:53:37,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 38 [2022-10-15 17:53:38,001 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:38,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:53:39,206 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:53:39,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 91 treesize of output 91 [2022-10-15 17:53:39,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 30 [2022-10-15 17:53:39,260 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 17:53:39,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 49 [2022-10-15 17:53:39,357 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:53:39,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933927637] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:53:39,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:53:39,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 34 [2022-10-15 17:53:39,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558308116] [2022-10-15 17:53:39,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:53:39,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-10-15 17:53:39,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:39,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-10-15 17:53:39,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1054, Unknown=0, NotChecked=0, Total=1190 [2022-10-15 17:53:39,361 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 35 states, 34 states have (on average 2.5) internal successors, (85), 35 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:41,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:41,574 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-10-15 17:53:41,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-10-15 17:53:41,575 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.5) internal successors, (85), 35 states have internal predecessors, (85), 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 33 [2022-10-15 17:53:41,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:41,576 INFO L225 Difference]: With dead ends: 44 [2022-10-15 17:53:41,576 INFO L226 Difference]: Without dead ends: 42 [2022-10-15 17:53:41,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=588, Invalid=2834, Unknown=0, NotChecked=0, Total=3422 [2022-10-15 17:53:41,579 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 229 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:41,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 235 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 393 Invalid, 0 Unknown, 54 Unchecked, 0.3s Time] [2022-10-15 17:53:41,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-10-15 17:53:41,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-10-15 17:53:41,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:41,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-10-15 17:53:41,582 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 33 [2022-10-15 17:53:41,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:41,583 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-10-15 17:53:41,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5) internal successors, (85), 35 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:41,583 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-10-15 17:53:41,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-15 17:53:41,584 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:53:41,584 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:41,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-15 17:53:41,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:53:41,798 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-10-15 17:53:41,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:53:41,799 INFO L85 PathProgramCache]: Analyzing trace with hash 30888283, now seen corresponding path program 1 times [2022-10-15 17:53:41,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:53:41,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038361805] [2022-10-15 17:53:41,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:41,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:53:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:41,936 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 17:53:41,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:53:41,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038361805] [2022-10-15 17:53:41,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038361805] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:53:41,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244110193] [2022-10-15 17:53:41,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:53:41,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:53:41,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:53:41,939 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:53:41,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-15 17:53:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:53:42,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-15 17:53:42,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:53:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 17:53:42,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:53:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 17:53:42,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244110193] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:53:42,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:53:42,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-10-15 17:53:42,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757132030] [2022-10-15 17:53:42,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:53:42,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 17:53:42,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:53:42,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 17:53:42,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-10-15 17:53:42,125 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:42,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:53:42,170 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-10-15 17:53:42,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 17:53:42,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-10-15 17:53:42,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:53:42,171 INFO L225 Difference]: With dead ends: 31 [2022-10-15 17:53:42,171 INFO L226 Difference]: Without dead ends: 0 [2022-10-15 17:53:42,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-10-15 17:53:42,173 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:53:42,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 51 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:53:42,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-15 17:53:42,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-15 17:53:42,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:42,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-15 17:53:42,175 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2022-10-15 17:53:42,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:53:42,175 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-15 17:53:42,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 17:53:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-15 17:53:42,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-15 17:53:42,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2022-10-15 17:53:42,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2022-10-15 17:53:42,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2022-10-15 17:53:42,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2022-10-15 17:53:42,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2022-10-15 17:53:42,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2022-10-15 17:53:42,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2022-10-15 17:53:42,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2022-10-15 17:53:42,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2022-10-15 17:53:42,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2022-10-15 17:53:42,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2022-10-15 17:53:42,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2022-10-15 17:53:42,183 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2022-10-15 17:53:42,183 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2022-10-15 17:53:42,183 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (6 of 21 remaining) [2022-10-15 17:53:42,183 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2022-10-15 17:53:42,183 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2022-10-15 17:53:42,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2022-10-15 17:53:42,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2022-10-15 17:53:42,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (1 of 21 remaining) [2022-10-15 17:53:42,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2022-10-15 17:53:42,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-15 17:53:42,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:53:42,404 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:53:42,409 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:53:42,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:53:42 BoogieIcfgContainer [2022-10-15 17:53:42,413 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:53:42,414 INFO L158 Benchmark]: Toolchain (without parser) took 19819.88ms. Allocated memory was 151.0MB in the beginning and 314.6MB in the end (delta: 163.6MB). Free memory was 123.7MB in the beginning and 211.8MB in the end (delta: -88.0MB). Peak memory consumption was 75.8MB. Max. memory is 8.0GB. [2022-10-15 17:53:42,421 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 151.0MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:53:42,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 596.28ms. Allocated memory is still 151.0MB. Free memory was 123.5MB in the beginning and 106.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-10-15 17:53:42,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.05ms. Allocated memory is still 151.0MB. Free memory was 106.3MB in the beginning and 104.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:53:42,422 INFO L158 Benchmark]: Boogie Preprocessor took 32.91ms. Allocated memory is still 151.0MB. Free memory was 104.1MB in the beginning and 102.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 17:53:42,423 INFO L158 Benchmark]: RCFGBuilder took 733.15ms. Allocated memory is still 151.0MB. Free memory was 102.8MB in the beginning and 123.8MB in the end (delta: -21.1MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-10-15 17:53:42,424 INFO L158 Benchmark]: TraceAbstraction took 18385.02ms. Allocated memory was 151.0MB in the beginning and 314.6MB in the end (delta: 163.6MB). Free memory was 123.3MB in the beginning and 211.8MB in the end (delta: -88.5MB). Peak memory consumption was 75.1MB. Max. memory is 8.0GB. [2022-10-15 17:53:42,426 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 151.0MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 596.28ms. Allocated memory is still 151.0MB. Free memory was 123.5MB in the beginning and 106.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.05ms. Allocated memory is still 151.0MB. Free memory was 106.3MB in the beginning and 104.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.91ms. Allocated memory is still 151.0MB. Free memory was 104.1MB in the beginning and 102.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 733.15ms. Allocated memory is still 151.0MB. Free memory was 102.8MB in the beginning and 123.8MB in the end (delta: -21.1MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * TraceAbstraction took 18385.02ms. Allocated memory was 151.0MB in the beginning and 314.6MB in the end (delta: 163.6MB). Free memory was 123.3MB in the beginning and 211.8MB in the end (delta: -88.5MB). Peak memory consumption was 75.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 393]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 393]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 393]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 394]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 394]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 394]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 379]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 18.3s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1361 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1361 mSDsluCounter, 2099 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 261 IncrementalHoareTripleChecker+Unchecked, 1460 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1278 IncrementalHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 639 mSDtfsCounter, 1278 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 481 GetRequests, 238 SyntacticMatches, 15 SemanticMatches, 228 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 64 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 525 NumberOfCodeBlocks, 525 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 636 ConstructedInterpolants, 69 QuantifiedInterpolants, 7837 SizeOfPredicates, 80 NumberOfNonLiveVariables, 873 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 32 InterpolantComputations, 16 PerfectInterpolantSequences, 72/185 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-10-15 17:53:42,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...