/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-regression/rule57_ebda_blast.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:57:19,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:57:19,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:57:19,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:57:19,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:57:19,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:57:19,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:57:19,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:57:19,327 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:57:19,328 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:57:19,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:57:19,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:57:19,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:57:19,333 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:57:19,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:57:19,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:57:19,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:57:19,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:57:19,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:57:19,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:57:19,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:57:19,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:57:19,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:57:19,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:57:19,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:57:19,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:57:19,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:57:19,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:57:19,355 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:57:19,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:57:19,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:57:19,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:57:19,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:57:19,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:57:19,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:57:19,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:57:19,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:57:19,376 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:57:19,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:57:19,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:57:19,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:57:19,379 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 16:57:19,407 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:57:19,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:57:19,407 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:57:19,408 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:57:19,408 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:57:19,408 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:57:19,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:57:19,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:57:19,410 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:57:19,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:57:19,410 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:57:19,410 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:57:19,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:57:19,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:57:19,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:57:19,411 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:57:19,411 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:57:19,411 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:57:19,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:57:19,412 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:57:19,412 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:57:19,412 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:57:19,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:57:19,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:57:19,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:57:19,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:57:19,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:57:19,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:57:19,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:57:19,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:57:19,414 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 16:57:19,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:57:19,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:57:19,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:57:19,884 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:57:19,884 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:57:19,886 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/rule57_ebda_blast.i [2022-10-15 16:57:19,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2de6d524/e23b0cb4501e49dc93ab754584d42461/FLAGfc018d000 [2022-10-15 16:57:20,563 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:57:20,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule57_ebda_blast.i [2022-10-15 16:57:20,573 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2de6d524/e23b0cb4501e49dc93ab754584d42461/FLAGfc018d000 [2022-10-15 16:57:20,886 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2de6d524/e23b0cb4501e49dc93ab754584d42461 [2022-10-15 16:57:20,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:57:20,895 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:57:20,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:57:20,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:57:20,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:57:20,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:57:20" (1/1) ... [2022-10-15 16:57:20,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76aa4afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:20, skipping insertion in model container [2022-10-15 16:57:20,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:57:20" (1/1) ... [2022-10-15 16:57:20,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:57:20,932 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:57:21,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule57_ebda_blast.i[299,312] [2022-10-15 16:57:21,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:57:21,128 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:57:21,142 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule57_ebda_blast.i[299,312] [2022-10-15 16:57:21,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:57:21,175 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:57:21,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21 WrapperNode [2022-10-15 16:57:21,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:57:21,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:57:21,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:57:21,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:57:21,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,230 INFO L138 Inliner]: procedures = 24, calls = 25, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 99 [2022-10-15 16:57:21,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:57:21,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:57:21,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:57:21,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:57:21,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,287 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:57:21,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:57:21,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:57:21,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:57:21,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (1/1) ... [2022-10-15 16:57:21,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:57:21,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:21,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 16:57:21,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 16:57:21,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 16:57:21,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:57:21,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:57:21,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 16:57:21,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:57:21,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 16:57:21,451 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-10-15 16:57:21,451 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-10-15 16:57:21,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:57:21,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:57:21,573 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:57:21,576 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:57:21,968 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:57:21,977 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:57:21,977 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 16:57:21,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:57:21 BoogieIcfgContainer [2022-10-15 16:57:21,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:57:21,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:57:21,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:57:21,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:57:21,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:57:20" (1/3) ... [2022-10-15 16:57:21,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4874dad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:57:21, skipping insertion in model container [2022-10-15 16:57:21,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:57:21" (2/3) ... [2022-10-15 16:57:21,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4874dad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:57:21, skipping insertion in model container [2022-10-15 16:57:21,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:57:21" (3/3) ... [2022-10-15 16:57:21,990 INFO L112 eAbstractionObserver]: Analyzing ICFG rule57_ebda_blast.i [2022-10-15 16:57:22,012 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:57:22,013 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-10-15 16:57:22,071 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:57:22,080 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;@364a73b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:57:22,080 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-10-15 16:57:22,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 16:57:22,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 16:57:22,102 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:22,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:22,103 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:57:22,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:22,110 INFO L85 PathProgramCache]: Analyzing trace with hash -549569916, now seen corresponding path program 1 times [2022-10-15 16:57:22,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:22,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051330581] [2022-10-15 16:57:22,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:22,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:22,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:57:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:57:22,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:22,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051330581] [2022-10-15 16:57:22,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051330581] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:22,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:22,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 16:57:22,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445877436] [2022-10-15 16:57:22,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:22,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:57:22,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:22,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:57:22,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:57:22,974 INFO L87 Difference]: Start difference. First operand has 58 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 53 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 16:57:23,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:23,186 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-10-15 16:57:23,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:57:23,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-10-15 16:57:23,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:23,205 INFO L225 Difference]: With dead ends: 66 [2022-10-15 16:57:23,206 INFO L226 Difference]: Without dead ends: 62 [2022-10-15 16:57:23,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:57:23,219 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 15 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:23,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 231 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 16:57:23,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-10-15 16:57:23,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2022-10-15 16:57:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.6) internal successors, (56), 49 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 16:57:23,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-10-15 16:57:23,266 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 10 [2022-10-15 16:57:23,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:23,268 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-10-15 16:57:23,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 16:57:23,268 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-10-15 16:57:23,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 16:57:23,270 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:23,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:23,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:57:23,271 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:57:23,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:23,272 INFO L85 PathProgramCache]: Analyzing trace with hash -549569917, now seen corresponding path program 1 times [2022-10-15 16:57:23,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:23,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984390206] [2022-10-15 16:57:23,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:23,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:23,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:57:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:57:23,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:23,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984390206] [2022-10-15 16:57:23,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984390206] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:23,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:23,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 16:57:23,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021674645] [2022-10-15 16:57:23,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:23,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:57:23,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:23,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:57:23,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:57:23,477 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 16:57:23,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:23,621 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-10-15 16:57:23,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:57:23,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-10-15 16:57:23,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:23,623 INFO L225 Difference]: With dead ends: 63 [2022-10-15 16:57:23,623 INFO L226 Difference]: Without dead ends: 63 [2022-10-15 16:57:23,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:57:23,626 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 24 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:23,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 201 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:57:23,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-10-15 16:57:23,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2022-10-15 16:57:23,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 49 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 16:57:23,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-10-15 16:57:23,641 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 10 [2022-10-15 16:57:23,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:23,642 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-10-15 16:57:23,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 16:57:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-10-15 16:57:23,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:57:23,643 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:23,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:23,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:57:23,644 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:57:23,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:23,645 INFO L85 PathProgramCache]: Analyzing trace with hash 178044750, now seen corresponding path program 1 times [2022-10-15 16:57:23,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:23,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206688866] [2022-10-15 16:57:23,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:23,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:23,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:57:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:57:23,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:23,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206688866] [2022-10-15 16:57:23,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206688866] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:23,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:23,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 16:57:23,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113210807] [2022-10-15 16:57:23,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:23,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:57:23,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:23,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:57:23,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:57:23,798 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 16:57:23,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:23,913 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2022-10-15 16:57:23,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:57:23,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-10-15 16:57:23,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:23,915 INFO L225 Difference]: With dead ends: 54 [2022-10-15 16:57:23,915 INFO L226 Difference]: Without dead ends: 54 [2022-10-15 16:57:23,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:57:23,917 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 50 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:23,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 212 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:57:23,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-15 16:57:23,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-10-15 16:57:23,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 49 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 16:57:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2022-10-15 16:57:23,926 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 13 [2022-10-15 16:57:23,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:23,927 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2022-10-15 16:57:23,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 16:57:23,927 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2022-10-15 16:57:23,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 16:57:23,928 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:23,928 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:23,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:57:23,929 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:57:23,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:23,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1551969032, now seen corresponding path program 1 times [2022-10-15 16:57:23,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:23,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825117407] [2022-10-15 16:57:23,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:23,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:24,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:57:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:24,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 16:57:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:24,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:24,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825117407] [2022-10-15 16:57:24,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825117407] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:24,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:24,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 16:57:24,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586063131] [2022-10-15 16:57:24,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:24,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:57:24,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:24,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:57:24,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:57:24,113 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:57:24,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:24,283 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2022-10-15 16:57:24,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 16:57:24,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-10-15 16:57:24,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:24,285 INFO L225 Difference]: With dead ends: 54 [2022-10-15 16:57:24,286 INFO L226 Difference]: Without dead ends: 54 [2022-10-15 16:57:24,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:57:24,288 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 45 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:24,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 154 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:57:24,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-15 16:57:24,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-10-15 16:57:24,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 48 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 16:57:24,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-10-15 16:57:24,296 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 18 [2022-10-15 16:57:24,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:24,297 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-10-15 16:57:24,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:57:24,297 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-10-15 16:57:24,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 16:57:24,298 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:24,298 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:24,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:57:24,299 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:57:24,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:24,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1551969033, now seen corresponding path program 1 times [2022-10-15 16:57:24,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:24,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705200435] [2022-10-15 16:57:24,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:24,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:24,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:57:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:24,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 16:57:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:24,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:24,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:24,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705200435] [2022-10-15 16:57:24,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705200435] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:24,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:24,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-15 16:57:24,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485491016] [2022-10-15 16:57:24,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:24,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:57:24,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:24,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:57:24,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:57:24,566 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:57:24,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:24,701 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2022-10-15 16:57:24,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:57:24,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-10-15 16:57:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:24,703 INFO L225 Difference]: With dead ends: 60 [2022-10-15 16:57:24,703 INFO L226 Difference]: Without dead ends: 60 [2022-10-15 16:57:24,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-10-15 16:57:24,704 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 15 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:24,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 193 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:57:24,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-10-15 16:57:24,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2022-10-15 16:57:24,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.358974358974359) internal successors, (53), 46 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 16:57:24,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-10-15 16:57:24,711 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 18 [2022-10-15 16:57:24,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:24,712 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-10-15 16:57:24,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:57:24,712 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-10-15 16:57:24,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-10-15 16:57:24,713 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:24,713 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:24,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:57:24,714 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:57:24,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:24,715 INFO L85 PathProgramCache]: Analyzing trace with hash -613697293, now seen corresponding path program 1 times [2022-10-15 16:57:24,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:24,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922158030] [2022-10-15 16:57:24,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:24,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:24,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:57:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:24,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 16:57:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:24,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:24,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922158030] [2022-10-15 16:57:24,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922158030] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:24,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:24,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 16:57:24,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565347236] [2022-10-15 16:57:24,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:24,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 16:57:24,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:24,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 16:57:24,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 16:57:24,850 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:57:24,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:24,989 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-10-15 16:57:24,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 16:57:24,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-10-15 16:57:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:24,991 INFO L225 Difference]: With dead ends: 52 [2022-10-15 16:57:24,991 INFO L226 Difference]: Without dead ends: 52 [2022-10-15 16:57:24,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-10-15 16:57:24,993 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 43 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:24,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 193 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:57:24,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-10-15 16:57:24,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-10-15 16:57:24,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 46 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 16:57:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2022-10-15 16:57:24,999 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 21 [2022-10-15 16:57:24,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:25,000 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2022-10-15 16:57:25,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:57:25,000 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-10-15 16:57:25,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-15 16:57:25,001 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:25,001 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:25,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:57:25,002 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:57:25,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:25,003 INFO L85 PathProgramCache]: Analyzing trace with hash 521988616, now seen corresponding path program 1 times [2022-10-15 16:57:25,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:25,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020126053] [2022-10-15 16:57:25,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:25,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:25,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:57:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:25,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 16:57:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:25,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:57:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:57:25,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:25,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020126053] [2022-10-15 16:57:25,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020126053] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:57:25,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:57:25,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-15 16:57:25,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919492479] [2022-10-15 16:57:25,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:57:25,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 16:57:25,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:25,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 16:57:25,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-15 16:57:25,193 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:57:25,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:25,266 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-10-15 16:57:25,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 16:57:25,266 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-10-15 16:57:25,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:25,267 INFO L225 Difference]: With dead ends: 50 [2022-10-15 16:57:25,267 INFO L226 Difference]: Without dead ends: 50 [2022-10-15 16:57:25,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-10-15 16:57:25,269 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 36 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:25,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 259 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:57:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-10-15 16:57:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-10-15 16:57:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.263157894736842) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 16:57:25,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-10-15 16:57:25,274 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 29 [2022-10-15 16:57:25,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:25,275 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-10-15 16:57:25,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 16:57:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-10-15 16:57:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-10-15 16:57:25,276 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:25,276 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:25,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:57:25,277 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:57:25,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:25,277 INFO L85 PathProgramCache]: Analyzing trace with hash 521988653, now seen corresponding path program 1 times [2022-10-15 16:57:25,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:25,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033190181] [2022-10-15 16:57:25,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:25,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:25,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:57:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:25,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 16:57:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:25,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:57:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 16:57:25,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:25,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033190181] [2022-10-15 16:57:25,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033190181] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:25,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204247265] [2022-10-15 16:57:25,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:25,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:25,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:25,859 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:57:25,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 16:57:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:25,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 30 conjunts are in the unsatisfiable core [2022-10-15 16:57:25,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:57:26,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:57:26,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:57:26,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-10-15 16:57:26,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-10-15 16:57:26,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:57:26,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-15 16:57:26,358 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-10-15 16:57:26,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-10-15 16:57:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:26,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:57:26,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204247265] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:26,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-15 16:57:26,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2022-10-15 16:57:26,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665854967] [2022-10-15 16:57:26,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-15 16:57:26,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-15 16:57:26,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:26,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-15 16:57:26,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-10-15 16:57:26,565 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 16:57:26,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:26,871 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-10-15 16:57:26,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 16:57:26,871 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 29 [2022-10-15 16:57:26,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:26,872 INFO L225 Difference]: With dead ends: 48 [2022-10-15 16:57:26,872 INFO L226 Difference]: Without dead ends: 48 [2022-10-15 16:57:26,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-10-15 16:57:26,874 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 72 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:26,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 139 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 131 Invalid, 0 Unknown, 5 Unchecked, 0.1s Time] [2022-10-15 16:57:26,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-15 16:57:26,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-10-15 16:57:26,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 16:57:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-10-15 16:57:26,879 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 29 [2022-10-15 16:57:26,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:26,880 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-10-15 16:57:26,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 11 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 16:57:26,880 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-10-15 16:57:26,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 16:57:26,881 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:26,881 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 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:57:26,920 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:57:27,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:27,097 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:57:27,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:27,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1512634140, now seen corresponding path program 1 times [2022-10-15 16:57:27,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:27,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415399342] [2022-10-15 16:57:27,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:27,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:27,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:57:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:27,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 16:57:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:27,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:57:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-15 16:57:27,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:27,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415399342] [2022-10-15 16:57:27,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415399342] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:27,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559463582] [2022-10-15 16:57:27,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:27,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:27,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:27,514 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 16:57:27,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 16:57:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:27,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 20 conjunts are in the unsatisfiable core [2022-10-15 16:57:27,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:57:27,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:57:27,730 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-15 16:57:27,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-15 16:57:27,819 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-15 16:57:27,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-15 16:57:27,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-15 16:57:27,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:57:27,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559463582] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:27,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-15 16:57:27,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-10-15 16:57:27,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187174165] [2022-10-15 16:57:27,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-15 16:57:27,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-15 16:57:27,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:27,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-15 16:57:27,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-10-15 16:57:27,888 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 16:57:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:28,024 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-10-15 16:57:28,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 16:57:28,025 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-10-15 16:57:28,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:28,026 INFO L225 Difference]: With dead ends: 47 [2022-10-15 16:57:28,026 INFO L226 Difference]: Without dead ends: 47 [2022-10-15 16:57:28,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-10-15 16:57:28,027 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 27 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:28,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 176 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 3 Unchecked, 0.1s Time] [2022-10-15 16:57:28,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-15 16:57:28,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-10-15 16:57:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 41 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 16:57:28,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-10-15 16:57:28,032 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 32 [2022-10-15 16:57:28,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:28,032 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-10-15 16:57:28,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-10-15 16:57:28,033 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-10-15 16:57:28,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-10-15 16:57:28,034 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:28,034 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 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:57:28,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 16:57:28,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-10-15 16:57:28,250 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:57:28,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:28,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1512634139, now seen corresponding path program 1 times [2022-10-15 16:57:28,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:28,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689326599] [2022-10-15 16:57:28,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:28,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:28,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:57:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:28,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 16:57:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:28,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-15 16:57:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:28,990 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 16:57:28,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:57:28,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689326599] [2022-10-15 16:57:28,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689326599] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:28,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903301924] [2022-10-15 16:57:28,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:28,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:28,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:57:28,993 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:57:29,011 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:57:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:57:29,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 51 conjunts are in the unsatisfiable core [2022-10-15 16:57:29,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 16:57:29,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:57:29,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-10-15 16:57:29,321 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-10-15 16:57:29,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-10-15 16:57:29,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-15 16:57:29,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-15 16:57:29,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-10-15 16:57:29,551 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-10-15 16:57:29,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-10-15 16:57:29,594 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-10-15 16:57:29,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 16:57:31,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903301924] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 16:57:31,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-10-15 16:57:31,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2022-10-15 16:57:31,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509592871] [2022-10-15 16:57:31,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-10-15 16:57:31,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-10-15 16:57:31,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:57:31,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-10-15 16:57:31,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2022-10-15 16:57:31,776 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-10-15 16:57:32,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:57:32,022 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-10-15 16:57:32,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-15 16:57:32,022 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 32 [2022-10-15 16:57:32,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:57:32,023 INFO L225 Difference]: With dead ends: 45 [2022-10-15 16:57:32,023 INFO L226 Difference]: Without dead ends: 45 [2022-10-15 16:57:32,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2022-10-15 16:57:32,025 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 92 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 16:57:32,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 232 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 115 Invalid, 0 Unknown, 39 Unchecked, 0.2s Time] [2022-10-15 16:57:32,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-10-15 16:57:32,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-10-15 16:57:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 16:57:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2022-10-15 16:57:32,029 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 32 [2022-10-15 16:57:32,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:57:32,030 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2022-10-15 16:57:32,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 16 states have internal predecessors, (48), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-10-15 16:57:32,030 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-10-15 16:57:32,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-15 16:57:32,031 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:57:32,031 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:32,111 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:57:32,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 16:57:32,250 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-10-15 16:57:32,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:57:32,252 INFO L85 PathProgramCache]: Analyzing trace with hash -396478247, now seen corresponding path program 1 times [2022-10-15 16:57:32,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:57:32,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524178677] [2022-10-15 16:57:32,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:57:32,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:57:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:57:32,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:57:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:57:32,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:57:32,377 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:57:32,378 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-10-15 16:57:32,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2022-10-15 16:57:32,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-10-15 16:57:32,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-10-15 16:57:32,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-10-15 16:57:32,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-10-15 16:57:32,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-10-15 16:57:32,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-10-15 16:57:32,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-10-15 16:57:32,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-10-15 16:57:32,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2022-10-15 16:57:32,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2022-10-15 16:57:32,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 16 remaining) [2022-10-15 16:57:32,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2022-10-15 16:57:32,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2022-10-15 16:57:32,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-10-15 16:57:32,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 16:57:32,391 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:57:32,395 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:57:32,408 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:32,409 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:32,410 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:32,410 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:32,411 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:32,411 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:32,412 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:32,412 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:32,414 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:32,415 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:32,415 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:32,416 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:32,420 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:32,420 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:32,421 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:32,421 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:32,422 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:32,422 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-10-15 16:57:32,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:57:32 BoogieIcfgContainer [2022-10-15 16:57:32,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:57:32,488 INFO L158 Benchmark]: Toolchain (without parser) took 11597.70ms. Allocated memory was 165.7MB in the beginning and 260.0MB in the end (delta: 94.4MB). Free memory was 139.5MB in the beginning and 94.8MB in the end (delta: 44.6MB). Peak memory consumption was 140.1MB. Max. memory is 8.0GB. [2022-10-15 16:57:32,489 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 165.7MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:57:32,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.90ms. Allocated memory is still 165.7MB. Free memory was 139.3MB in the beginning and 128.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-15 16:57:32,489 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.40ms. Allocated memory is still 165.7MB. Free memory was 128.4MB in the beginning and 126.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:57:32,490 INFO L158 Benchmark]: Boogie Preprocessor took 68.82ms. Allocated memory is still 165.7MB. Free memory was 126.6MB in the beginning and 125.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 16:57:32,490 INFO L158 Benchmark]: RCFGBuilder took 678.50ms. Allocated memory is still 165.7MB. Free memory was 125.0MB in the beginning and 108.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-10-15 16:57:32,491 INFO L158 Benchmark]: TraceAbstraction took 10505.11ms. Allocated memory was 165.7MB in the beginning and 260.0MB in the end (delta: 94.4MB). Free memory was 108.3MB in the beginning and 94.8MB in the end (delta: 13.4MB). Peak memory consumption was 108.6MB. Max. memory is 8.0GB. [2022-10-15 16:57:32,497 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.21ms. Allocated memory is still 165.7MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 278.90ms. Allocated memory is still 165.7MB. Free memory was 139.3MB in the beginning and 128.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.40ms. Allocated memory is still 165.7MB. Free memory was 128.4MB in the beginning and 126.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.82ms. Allocated memory is still 165.7MB. Free memory was 126.6MB in the beginning and 125.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 678.50ms. Allocated memory is still 165.7MB. Free memory was 125.0MB in the beginning and 108.9MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 10505.11ms. Allocated memory was 165.7MB in the beginning and 260.0MB in the end (delta: 94.4MB). Free memory was 108.3MB in the beginning and 94.8MB in the end (delta: 13.4MB). Peak memory consumption was 108.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled * 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: 135]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 135. Possible FailurePath: [L41] struct slot *tmp_slot; [L42] int used_tmp_slot = 0; [L43] int freed_tmp_slot = 1; VAL [freed_tmp_slot=1, tmp_slot={0:0}, used_tmp_slot=0] [L136] CALL ebda_rsrc_controller() [L73] struct hotplug_slot *hp_slot_ptr; [L75] struct bus_info *bus_info_ptr1; [L76] int rc; VAL [freed_tmp_slot=1, tmp_slot={0:0}, used_tmp_slot=0] [L78] CALL, EXPR kzalloc(sizeof(*hp_slot_ptr), 1) VAL [freed_tmp_slot=1, tmp_slot={0:0}, used_tmp_slot=0] [L48] EXPR, FCALL calloc(1, size) [L48] return calloc(1, size); VAL [\old(flags)=1, \old(size)=8, \result={-1:0}, calloc(1, size)={-1:0}, flags=1, freed_tmp_slot=1, size=8, tmp_slot={0:0}, used_tmp_slot=0] [L78] RET, EXPR kzalloc(sizeof(*hp_slot_ptr), 1) VAL [freed_tmp_slot=1, kzalloc(sizeof(*hp_slot_ptr), 1)={-1:0}, tmp_slot={0:0}, used_tmp_slot=0] [L78] hp_slot_ptr = kzalloc(sizeof(*hp_slot_ptr), 1) [L79] COND FALSE !(!hp_slot_ptr) VAL [freed_tmp_slot=1, hp_slot_ptr={-1:0}, tmp_slot={0:0}, used_tmp_slot=0] [L83] hp_slot_ptr->b = 5 VAL [freed_tmp_slot=1, hp_slot_ptr={-1:0}, tmp_slot={0:0}, used_tmp_slot=0] [L85] CALL, EXPR kzalloc(sizeof(*tmp_slot), 1) VAL [freed_tmp_slot=1, tmp_slot={0:0}, used_tmp_slot=0] [L48] EXPR, FCALL calloc(1, size) [L48] return calloc(1, size); VAL [\old(flags)=1, \old(size)=16, \result={-2:0}, calloc(1, size)={-2:0}, flags=1, freed_tmp_slot=1, size=16, tmp_slot={0:0}, used_tmp_slot=0] [L85] RET, EXPR kzalloc(sizeof(*tmp_slot), 1) VAL [freed_tmp_slot=1, hp_slot_ptr={-1:0}, kzalloc(sizeof(*tmp_slot), 1)={-2:0}, tmp_slot={0:0}, used_tmp_slot=0] [L85] tmp_slot = kzalloc(sizeof(*tmp_slot), 1) [L87] COND FALSE !(!tmp_slot) [L92] used_tmp_slot = 0 [L93] freed_tmp_slot = 0 VAL [freed_tmp_slot=0, hp_slot_ptr={-1:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L95] tmp_slot->a = 2 VAL [freed_tmp_slot=0, hp_slot_ptr={-1:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L96] tmp_slot->b = 3 VAL [freed_tmp_slot=0, hp_slot_ptr={-1:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L98] CALL, EXPR ibmphp_find_same_bus_num() [L57] CALL, EXPR kzalloc(sizeof(struct bus_info), 0) VAL [freed_tmp_slot=0, tmp_slot={-2:0}, used_tmp_slot=0] [L48] EXPR, FCALL calloc(1, size) [L48] return calloc(1, size); VAL [\old(flags)=0, \old(size)=0, \result={-3:0}, calloc(1, size)={-3:0}, flags=0, freed_tmp_slot=0, size=0, tmp_slot={-2:0}, used_tmp_slot=0] [L57] RET, EXPR kzalloc(sizeof(struct bus_info), 0) VAL [freed_tmp_slot=0, kzalloc(sizeof(struct bus_info), 0)={-3:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L57] return kzalloc(sizeof(struct bus_info), 0); [L98] RET, EXPR ibmphp_find_same_bus_num() [L98] bus_info_ptr1 = ibmphp_find_same_bus_num() [L99] COND FALSE !(!bus_info_ptr1) VAL [bus_info_ptr1={-3:0}, freed_tmp_slot=0, hp_slot_ptr={-1:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L108] tmp_slot->bus_on = bus_info_ptr1 VAL [bus_info_ptr1={-3:0}, freed_tmp_slot=0, hp_slot_ptr={-1:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L109] bus_info_ptr1 = 0 VAL [bus_info_ptr1={0:0}, freed_tmp_slot=0, hp_slot_ptr={-1:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L111] tmp_slot->hotplug_slot = hp_slot_ptr VAL [bus_info_ptr1={0:0}, freed_tmp_slot=0, hp_slot_ptr={-1:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L113] hp_slot_ptr->private = tmp_slot VAL [bus_info_ptr1={0:0}, freed_tmp_slot=0, hp_slot_ptr={-1:0}, tmp_slot={-2:0}, used_tmp_slot=0] [L114] used_tmp_slot = 1 [L116] CALL, EXPR fillslotinfo(hp_slot_ptr) [L64] return __VERIFIER_nondet_int(); [L116] RET, EXPR fillslotinfo(hp_slot_ptr) [L116] rc = fillslotinfo(hp_slot_ptr) [L117] COND FALSE !(\read(rc)) [L120] CALL, EXPR ibmphp_init_devno((struct slot **) &hp_slot_ptr->private) [L69] return __VERIFIER_nondet_int(); [L120] RET, EXPR ibmphp_init_devno((struct slot **) &hp_slot_ptr->private) [L120] rc = ibmphp_init_devno((struct slot **) &hp_slot_ptr->private) [L121] COND FALSE !(\read(rc)) [L124] return 0; VAL [\result=0, bus_info_ptr1={0:0}, freed_tmp_slot=0, hp_slot_ptr={-1:0}, rc=0, tmp_slot={-2:0}, used_tmp_slot=1] [L136] RET ebda_rsrc_controller() [L137] COND FALSE !(!used_tmp_slot) VAL [freed_tmp_slot=0, tmp_slot={-2:0}, used_tmp_slot=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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 2 procedures, 58 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 422 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 419 mSDsluCounter, 1990 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 47 IncrementalHoareTripleChecker+Unchecked, 1582 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1173 IncrementalHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 408 mSDtfsCounter, 1173 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, InterpolantAutomatonStates: 84, 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, 10 MinimizatonAttempts, 25 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 292 ConstructedInterpolants, 20 QuantifiedInterpolants, 2286 SizeOfPredicates, 14 NumberOfNonLiveVariables, 816 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 60/96 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:57:32,524 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...