/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/array-crafted/zero_sum_const1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:17:30,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:17:30,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:17:30,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:17:30,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:17:30,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:17:30,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:17:30,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:17:30,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:17:30,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:17:30,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:17:30,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:17:30,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:17:30,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:17:30,248 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:17:30,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:17:30,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:17:30,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:17:30,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:17:30,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:17:30,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:17:30,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:17:30,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:17:30,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:17:30,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:17:30,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:17:30,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:17:30,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:17:30,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:17:30,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:17:30,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:17:30,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:17:30,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:17:30,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:17:30,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:17:30,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:17:30,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:17:30,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:17:30,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:17:30,281 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:17:30,282 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:17:30,283 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:17:30,312 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:17:30,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:17:30,313 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:17:30,313 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:17:30,314 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:17:30,314 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:17:30,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:17:30,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:17:30,316 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:17:30,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:17:30,316 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:17:30,316 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:17:30,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:17:30,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:17:30,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:17:30,317 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:17:30,317 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:17:30,318 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:17:30,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:17:30,318 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:17:30,318 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:17:30,319 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:17:30,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:17:30,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:17:30,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:17:30,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:17:30,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:17:30,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:17:30,320 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:17:30,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:17:30,320 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:17:30,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:17:30,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:17:30,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:17:30,709 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:17:30,710 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:17:30,712 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/zero_sum_const1.c [2022-10-15 16:17:30,801 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031f49fbe/bc71d8cf67694bdda26461a8c6f377cc/FLAG585b5e873 [2022-10-15 16:17:31,362 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:17:31,363 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/zero_sum_const1.c [2022-10-15 16:17:31,371 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031f49fbe/bc71d8cf67694bdda26461a8c6f377cc/FLAG585b5e873 [2022-10-15 16:17:31,751 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031f49fbe/bc71d8cf67694bdda26461a8c6f377cc [2022-10-15 16:17:31,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:17:31,774 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:17:31,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:17:31,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:17:31,784 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:17:31,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:17:31" (1/1) ... [2022-10-15 16:17:31,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b6994f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:17:31, skipping insertion in model container [2022-10-15 16:17:31,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:17:31" (1/1) ... [2022-10-15 16:17:31,795 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:17:31,814 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:17:32,029 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/array-crafted/zero_sum_const1.c[406,419] [2022-10-15 16:17:32,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:17:32,072 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:17:32,090 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/array-crafted/zero_sum_const1.c[406,419] [2022-10-15 16:17:32,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:17:32,135 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:17:32,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:17:32 WrapperNode [2022-10-15 16:17:32,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:17:32,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:17:32,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:17:32,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:17:32,156 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:17:32" (1/1) ... [2022-10-15 16:17:32,167 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:17:32" (1/1) ... [2022-10-15 16:17:32,199 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2022-10-15 16:17:32,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:17:32,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:17:32,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:17:32,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:17:32,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:17:32" (1/1) ... [2022-10-15 16:17:32,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:17:32" (1/1) ... [2022-10-15 16:17:32,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:17:32" (1/1) ... [2022-10-15 16:17:32,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:17:32" (1/1) ... [2022-10-15 16:17:32,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:17:32" (1/1) ... [2022-10-15 16:17:32,250 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:17:32" (1/1) ... [2022-10-15 16:17:32,251 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:17:32" (1/1) ... [2022-10-15 16:17:32,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:17:32" (1/1) ... [2022-10-15 16:17:32,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:17:32,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:17:32,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:17:32,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:17:32,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:17:32" (1/1) ... [2022-10-15 16:17:32,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:17:32,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:17:32,357 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:17:32,384 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:17:32,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:17:32,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:17:32,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:17:32,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 16:17:32,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:17:32,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:17:32,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:17:32,556 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:17:32,558 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:17:32,793 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:17:32,804 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:17:32,805 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-15 16:17:32,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:17:32 BoogieIcfgContainer [2022-10-15 16:17:32,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:17:32,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:17:32,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:17:32,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:17:32,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:17:31" (1/3) ... [2022-10-15 16:17:32,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bde8f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:17:32, skipping insertion in model container [2022-10-15 16:17:32,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:17:32" (2/3) ... [2022-10-15 16:17:32,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bde8f3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:17:32, skipping insertion in model container [2022-10-15 16:17:32,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:17:32" (3/3) ... [2022-10-15 16:17:32,844 INFO L112 eAbstractionObserver]: Analyzing ICFG zero_sum_const1.c [2022-10-15 16:17:32,896 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:17:32,896 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-10-15 16:17:32,972 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:17:32,980 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;@519e9353, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:17:32,980 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-10-15 16:17:32,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:17:32,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:17:32,993 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:17:32,993 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:17:32,994 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:17:33,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:17:33,001 INFO L85 PathProgramCache]: Analyzing trace with hash 28693957, now seen corresponding path program 1 times [2022-10-15 16:17:33,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:17:33,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3597645] [2022-10-15 16:17:33,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:17:33,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:17:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:17:33,486 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:17:33,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:17:33,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3597645] [2022-10-15 16:17:33,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3597645] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:17:33,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:17:33,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:17:33,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869918935] [2022-10-15 16:17:33,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:17:33,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:17:33,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:17:33,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:17:33,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:17:33,550 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:17:33,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:17:33,690 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-10-15 16:17:33,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:17:33,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 16:17:33,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:17:33,706 INFO L225 Difference]: With dead ends: 36 [2022-10-15 16:17:33,706 INFO L226 Difference]: Without dead ends: 34 [2022-10-15 16:17:33,710 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:17:33,720 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:17:33,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 43 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:17:33,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-10-15 16:17:33,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-10-15 16:17:33,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.5) internal successors, (36), 31 states have internal predecessors, (36), 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:17:33,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-10-15 16:17:33,779 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 5 [2022-10-15 16:17:33,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:17:33,779 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-10-15 16:17:33,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:17:33,780 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-10-15 16:17:33,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:17:33,781 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:17:33,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:17:33,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:17:33,783 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:17:33,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:17:33,784 INFO L85 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2022-10-15 16:17:33,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:17:33,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462552634] [2022-10-15 16:17:33,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:17:33,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:17:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:17:33,876 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:17:33,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:17:33,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462552634] [2022-10-15 16:17:33,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462552634] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:17:33,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:17:33,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:17:33,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680530767] [2022-10-15 16:17:33,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:17:33,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:17:33,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:17:33,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:17:33,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:17:33,881 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:17:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:17:33,904 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-10-15 16:17:33,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:17:33,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 16:17:33,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:17:33,906 INFO L225 Difference]: With dead ends: 32 [2022-10-15 16:17:33,906 INFO L226 Difference]: Without dead ends: 32 [2022-10-15 16:17:33,907 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:17:33,909 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:17:33,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 27 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:17:33,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-10-15 16:17:33,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-10-15 16:17:33,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 28 states have internal predecessors, (32), 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:17:33,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-10-15 16:17:33,916 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 5 [2022-10-15 16:17:33,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:17:33,916 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-10-15 16:17:33,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:17:33,917 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-10-15 16:17:33,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 16:17:33,917 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:17:33,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 16:17:33,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:17:33,918 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:17:33,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:17:33,919 INFO L85 PathProgramCache]: Analyzing trace with hash 28758309, now seen corresponding path program 1 times [2022-10-15 16:17:33,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:17:33,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471532939] [2022-10-15 16:17:33,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:17:33,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:17:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:17:34,022 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:17:34,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:17:34,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471532939] [2022-10-15 16:17:34,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471532939] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:17:34,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:17:34,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:17:34,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015967231] [2022-10-15 16:17:34,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:17:34,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:17:34,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:17:34,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:17:34,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:17:34,027 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:17:34,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:17:34,061 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-10-15 16:17:34,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:17:34,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 16:17:34,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:17:34,063 INFO L225 Difference]: With dead ends: 31 [2022-10-15 16:17:34,063 INFO L226 Difference]: Without dead ends: 29 [2022-10-15 16:17:34,064 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:17:34,067 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:17:34,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:17:34,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-10-15 16:17:34,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-10-15 16:17:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 28 states have internal predecessors, (31), 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:17:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-10-15 16:17:34,077 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 5 [2022-10-15 16:17:34,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:17:34,079 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-10-15 16:17:34,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:17:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-10-15 16:17:34,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-15 16:17:34,081 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:17:34,081 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-10-15 16:17:34,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:17:34,082 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:17:34,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:17:34,086 INFO L85 PathProgramCache]: Analyzing trace with hash 123139218, now seen corresponding path program 1 times [2022-10-15 16:17:34,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:17:34,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820727434] [2022-10-15 16:17:34,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:17:34,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:17:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:17:34,352 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:17:34,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:17:34,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820727434] [2022-10-15 16:17:34,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820727434] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:17:34,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073069484] [2022-10-15 16:17:34,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:17:34,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:17:34,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:17:34,374 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:17:34,400 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:17:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:17:34,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-15 16:17:34,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:17:34,594 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:17:34,668 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:17:34,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:17:34,784 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:17:34,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073069484] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:17:34,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:17:34,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-10-15 16:17:34,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372996023] [2022-10-15 16:17:34,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:17:34,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:17:34,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:17:34,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:17:34,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:17:34,791 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:17:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:17:34,938 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-10-15 16:17:34,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:17:34,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-15 16:17:34,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:17:34,940 INFO L225 Difference]: With dead ends: 68 [2022-10-15 16:17:34,940 INFO L226 Difference]: Without dead ends: 68 [2022-10-15 16:17:34,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:17:34,943 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 65 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:17:34,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 79 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:17:34,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-10-15 16:17:34,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2022-10-15 16:17:34,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:17:34,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-10-15 16:17:34,950 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 8 [2022-10-15 16:17:34,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:17:34,951 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-10-15 16:17:34,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:17:34,951 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-10-15 16:17:34,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 16:17:34,952 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:17:34,952 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-10-15 16:17:34,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 16:17:35,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:17:35,168 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:17:35,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:17:35,170 INFO L85 PathProgramCache]: Analyzing trace with hash 538330789, now seen corresponding path program 2 times [2022-10-15 16:17:35,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:17:35,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913455521] [2022-10-15 16:17:35,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:17:35,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:17:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:17:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:17:35,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:17:35,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913455521] [2022-10-15 16:17:35,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913455521] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:17:35,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203677416] [2022-10-15 16:17:35,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:17:35,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:17:35,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:17:35,342 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:17:35,368 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:17:35,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 16:17:35,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:17:35,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2022-10-15 16:17:35,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:17:35,433 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:17:35,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:17:35,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:17:35,768 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:17:35,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203677416] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:17:35,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:17:35,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-10-15 16:17:35,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178728782] [2022-10-15 16:17:35,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:17:35,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-15 16:17:35,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:17:35,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-15 16:17:35,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:17:35,772 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 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:17:35,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:17:35,998 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-10-15 16:17:35,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:17:35,999 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 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 11 [2022-10-15 16:17:35,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:17:36,000 INFO L225 Difference]: With dead ends: 79 [2022-10-15 16:17:36,000 INFO L226 Difference]: Without dead ends: 79 [2022-10-15 16:17:36,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2022-10-15 16:17:36,002 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 97 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:17:36,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 96 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:17:36,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-10-15 16:17:36,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 25. [2022-10-15 16:17:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 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:17:36,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-10-15 16:17:36,009 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 11 [2022-10-15 16:17:36,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:17:36,009 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-10-15 16:17:36,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 11 states have internal predecessors, (24), 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:17:36,010 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-10-15 16:17:36,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:17:36,010 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:17:36,011 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:17:36,046 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:17:36,225 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:17:36,226 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:17:36,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:17:36,227 INFO L85 PathProgramCache]: Analyzing trace with hash -363728684, now seen corresponding path program 1 times [2022-10-15 16:17:36,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:17:36,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156170615] [2022-10-15 16:17:36,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:17:36,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:17:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:17:36,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:17:36,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:17:36,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156170615] [2022-10-15 16:17:36,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156170615] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:17:36,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:17:36,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:17:36,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551098996] [2022-10-15 16:17:36,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:17:36,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:17:36,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:17:36,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:17:36,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:17:36,282 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.5) 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:17:36,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:17:36,314 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-10-15 16:17:36,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:17:36,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) 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 14 [2022-10-15 16:17:36,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:17:36,315 INFO L225 Difference]: With dead ends: 35 [2022-10-15 16:17:36,316 INFO L226 Difference]: Without dead ends: 35 [2022-10-15 16:17:36,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:17:36,317 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:17:36,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 23 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:17:36,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-10-15 16:17:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2022-10-15 16:17:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 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:17:36,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-10-15 16:17:36,322 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 14 [2022-10-15 16:17:36,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:17:36,322 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-10-15 16:17:36,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) 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:17:36,323 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-10-15 16:17:36,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-10-15 16:17:36,323 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:17:36,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:17:36,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:17:36,324 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:17:36,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:17:36,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1504316314, now seen corresponding path program 1 times [2022-10-15 16:17:36,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:17:36,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041942493] [2022-10-15 16:17:36,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:17:36,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:17:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:17:36,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 16:17:36,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:17:36,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041942493] [2022-10-15 16:17:36,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041942493] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:17:36,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796501680] [2022-10-15 16:17:36,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:17:36,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:17:36,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:17:36,403 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:17:36,419 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:17:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:17:36,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 16:17:36,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:17:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 16:17:36,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:17:36,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 16:17:36,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796501680] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:17:36,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:17:36,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-10-15 16:17:36,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157138195] [2022-10-15 16:17:36,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:17:36,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:17:36,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:17:36,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:17:36,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:17:36,533 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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:17:36,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:17:36,586 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-10-15 16:17:36,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:17:36,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-10-15 16:17:36,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:17:36,588 INFO L225 Difference]: With dead ends: 32 [2022-10-15 16:17:36,588 INFO L226 Difference]: Without dead ends: 32 [2022-10-15 16:17:36,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:17:36,589 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:17:36,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 46 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:17:36,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-10-15 16:17:36,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-10-15 16:17:36,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 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:17:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-10-15 16:17:36,593 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 22 [2022-10-15 16:17:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:17:36,594 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-10-15 16:17:36,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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:17:36,594 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-10-15 16:17:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 16:17:36,595 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:17:36,595 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:17:36,635 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:17:36,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:17:36,810 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:17:36,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:17:36,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1418018707, now seen corresponding path program 2 times [2022-10-15 16:17:36,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:17:36,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544020508] [2022-10-15 16:17:36,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:17:36,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:17:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:17:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:17:36,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:17:36,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544020508] [2022-10-15 16:17:36,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544020508] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:17:36,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585991324] [2022-10-15 16:17:36,882 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 16:17:36,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:17:36,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:17:36,883 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:17:36,915 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:17:36,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 16:17:36,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:17:36,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-15 16:17:36,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:17:37,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:17:37,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:17:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:17:37,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585991324] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:17:37,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:17:37,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-10-15 16:17:37,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244085516] [2022-10-15 16:17:37,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:17:37,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:17:37,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:17:37,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:17:37,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:17:37,052 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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:17:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:17:37,118 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2022-10-15 16:17:37,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-15 16:17:37,119 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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 25 [2022-10-15 16:17:37,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:17:37,119 INFO L225 Difference]: With dead ends: 46 [2022-10-15 16:17:37,120 INFO L226 Difference]: Without dead ends: 46 [2022-10-15 16:17:37,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:17:37,121 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 71 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:17:37,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 32 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:17:37,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-15 16:17:37,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 38. [2022-10-15 16:17:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 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:17:37,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-10-15 16:17:37,126 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 25 [2022-10-15 16:17:37,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:17:37,126 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-10-15 16:17:37,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 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:17:37,127 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-10-15 16:17:37,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-10-15 16:17:37,128 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:17:37,128 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:17:37,166 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:17:37,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:17:37,343 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:17:37,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:17:37,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1754934733, now seen corresponding path program 3 times [2022-10-15 16:17:37,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:17:37,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298510989] [2022-10-15 16:17:37,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:17:37,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:17:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:17:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:17:38,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:17:38,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298510989] [2022-10-15 16:17:38,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298510989] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:17:38,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186288520] [2022-10-15 16:17:38,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-15 16:17:38,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:17:38,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:17:38,373 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:17:38,377 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:17:38,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-10-15 16:17:38,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 16:17:38,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 38 conjunts are in the unsatisfiable core [2022-10-15 16:17:38,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:17:38,445 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:17:39,645 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:17:39,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-10-15 16:17:39,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-10-15 16:17:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 16:17:39,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:17:42,052 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:17:42,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 75 [2022-10-15 16:17:42,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:17:42,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:17:42,490 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-10-15 16:17:42,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 18 [2022-10-15 16:17:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 16:17:43,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186288520] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 16:17:43,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 16:17:43,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 20] total 53 [2022-10-15 16:17:43,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394331587] [2022-10-15 16:17:43,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 16:17:43,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-10-15 16:17:43,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:17:43,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-10-15 16:17:43,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=2522, Unknown=0, NotChecked=0, Total=2756 [2022-10-15 16:17:43,113 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 53 states, 53 states have (on average 1.679245283018868) internal successors, (89), 53 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:17:45,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:17:45,249 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-10-15 16:17:45,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-10-15 16:17:45,250 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.679245283018868) internal successors, (89), 53 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 33 [2022-10-15 16:17:45,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:17:45,251 INFO L225 Difference]: With dead ends: 62 [2022-10-15 16:17:45,251 INFO L226 Difference]: Without dead ends: 62 [2022-10-15 16:17:45,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1441 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=572, Invalid=5434, Unknown=0, NotChecked=0, Total=6006 [2022-10-15 16:17:45,257 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 65 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 262 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-15 16:17:45,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 209 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 491 Invalid, 0 Unknown, 262 Unchecked, 0.4s Time] [2022-10-15 16:17:45,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-10-15 16:17:45,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2022-10-15 16:17:45,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.1153846153846154) 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:17:45,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-10-15 16:17:45,273 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 33 [2022-10-15 16:17:45,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:17:45,274 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-10-15 16:17:45,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.679245283018868) internal successors, (89), 53 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:17:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-10-15 16:17:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-15 16:17:45,276 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:17:45,277 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:17:45,315 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:17:45,479 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:17:45,480 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2022-10-15 16:17:45,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:17:45,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1430024981, now seen corresponding path program 1 times [2022-10-15 16:17:45,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:17:45,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873434470] [2022-10-15 16:17:45,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:17:45,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:17:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:17:45,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:17:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:17:45,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:17:45,544 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:17:45,546 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2022-10-15 16:17:45,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 8 remaining) [2022-10-15 16:17:45,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2022-10-15 16:17:45,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 8 remaining) [2022-10-15 16:17:45,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 8 remaining) [2022-10-15 16:17:45,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 8 remaining) [2022-10-15 16:17:45,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 8 remaining) [2022-10-15 16:17:45,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2022-10-15 16:17:45,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:17:45,554 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2022-10-15 16:17:45,558 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:17:45,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:17:45 BoogieIcfgContainer [2022-10-15 16:17:45,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:17:45,606 INFO L158 Benchmark]: Toolchain (without parser) took 13849.24ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 130.0MB in the beginning and 98.2MB in the end (delta: 31.8MB). Peak memory consumption was 62.5MB. Max. memory is 8.0GB. [2022-10-15 16:17:45,606 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 151.0MB. Free memory is still 121.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:17:45,606 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.31ms. Allocated memory is still 151.0MB. Free memory was 129.8MB in the beginning and 119.8MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-15 16:17:45,607 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.71ms. Allocated memory is still 151.0MB. Free memory was 119.8MB in the beginning and 118.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 16:17:45,607 INFO L158 Benchmark]: Boogie Preprocessor took 69.07ms. Allocated memory is still 151.0MB. Free memory was 118.3MB in the beginning and 134.7MB in the end (delta: -16.4MB). Peak memory consumption was 5.3MB. Max. memory is 8.0GB. [2022-10-15 16:17:45,607 INFO L158 Benchmark]: RCFGBuilder took 537.35ms. Allocated memory is still 151.0MB. Free memory was 134.7MB in the beginning and 123.1MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-10-15 16:17:45,608 INFO L158 Benchmark]: TraceAbstraction took 12778.65ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 122.4MB in the beginning and 98.2MB in the end (delta: 24.2MB). Peak memory consumption was 56.2MB. Max. memory is 8.0GB. [2022-10-15 16:17:45,610 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.25ms. Allocated memory is still 151.0MB. Free memory is still 121.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 363.31ms. Allocated memory is still 151.0MB. Free memory was 129.8MB in the beginning and 119.8MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.71ms. Allocated memory is still 151.0MB. Free memory was 119.8MB in the beginning and 118.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 69.07ms. Allocated memory is still 151.0MB. Free memory was 118.3MB in the beginning and 134.7MB in the end (delta: -16.4MB). Peak memory consumption was 5.3MB. Max. memory is 8.0GB. * RCFGBuilder took 537.35ms. Allocated memory is still 151.0MB. Free memory was 134.7MB in the beginning and 123.1MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 12778.65ms. Allocated memory was 151.0MB in the beginning and 181.4MB in the end (delta: 30.4MB). Free memory was 122.4MB in the beginning and 98.2MB in the end (delta: 24.2MB). Peak memory consumption was 56.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: 16]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 16. Possible FailurePath: [L12] long SIZE; [L14] const int MAX = 100000; VAL [MAX=100000, SIZE=0] [L18] SIZE = __VERIFIER_nondet_long() [L19] COND TRUE SIZE > 1 && SIZE < MAX [L21] int i; [L22] long *a = malloc(sizeof(long)*SIZE); [L23] long sum=0; [L25] i = 0 VAL [a={-2:0}, i=0, MAX=100000, SIZE=2, sum=0] [L25] COND TRUE i < SIZE VAL [a={-2:0}, i=0, MAX=100000, SIZE=2, sum=0] [L27] a[i] = 1 VAL [a={-2:0}, i=0, MAX=100000, SIZE=2, sum=0] [L25] i++ VAL [a={-2:0}, i=1, MAX=100000, SIZE=2, sum=0] [L25] COND TRUE i < SIZE VAL [a={-2:0}, i=1, MAX=100000, SIZE=2, sum=0] [L27] a[i] = 1 VAL [a={-2:0}, i=1, MAX=100000, SIZE=2, sum=0] [L25] i++ VAL [a={-2:0}, i=2, MAX=100000, SIZE=2, sum=0] [L25] COND FALSE !(i < SIZE) VAL [a={-2:0}, i=2, MAX=100000, SIZE=2, sum=0] [L30] i = 0 VAL [a={-2:0}, i=0, MAX=100000, SIZE=2, sum=0] [L30] COND TRUE i < SIZE VAL [a={-2:0}, i=0, MAX=100000, SIZE=2, sum=0] [L32] EXPR a[i] VAL [a={-2:0}, a[i]=1, i=0, MAX=100000, SIZE=2, sum=0] [L32] sum = sum + a[i] [L30] i++ VAL [a={-2:0}, i=1, MAX=100000, SIZE=2, sum=1] [L30] COND TRUE i < SIZE VAL [a={-2:0}, i=1, MAX=100000, SIZE=2, sum=1] [L32] EXPR a[i] VAL [a={-2:0}, a[i]=1, i=1, MAX=100000, SIZE=2, sum=1] [L32] sum = sum + a[i] [L30] i++ VAL [a={-2:0}, i=2, MAX=100000, SIZE=2, sum=2] [L30] COND FALSE !(i < SIZE) VAL [a={-2:0}, i=2, MAX=100000, SIZE=2, sum=2] [L35] i = 0 VAL [a={-2:0}, i=0, MAX=100000, SIZE=2, sum=2] [L35] COND TRUE i < SIZE VAL [a={-2:0}, i=0, MAX=100000, SIZE=2, sum=2] [L37] EXPR a[i] VAL [a={-2:0}, a[i]=1, i=0, MAX=100000, SIZE=2, sum=2] [L37] sum = sum - a[i] [L35] i++ VAL [a={-2:0}, i=1, MAX=100000, SIZE=2, sum=1] [L35] COND TRUE i < SIZE VAL [a={-2:0}, i=1, MAX=100000, SIZE=2, sum=1] [L37] EXPR a[i] VAL [a={-2:0}, a[i]=1, i=1, MAX=100000, SIZE=2, sum=1] [L37] sum = sum - a[i] [L35] i++ VAL [a={-2:0}, i=2, MAX=100000, SIZE=2, sum=0] [L35] COND FALSE !(i < SIZE) VAL [a={-2:0}, i=2, MAX=100000, SIZE=2, sum=0] [L39] CALL __VERIFIER_assert(sum == 0) [L8] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, MAX=100000, SIZE=2] [L39] RET __VERIFIER_assert(sum == 0) [L41] return 1; VAL [\result=1, a={-2:0}, i=2, MAX=100000, SIZE=2, sum=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: 8]: 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, 32 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 363 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 363 mSDsluCounter, 606 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 262 IncrementalHoareTripleChecker+Unchecked, 402 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 898 IncrementalHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 204 mSDtfsCounter, 898 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 147 SyntacticMatches, 8 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=9, InterpolantAutomatonStates: 66, 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, 9 MinimizatonAttempts, 107 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 307 ConstructedInterpolants, 22 QuantifiedInterpolants, 4285 SizeOfPredicates, 25 NumberOfNonLiveVariables, 472 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 41/109 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:17:45,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...