/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/ldv-regression/test24-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:57:52,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:57:52,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:57:52,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:57:52,781 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:57:52,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:57:52,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:57:52,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:57:52,790 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:57:52,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:57:52,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:57:52,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:57:52,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:57:52,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:57:52,799 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:57:52,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:57:52,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:57:52,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:57:52,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:57:52,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:57:52,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:57:52,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:57:52,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:57:52,835 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:57:52,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:57:52,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:57:52,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:57:52,843 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:57:52,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:57:52,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:57:52,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:57:52,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:57:52,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:57:52,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:57:52,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:57:52,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:57:52,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:57:52,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:57:52,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:57:52,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:57:52,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:57:52,857 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 16:57:52,898 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:57:52,898 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:57:52,899 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:57:52,900 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:57:52,901 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:57:52,901 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:57:52,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:57:52,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:57:52,903 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:57:52,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:57:52,904 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:57:52,904 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:57:52,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:57:52,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:57:52,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:57:52,905 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:57:52,906 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:57:52,906 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:57:52,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:57:52,907 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:57:52,907 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:57:52,907 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:57:52,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:57:52,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:57:52,909 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:57:52,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:57:52,910 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:57:52,910 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:57:52,910 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:57:52,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:57:52,911 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 16:57:53,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:57:53,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:57:53,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:57:53,402 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:57:53,403 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:57:53,405 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test24-2.c [2022-10-15 16:57:53,504 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f10d831/948a4912dea746e6b4ae1403a60b1759/FLAGff304972b [2022-10-15 16:57:54,220 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:57:54,221 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test24-2.c [2022-10-15 16:57:54,231 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f10d831/948a4912dea746e6b4ae1403a60b1759/FLAGff304972b [2022-10-15 16:57:54,579 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f10d831/948a4912dea746e6b4ae1403a60b1759 [2022-10-15 16:57:54,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:57:54,593 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:57:54,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:57:54,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:57:54,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:57:54,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:57:54" (1/1) ... [2022-10-15 16:57:54,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13242a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:54, skipping insertion in model container [2022-10-15 16:57:54,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:57:54" (1/1) ... [2022-10-15 16:57:54,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:57:54,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:57:55,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test24-2.c[807,820] [2022-10-15 16:57:55,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:57:55,092 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:57:55,139 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test24-2.c[807,820] [2022-10-15 16:57:55,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:57:55,177 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:57:55,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:55 WrapperNode [2022-10-15 16:57:55,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:57:55,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:57:55,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:57:55,184 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:57:55,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:55" (1/1) ... [2022-10-15 16:57:55,230 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:55" (1/1) ... [2022-10-15 16:57:55,282 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2022-10-15 16:57:55,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:57:55,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:57:55,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:57:55,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:57:55,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:55" (1/1) ... [2022-10-15 16:57:55,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:55" (1/1) ... [2022-10-15 16:57:55,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:55" (1/1) ... [2022-10-15 16:57:55,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:55" (1/1) ... [2022-10-15 16:57:55,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:55" (1/1) ... [2022-10-15 16:57:55,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:55" (1/1) ... [2022-10-15 16:57:55,347 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:55" (1/1) ... [2022-10-15 16:57:55,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:55" (1/1) ... [2022-10-15 16:57:55,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:57:55,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:57:55,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:57:55,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:57:55,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:55" (1/1) ... [2022-10-15 16:57:55,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:57:55,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:55,418 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 16:57:55,443 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 16:57:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:57:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:57:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:57:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:57:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:57:55,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:57:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:57:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:57:55,636 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:57:55,640 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:57:56,022 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:57:56,064 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:57:56,065 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 16:57:56,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:57:56 BoogieIcfgContainer [2022-10-15 16:57:56,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:57:56,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:57:56,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:57:56,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:57:56,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:57:54" (1/3) ... [2022-10-15 16:57:56,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a992e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:57:56, skipping insertion in model container [2022-10-15 16:57:56,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:55" (2/3) ... [2022-10-15 16:57:56,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a992e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:57:56, skipping insertion in model container [2022-10-15 16:57:56,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:57:56" (3/3) ... [2022-10-15 16:57:56,104 INFO L112 eAbstractionObserver]: Analyzing ICFG test24-2.c [2022-10-15 16:57:56,169 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:57:56,169 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-10-15 16:57:56,267 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:57:56,280 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;@69070d85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:57:56,281 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-10-15 16:57:56,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.8) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:57:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:57:56,309 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:56,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:57:56,314 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:57:56,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:56,336 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-10-15 16:57:56,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:56,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857657790] [2022-10-15 16:57:56,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:56,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:56,775 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 16:57:56,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:56,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857657790] [2022-10-15 16:57:56,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857657790] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:56,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:56,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:57:56,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016645665] [2022-10-15 16:57:56,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:56,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:57:56,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:56,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:57:56,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:57:56,851 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.8) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:57:56,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:56,952 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-10-15 16:57:56,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:57:56,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:57:56,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:56,966 INFO L225 Difference]: With dead ends: 37 [2022-10-15 16:57:56,966 INFO L226 Difference]: Without dead ends: 35 [2022-10-15 16:57:56,969 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 16:57:56,981 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 32 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 24 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.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:56,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 24 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:57:57,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-10-15 16:57:57,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-10-15 16:57:57,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 34 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 16:57:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-10-15 16:57:57,031 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 4 [2022-10-15 16:57:57,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:57,032 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-10-15 16:57:57,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:57:57,032 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-10-15 16:57:57,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:57:57,033 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:57,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:57:57,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:57:57,037 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:57:57,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:57,041 INFO L85 PathProgramCache]: Analyzing trace with hash 925766, now seen corresponding path program 1 times [2022-10-15 16:57:57,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:57,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005574288] [2022-10-15 16:57:57,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:57,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:57,353 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 16:57:57,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:57,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005574288] [2022-10-15 16:57:57,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005574288] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:57,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:57,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:57:57,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093199407] [2022-10-15 16:57:57,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:57,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:57:57,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:57,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:57:57,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:57:57,361 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:57:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:57,441 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-10-15 16:57:57,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:57:57,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:57:57,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:57,443 INFO L225 Difference]: With dead ends: 41 [2022-10-15 16:57:57,443 INFO L226 Difference]: Without dead ends: 41 [2022-10-15 16:57:57,444 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 16:57:57,446 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:57,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 49 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:57:57,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-10-15 16:57:57,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-10-15 16:57:57,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 38 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 16:57:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-10-15 16:57:57,455 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 4 [2022-10-15 16:57:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:57,456 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-10-15 16:57:57,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:57:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-10-15 16:57:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 16:57:57,457 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:57,457 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:57,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:57:57,458 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:57:57,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:57,459 INFO L85 PathProgramCache]: Analyzing trace with hash 719163786, now seen corresponding path program 1 times [2022-10-15 16:57:57,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:57,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866897517] [2022-10-15 16:57:57,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:57,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:57,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:57:57,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:57,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866897517] [2022-10-15 16:57:57,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866897517] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:57,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900794671] [2022-10-15 16:57:57,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:57,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:57,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:57,731 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 16:57:57,739 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 16:57:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:57,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-15 16:57:57,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:57:57,924 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:57:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:57:58,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:57:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:57:58,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900794671] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:57:58,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:57:58,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-10-15 16:57:58,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307673039] [2022-10-15 16:57:58,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:57:58,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:57:58,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:58,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:57:58,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:57:58,261 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 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 16:57:58,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:58,541 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2022-10-15 16:57:58,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:57:58,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 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 10 [2022-10-15 16:57:58,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:58,547 INFO L225 Difference]: With dead ends: 101 [2022-10-15 16:57:58,547 INFO L226 Difference]: Without dead ends: 101 [2022-10-15 16:57:58,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:57:58,560 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 96 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:58,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 96 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:57:58,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-10-15 16:57:58,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 55. [2022-10-15 16:57:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 54 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 16:57:58,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2022-10-15 16:57:58,581 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 10 [2022-10-15 16:57:58,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:58,582 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2022-10-15 16:57:58,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 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 16:57:58,583 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2022-10-15 16:57:58,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 16:57:58,584 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:58,584 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:58,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-15 16:57:58,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:58,799 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:57:58,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:58,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1824163902, now seen corresponding path program 1 times [2022-10-15 16:57:58,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:58,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412606627] [2022-10-15 16:57:58,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:58,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:59,120 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-15 16:57:59,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:59,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412606627] [2022-10-15 16:57:59,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412606627] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:59,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:59,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:57:59,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307938641] [2022-10-15 16:57:59,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:59,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:57:59,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:59,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:57:59,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:57:59,130 INFO L87 Difference]: Start difference. First operand 55 states and 59 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 16:57:59,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:59,209 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-10-15 16:57:59,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:57:59,210 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 18 [2022-10-15 16:57:59,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:59,212 INFO L225 Difference]: With dead ends: 54 [2022-10-15 16:57:59,212 INFO L226 Difference]: Without dead ends: 54 [2022-10-15 16:57:59,213 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 16:57:59,217 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 24 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:59,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 35 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:57:59,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-15 16:57:59,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-10-15 16:57:59,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:57:59,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-10-15 16:57:59,225 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 18 [2022-10-15 16:57:59,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:59,226 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-10-15 16:57:59,226 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 16:57:59,227 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-10-15 16:57:59,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 16:57:59,227 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:59,228 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:59,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:57:59,228 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:57:59,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:59,229 INFO L85 PathProgramCache]: Analyzing trace with hash 714542858, now seen corresponding path program 1 times [2022-10-15 16:57:59,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:59,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712216588] [2022-10-15 16:57:59,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:59,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:57:59,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:59,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712216588] [2022-10-15 16:57:59,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712216588] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:59,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487008078] [2022-10-15 16:57:59,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:59,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:59,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:59,372 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 16:57:59,389 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 16:57:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:59,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 16:57:59,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:57:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:57:59,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:57:59,612 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:57:59,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487008078] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:57:59,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:57:59,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-10-15 16:57:59,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282246851] [2022-10-15 16:57:59,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:57:59,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 16:57:59,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:59,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 16:57:59,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:57:59,617 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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 16:57:59,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:59,694 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2022-10-15 16:57:59,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:57:59,695 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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) Word has length 19 [2022-10-15 16:57:59,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:59,697 INFO L225 Difference]: With dead ends: 68 [2022-10-15 16:57:59,697 INFO L226 Difference]: Without dead ends: 68 [2022-10-15 16:57:59,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:57:59,699 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 35 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:59,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 144 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:57:59,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-10-15 16:57:59,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2022-10-15 16:57:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:57:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-10-15 16:57:59,708 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 19 [2022-10-15 16:57:59,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:59,709 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-10-15 16:57:59,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 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 16:57:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-10-15 16:57:59,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-15 16:57:59,710 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:59,711 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1] [2022-10-15 16:57:59,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 16:57:59,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:59,925 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:57:59,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:59,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1183242029, now seen corresponding path program 1 times [2022-10-15 16:57:59,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:59,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059633220] [2022-10-15 16:57:59,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:59,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-10-15 16:58:00,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:00,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059633220] [2022-10-15 16:58:00,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059633220] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:58:00,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239925343] [2022-10-15 16:58:00,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:00,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:00,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:00,221 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 16:58:00,227 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 16:58:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:00,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-15 16:58:00,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:58:00,351 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:58:00,630 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:00,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:58:00,957 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:00,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239925343] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:58:00,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:58:00,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2022-10-15 16:58:00,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7770409] [2022-10-15 16:58:00,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:58:00,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-10-15 16:58:00,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:00,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-10-15 16:58:00,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-10-15 16:58:00,963 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:58:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:01,440 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-10-15 16:58:01,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-15 16:58:01,441 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-10-15 16:58:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:01,447 INFO L225 Difference]: With dead ends: 121 [2022-10-15 16:58:01,447 INFO L226 Difference]: Without dead ends: 121 [2022-10-15 16:58:01,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=391, Unknown=0, NotChecked=0, Total=600 [2022-10-15 16:58:01,452 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 256 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:01,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 101 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:58:01,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-10-15 16:58:01,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 77. [2022-10-15 16:58:01,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 76 states have internal predecessors, (81), 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 16:58:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2022-10-15 16:58:01,462 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 24 [2022-10-15 16:58:01,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:01,463 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2022-10-15 16:58:01,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:58:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-10-15 16:58:01,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-10-15 16:58:01,465 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:01,465 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:01,500 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 16:58:01,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:01,681 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:58:01,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:01,683 INFO L85 PathProgramCache]: Analyzing trace with hash -373827078, now seen corresponding path program 2 times [2022-10-15 16:58:01,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:01,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83701839] [2022-10-15 16:58:01,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:01,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:01,905 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:01,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:01,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83701839] [2022-10-15 16:58:01,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83701839] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:58:01,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677945003] [2022-10-15 16:58:01,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:58:01,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:01,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:01,908 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 16:58:01,930 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 16:58:01,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-15 16:58:01,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:58:01,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-15 16:58:01,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:58:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-10-15 16:58:02,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 16:58:02,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677945003] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:02,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 16:58:02,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2022-10-15 16:58:02,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091001525] [2022-10-15 16:58:02,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:02,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:58:02,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:02,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:58:02,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:58:02,466 INFO L87 Difference]: Start difference. First operand 77 states and 81 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 16:58:02,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:02,471 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2022-10-15 16:58:02,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:58:02,475 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 43 [2022-10-15 16:58:02,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:02,476 INFO L225 Difference]: With dead ends: 79 [2022-10-15 16:58:02,477 INFO L226 Difference]: Without dead ends: 77 [2022-10-15 16:58:02,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:58:02,480 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:02,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2022-10-15 16:58:02,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-10-15 16:58:02,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-10-15 16:58:02,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 68 states have (on average 1.1764705882352942) internal successors, (80), 76 states have internal predecessors, (80), 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 16:58:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2022-10-15 16:58:02,498 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 43 [2022-10-15 16:58:02,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:02,499 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2022-10-15 16:58:02,499 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 16:58:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2022-10-15 16:58:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-15 16:58:02,504 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:02,504 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:02,552 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 16:58:02,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:02,723 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:58:02,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:02,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1295122478, now seen corresponding path program 1 times [2022-10-15 16:58:02,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:02,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150174055] [2022-10-15 16:58:02,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:02,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-10-15 16:58:02,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:02,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150174055] [2022-10-15 16:58:02,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150174055] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:02,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:02,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:58:02,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333375500] [2022-10-15 16:58:02,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:02,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:58:02,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:02,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:58:02,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:58:02,866 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 16:58:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:02,898 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-10-15 16:58:02,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:58:02,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 44 [2022-10-15 16:58:02,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:02,900 INFO L225 Difference]: With dead ends: 76 [2022-10-15 16:58:02,900 INFO L226 Difference]: Without dead ends: 76 [2022-10-15 16:58:02,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:58:02,901 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:02,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 31 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:58:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-10-15 16:58:02,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-10-15 16:58:02,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 68 states have (on average 1.161764705882353) internal successors, (79), 75 states have internal predecessors, (79), 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 16:58:02,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-10-15 16:58:02,909 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 44 [2022-10-15 16:58:02,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:02,909 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-10-15 16:58:02,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 16:58:02,910 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-10-15 16:58:02,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-10-15 16:58:02,911 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:02,912 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:02,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:58:02,912 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:58:02,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:02,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1295122479, now seen corresponding path program 1 times [2022-10-15 16:58:02,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:02,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627802346] [2022-10-15 16:58:02,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:02,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:03,113 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:03,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:03,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627802346] [2022-10-15 16:58:03,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627802346] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:58:03,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877214525] [2022-10-15 16:58:03,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:03,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:03,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:03,116 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 16:58:03,138 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 16:58:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:03,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-15 16:58:03,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:58:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:03,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:58:03,428 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:03,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877214525] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:58:03,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:58:03,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-10-15 16:58:03,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188641823] [2022-10-15 16:58:03,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:58:03,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-15 16:58:03,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:03,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-15 16:58:03,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2022-10-15 16:58:03,433 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 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 16:58:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:03,548 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2022-10-15 16:58:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-15 16:58:03,549 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 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 44 [2022-10-15 16:58:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:03,551 INFO L225 Difference]: With dead ends: 116 [2022-10-15 16:58:03,551 INFO L226 Difference]: Without dead ends: 116 [2022-10-15 16:58:03,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2022-10-15 16:58:03,553 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 78 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:03,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 200 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:03,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-10-15 16:58:03,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2022-10-15 16:58:03,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 110 states have internal predecessors, (117), 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 16:58:03,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2022-10-15 16:58:03,562 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 44 [2022-10-15 16:58:03,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:03,563 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2022-10-15 16:58:03,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 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 16:58:03,564 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2022-10-15 16:58:03,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-10-15 16:58:03,565 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:03,565 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 1, 1, 1] [2022-10-15 16:58:03,617 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 16:58:03,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:03,780 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:58:03,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:03,782 INFO L85 PathProgramCache]: Analyzing trace with hash -785688986, now seen corresponding path program 2 times [2022-10-15 16:58:03,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:03,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471882811] [2022-10-15 16:58:03,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:03,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:04,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:04,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471882811] [2022-10-15 16:58:04,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471882811] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:58:04,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221509350] [2022-10-15 16:58:04,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:58:04,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:04,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:04,425 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 16:58:04,447 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 16:58:04,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 16:58:04,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:58:04,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 15 conjunts are in the unsatisfiable core [2022-10-15 16:58:04,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:58:04,561 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:58:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:05,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 16:58:05,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221509350] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:05,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 16:58:05,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 20 [2022-10-15 16:58:05,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829870737] [2022-10-15 16:58:05,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:05,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 16:58:05,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:05,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 16:58:05,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2022-10-15 16:58:05,120 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:58:05,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:05,246 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-10-15 16:58:05,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 16:58:05,247 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-10-15 16:58:05,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:05,248 INFO L225 Difference]: With dead ends: 110 [2022-10-15 16:58:05,248 INFO L226 Difference]: Without dead ends: 110 [2022-10-15 16:58:05,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2022-10-15 16:58:05,250 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 75 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:05,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 75 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:05,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-10-15 16:58:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-10-15 16:58:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 103 states have (on average 1.0776699029126213) internal successors, (111), 109 states have internal predecessors, (111), 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 16:58:05,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2022-10-15 16:58:05,258 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 52 [2022-10-15 16:58:05,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:05,258 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2022-10-15 16:58:05,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:58:05,259 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-10-15 16:58:05,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-10-15 16:58:05,260 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:05,261 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:05,311 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 16:58:05,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:05,475 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:58:05,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:05,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1516672591, now seen corresponding path program 2 times [2022-10-15 16:58:05,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:05,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905671388] [2022-10-15 16:58:05,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:05,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:06,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:06,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905671388] [2022-10-15 16:58:06,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905671388] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:58:06,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197348277] [2022-10-15 16:58:06,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:58:06,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:06,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:06,199 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:58:06,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-15 16:58:06,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-10-15 16:58:06,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:58:06,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-15 16:58:06,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:58:06,314 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 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:58:06,730 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2022-10-15 16:58:06,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 16:58:06,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197348277] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:06,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 16:58:06,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [17] total 19 [2022-10-15 16:58:06,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31178998] [2022-10-15 16:58:06,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:06,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:58:06,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:06,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:58:06,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2022-10-15 16:58:06,735 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 16:58:06,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:06,790 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2022-10-15 16:58:06,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:58:06,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 92 [2022-10-15 16:58:06,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:06,793 INFO L225 Difference]: With dead ends: 109 [2022-10-15 16:58:06,793 INFO L226 Difference]: Without dead ends: 109 [2022-10-15 16:58:06,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2022-10-15 16:58:06,795 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:06,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 33 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:58:06,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-10-15 16:58:06,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-10-15 16:58:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 103 states have (on average 1.0679611650485437) internal successors, (110), 108 states have internal predecessors, (110), 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 16:58:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2022-10-15 16:58:06,802 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 92 [2022-10-15 16:58:06,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:06,803 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2022-10-15 16:58:06,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 16:58:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-10-15 16:58:06,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-10-15 16:58:06,805 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:06,806 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:06,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-15 16:58:07,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:07,021 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:58:07,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:07,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1528445811, now seen corresponding path program 1 times [2022-10-15 16:58:07,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:07,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955006251] [2022-10-15 16:58:07,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:07,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2022-10-15 16:58:07,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:07,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955006251] [2022-10-15 16:58:07,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955006251] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:07,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:07,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:58:07,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079979865] [2022-10-15 16:58:07,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:07,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:58:07,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:07,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:58:07,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:58:07,254 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 16:58:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:07,296 INFO L93 Difference]: Finished difference Result 108 states and 109 transitions. [2022-10-15 16:58:07,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:58:07,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 94 [2022-10-15 16:58:07,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:07,298 INFO L225 Difference]: With dead ends: 108 [2022-10-15 16:58:07,299 INFO L226 Difference]: Without dead ends: 108 [2022-10-15 16:58:07,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:58:07,300 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 45 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:07,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 45 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:58:07,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-10-15 16:58:07,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-10-15 16:58:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 103 states have (on average 1.058252427184466) internal successors, (109), 107 states have internal predecessors, (109), 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 16:58:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2022-10-15 16:58:07,306 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 94 [2022-10-15 16:58:07,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:07,307 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2022-10-15 16:58:07,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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 16:58:07,307 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2022-10-15 16:58:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-10-15 16:58:07,309 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:07,309 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:07,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-15 16:58:07,309 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:58:07,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:07,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1528445812, now seen corresponding path program 1 times [2022-10-15 16:58:07,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:07,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84823379] [2022-10-15 16:58:07,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:07,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:08,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:08,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84823379] [2022-10-15 16:58:08,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84823379] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:58:08,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521173575] [2022-10-15 16:58:08,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:08,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:08,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:08,081 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:58:08,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-15 16:58:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:08,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-15 16:58:08,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:58:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:08,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:58:08,772 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 0 proven. 560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:58:08,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521173575] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:58:08,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:58:08,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-10-15 16:58:08,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062980319] [2022-10-15 16:58:08,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:58:08,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-15 16:58:08,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:08,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-15 16:58:08,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-10-15 16:58:08,777 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand has 23 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 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 16:58:08,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:08,945 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2022-10-15 16:58:08,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-10-15 16:58:08,946 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 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 94 [2022-10-15 16:58:08,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:08,948 INFO L225 Difference]: With dead ends: 144 [2022-10-15 16:58:08,948 INFO L226 Difference]: Without dead ends: 144 [2022-10-15 16:58:08,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 172 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-10-15 16:58:08,950 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 100 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:08,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 152 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:08,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-10-15 16:58:08,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-10-15 16:58:08,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.0431654676258992) internal successors, (145), 143 states have internal predecessors, (145), 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 16:58:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2022-10-15 16:58:08,958 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 94 [2022-10-15 16:58:08,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:08,959 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2022-10-15 16:58:08,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.782608695652174) internal successors, (133), 23 states have internal predecessors, (133), 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 16:58:08,959 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2022-10-15 16:58:08,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-10-15 16:58:08,961 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:08,961 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:09,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-15 16:58:09,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-10-15 16:58:09,178 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:58:09,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:09,179 INFO L85 PathProgramCache]: Analyzing trace with hash 378628108, now seen corresponding path program 2 times [2022-10-15 16:58:09,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:09,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437191769] [2022-10-15 16:58:09,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:09,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2022-10-15 16:58:10,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:10,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437191769] [2022-10-15 16:58:10,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437191769] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:10,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:10,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:58:10,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348703137] [2022-10-15 16:58:10,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:10,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-15 16:58:10,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:10,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-15 16:58:10,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-10-15 16:58:10,432 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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 16:58:10,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:10,569 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2022-10-15 16:58:10,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:58:10,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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 130 [2022-10-15 16:58:10,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:10,573 INFO L225 Difference]: With dead ends: 143 [2022-10-15 16:58:10,573 INFO L226 Difference]: Without dead ends: 143 [2022-10-15 16:58:10,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:58:10,575 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:10,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 49 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:10,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-10-15 16:58:10,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-10-15 16:58:10,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 142 states have internal predecessors, (144), 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 16:58:10,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2022-10-15 16:58:10,583 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 130 [2022-10-15 16:58:10,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:10,583 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2022-10-15 16:58:10,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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 16:58:10,584 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2022-10-15 16:58:10,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-10-15 16:58:10,586 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:10,586 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:10,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-15 16:58:10,587 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:58:10,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:10,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1125831429, now seen corresponding path program 1 times [2022-10-15 16:58:10,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:10,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667044667] [2022-10-15 16:58:10,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:10,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2022-10-15 16:58:11,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:11,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667044667] [2022-10-15 16:58:11,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667044667] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:11,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:11,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:58:11,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365018672] [2022-10-15 16:58:11,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:11,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:58:11,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:11,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:58:11,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:58:11,034 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 16:58:11,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:11,079 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2022-10-15 16:58:11,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:58:11,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 133 [2022-10-15 16:58:11,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:11,082 INFO L225 Difference]: With dead ends: 142 [2022-10-15 16:58:11,082 INFO L226 Difference]: Without dead ends: 142 [2022-10-15 16:58:11,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:58:11,083 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 40 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:11,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 34 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:58:11,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-10-15 16:58:11,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-10-15 16:58:11,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 139 states have (on average 1.0287769784172662) internal successors, (143), 141 states have internal predecessors, (143), 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 16:58:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2022-10-15 16:58:11,090 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 133 [2022-10-15 16:58:11,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:11,091 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2022-10-15 16:58:11,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 16:58:11,092 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2022-10-15 16:58:11,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-10-15 16:58:11,093 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:11,094 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:11,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-15 16:58:11,094 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:58:11,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:11,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1125831430, now seen corresponding path program 1 times [2022-10-15 16:58:11,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:11,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497233686] [2022-10-15 16:58:11,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:11,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:13,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2022-10-15 16:58:13,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:13,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497233686] [2022-10-15 16:58:13,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497233686] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:13,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:58:13,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 16:58:13,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033317391] [2022-10-15 16:58:13,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:13,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-15 16:58:13,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:13,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-15 16:58:13,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:58:13,289 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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 16:58:13,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:13,539 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2022-10-15 16:58:13,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 16:58:13,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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 133 [2022-10-15 16:58:13,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:13,542 INFO L225 Difference]: With dead ends: 154 [2022-10-15 16:58:13,542 INFO L226 Difference]: Without dead ends: 154 [2022-10-15 16:58:13,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-10-15 16:58:13,543 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 43 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:13,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 77 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:58:13,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-10-15 16:58:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2022-10-15 16:58:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 143 states have (on average 1.034965034965035) internal successors, (148), 145 states have internal predecessors, (148), 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 16:58:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2022-10-15 16:58:13,549 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 133 [2022-10-15 16:58:13,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:13,550 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2022-10-15 16:58:13,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 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 16:58:13,550 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2022-10-15 16:58:13,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-10-15 16:58:13,552 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:13,553 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:13,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-15 16:58:13,553 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:58:13,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:13,554 INFO L85 PathProgramCache]: Analyzing trace with hash -406242035, now seen corresponding path program 1 times [2022-10-15 16:58:13,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:13,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53136141] [2022-10-15 16:58:13,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:13,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2022-10-15 16:58:15,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:58:15,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53136141] [2022-10-15 16:58:15,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53136141] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:58:15,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979862099] [2022-10-15 16:58:15,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:15,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:58:15,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:58:15,695 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:58:15,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-15 16:58:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:58:15,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-15 16:58:15,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:58:16,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-10-15 16:58:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2022-10-15 16:58:16,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 16:58:16,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979862099] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:58:16,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 16:58:16,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2022-10-15 16:58:16,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456513522] [2022-10-15 16:58:16,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:58:16,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:58:16,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:58:16,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:58:16,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-10-15 16:58:16,118 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 16:58:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:58:16,218 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2022-10-15 16:58:16,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:58:16,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 135 [2022-10-15 16:58:16,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:58:16,221 INFO L225 Difference]: With dead ends: 141 [2022-10-15 16:58:16,221 INFO L226 Difference]: Without dead ends: 141 [2022-10-15 16:58:16,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-10-15 16:58:16,222 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:58:16,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 71 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:58:16,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-10-15 16:58:16,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-10-15 16:58:16,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 139 states have (on average 1.014388489208633) internal successors, (141), 140 states have internal predecessors, (141), 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 16:58:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2022-10-15 16:58:16,229 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2022-10-15 16:58:16,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:58:16,229 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2022-10-15 16:58:16,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 16:58:16,230 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2022-10-15 16:58:16,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-10-15 16:58:16,232 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:58:16,232 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:16,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-15 16:58:16,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-15 16:58:16,447 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-15 16:58:16,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:58:16,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1010069778, now seen corresponding path program 1 times [2022-10-15 16:58:16,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:58:16,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736472252] [2022-10-15 16:58:16,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:58:16,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:58:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:58:16,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:58:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:58:16,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:58:16,827 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:58:16,828 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (13 of 14 remaining) [2022-10-15 16:58:16,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2022-10-15 16:58:16,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2022-10-15 16:58:16,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2022-10-15 16:58:16,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2022-10-15 16:58:16,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2022-10-15 16:58:16,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2022-10-15 16:58:16,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2022-10-15 16:58:16,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2022-10-15 16:58:16,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2022-10-15 16:58:16,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2022-10-15 16:58:16,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2022-10-15 16:58:16,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2022-10-15 16:58:16,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2022-10-15 16:58:16,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-10-15 16:58:16,840 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:58:16,845 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:58:16,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:58:16 BoogieIcfgContainer [2022-10-15 16:58:16,937 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:58:16,938 INFO L158 Benchmark]: Toolchain (without parser) took 22349.94ms. Allocated memory was 166.7MB in the beginning and 293.6MB in the end (delta: 126.9MB). Free memory was 140.5MB in the beginning and 136.6MB in the end (delta: 3.9MB). Peak memory consumption was 132.2MB. Max. memory is 8.0GB. [2022-10-15 16:58:16,939 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 166.7MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:58:16,939 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.73ms. Allocated memory is still 166.7MB. Free memory was 140.3MB in the beginning and 130.2MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-15 16:58:16,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.88ms. Allocated memory is still 166.7MB. Free memory was 130.2MB in the beginning and 128.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 16:58:16,943 INFO L158 Benchmark]: Boogie Preprocessor took 73.80ms. Allocated memory is still 166.7MB. Free memory was 128.7MB in the beginning and 127.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:58:16,943 INFO L158 Benchmark]: RCFGBuilder took 710.70ms. Allocated memory is still 166.7MB. Free memory was 127.3MB in the beginning and 147.4MB in the end (delta: -20.1MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. [2022-10-15 16:58:16,944 INFO L158 Benchmark]: TraceAbstraction took 20859.31ms. Allocated memory was 166.7MB in the beginning and 293.6MB in the end (delta: 126.9MB). Free memory was 146.3MB in the beginning and 136.6MB in the end (delta: 9.8MB). Peak memory consumption was 138.2MB. Max. memory is 8.0GB. [2022-10-15 16:58:16,950 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.39ms. Allocated memory is still 166.7MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 586.73ms. Allocated memory is still 166.7MB. Free memory was 140.3MB in the beginning and 130.2MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 99.88ms. Allocated memory is still 166.7MB. Free memory was 130.2MB in the beginning and 128.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 73.80ms. Allocated memory is still 166.7MB. Free memory was 128.7MB in the beginning and 127.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 710.70ms. Allocated memory is still 166.7MB. Free memory was 127.3MB in the beginning and 147.4MB in the end (delta: -20.1MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. * TraceAbstraction took 20859.31ms. Allocated memory was 166.7MB in the beginning and 293.6MB in the end (delta: 126.9MB). Free memory was 146.3MB in the beginning and 136.6MB in the end (delta: 9.8MB). Peak memory consumption was 138.2MB. 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 - UnprovableResult [Line: 39]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 39. Possible FailurePath: [L17] struct dummy ad1[20], *ad2; [L18] int i, j, *pa; [L19] j=0 VAL [ad1={5:0}, j=0] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-1, ad1={5:0}, j=0] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-2, ad1={5:0}, j=0] [L19] j++ VAL [ad1={5:0}, j=1] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-3, ad1={5:0}, j=1] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-4, ad1={5:0}, j=1] [L19] j++ VAL [ad1={5:0}, j=2] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-5, ad1={5:0}, j=2] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=6, ad1={5:0}, j=2] [L19] j++ VAL [ad1={5:0}, j=3] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-6, ad1={5:0}, j=3] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=7, ad1={5:0}, j=3] [L19] j++ VAL [ad1={5:0}, j=4] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-7, ad1={5:0}, j=4] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-8, ad1={5:0}, j=4] [L19] j++ VAL [ad1={5:0}, j=5] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=9, ad1={5:0}, j=5] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-9, ad1={5:0}, j=5] [L19] j++ VAL [ad1={5:0}, j=6] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=27, ad1={5:0}, j=6] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-11, ad1={5:0}, j=6] [L19] j++ VAL [ad1={5:0}, j=7] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-12, ad1={5:0}, j=7] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=13, ad1={5:0}, j=7] [L19] j++ VAL [ad1={5:0}, j=8] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-13, ad1={5:0}, j=8] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=14, ad1={5:0}, j=8] [L19] j++ VAL [ad1={5:0}, j=9] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-14, ad1={5:0}, j=9] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=15, ad1={5:0}, j=9] [L19] j++ VAL [ad1={5:0}, j=10] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-15, ad1={5:0}, j=10] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-16, ad1={5:0}, j=10] [L19] j++ VAL [ad1={5:0}, j=11] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=17, ad1={5:0}, j=11] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-17, ad1={5:0}, j=11] [L19] j++ VAL [ad1={5:0}, j=12] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=18, ad1={5:0}, j=12] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-18, ad1={5:0}, j=12] [L19] j++ VAL [ad1={5:0}, j=13] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=19, ad1={5:0}, j=13] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-19, ad1={5:0}, j=13] [L19] j++ VAL [ad1={5:0}, j=14] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-20, ad1={5:0}, j=14] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=21, ad1={5:0}, j=14] [L19] j++ VAL [ad1={5:0}, j=15] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-21, ad1={5:0}, j=15] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=22, ad1={5:0}, j=15] [L19] j++ VAL [ad1={5:0}, j=16] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-22, ad1={5:0}, j=16] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=23, ad1={5:0}, j=16] [L19] j++ VAL [ad1={5:0}, j=17] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-23, ad1={5:0}, j=17] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-24, ad1={5:0}, j=17] [L19] j++ VAL [ad1={5:0}, j=18] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=25, ad1={5:0}, j=18] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-25, ad1={5:0}, j=18] [L19] j++ VAL [ad1={5:0}, j=19] [L19] COND TRUE j<20 [L20] ad1[j].a = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=26, ad1={5:0}, j=19] [L21] ad1[j].b = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-26, ad1={5:0}, j=19] [L19] j++ VAL [ad1={5:0}, j=20] [L19] COND FALSE !(j<20) VAL [ad1={5:0}, j=20] [L23] i = __VERIFIER_nondet_int() [L24] COND TRUE i >= 0 && i < 10 [L25] ad2 = ad1 VAL [ad1={5:0}, ad2={5:0}, i=0, j=20] [L26] ad1[i].a = i VAL [ad1={5:0}, ad2={5:0}, i=0, j=20] [L27] pa = &ad1[i].a VAL [ad1={5:0}, ad2={5:0}, i=0, j=20, pa={5:0}] [L28] EXPR ad2[i].a VAL [ad1={5:0}, ad2={5:0}, ad2[i].a=0, i=0, j=20, pa={5:0}] [L28] i = ad2[i].a + 10 [L29] EXPR \read(*pa) VAL [\read(*pa)=0, ad1={5:0}, ad2={5:0}, i=10, j=20, pa={5:0}] [L29] COND FALSE !(i < *pa) [L32] CALL, EXPR check(ad1, i) [L12] EXPR ad1[b].a VAL [\old(b)=10, ad1={5:0}, ad1={5:0}, ad1[b].a=-15, b=10] [L12] return ad1[b].a == b; [L32] RET, EXPR check(ad1, i) [L32] COND TRUE !check(ad1, i) [L39] reach_error() VAL [ad1={5:0}, ad2={5:0}, i=10, j=20, pa={5:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 15]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 20.6s, OverallIterations: 18, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 939 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 939 mSDsluCounter, 1277 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 26 IncrementalHoareTripleChecker+Unchecked, 891 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 949 IncrementalHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 386 mSDtfsCounter, 949 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 835 GetRequests, 653 SyntacticMatches, 10 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=16, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 108 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 1723 NumberOfCodeBlocks, 1603 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1746 ConstructedInterpolants, 41 QuantifiedInterpolants, 10286 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1842 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 31 InterpolantComputations, 12 PerfectInterpolantSequences, 7327/10236 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 16:58:17,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...