/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/float-benchs/interpolation.c.p+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 01:14:05,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 01:14:05,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 01:14:05,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 01:14:05,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 01:14:05,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 01:14:05,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 01:14:05,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 01:14:05,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 01:14:05,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 01:14:05,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 01:14:05,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 01:14:05,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 01:14:05,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 01:14:05,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 01:14:05,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 01:14:05,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 01:14:05,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 01:14:05,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 01:14:05,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 01:14:05,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 01:14:05,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 01:14:05,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 01:14:05,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 01:14:05,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 01:14:05,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 01:14:05,487 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 01:14:05,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 01:14:05,488 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 01:14:05,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 01:14:05,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 01:14:05,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 01:14:05,491 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 01:14:05,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 01:14:05,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 01:14:05,494 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 01:14:05,495 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 01:14:05,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 01:14:05,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 01:14:05,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 01:14:05,497 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 01:14:05,498 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-16 01:14:05,526 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 01:14:05,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 01:14:05,527 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 01:14:05,527 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 01:14:05,528 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 01:14:05,528 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 01:14:05,529 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 01:14:05,529 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 01:14:05,529 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 01:14:05,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 01:14:05,530 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 01:14:05,530 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 01:14:05,530 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 01:14:05,531 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 01:14:05,531 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 01:14:05,531 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-16 01:14:05,531 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-16 01:14:05,532 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-16 01:14:05,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 01:14:05,532 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-16 01:14:05,532 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 01:14:05,533 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 01:14:05,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 01:14:05,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 01:14:05,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 01:14:05,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 01:14:05,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 01:14:05,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 01:14:05,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 01:14:05,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 01:14:05,535 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-16 01:14:05,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 01:14:05,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 01:14:05,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 01:14:05,913 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 01:14:05,914 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 01:14:05,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2022-10-16 01:14:05,993 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e6f6335/11d0e07bb6814f818faa9c8158e1992c/FLAG18ec5099c [2022-10-16 01:14:06,562 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 01:14:06,563 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2022-10-16 01:14:06,569 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e6f6335/11d0e07bb6814f818faa9c8158e1992c/FLAG18ec5099c [2022-10-16 01:14:06,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e6f6335/11d0e07bb6814f818faa9c8158e1992c [2022-10-16 01:14:06,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 01:14:06,953 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 01:14:06,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 01:14:06,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 01:14:06,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 01:14:06,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:14:06" (1/1) ... [2022-10-16 01:14:06,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c3092e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:06, skipping insertion in model container [2022-10-16 01:14:06,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:14:06" (1/1) ... [2022-10-16 01:14:06,981 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 01:14:07,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 01:14:07,176 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/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2022-10-16 01:14:07,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 01:14:07,200 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 01:14:07,223 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/float-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2022-10-16 01:14:07,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 01:14:07,244 INFO L208 MainTranslator]: Completed translation [2022-10-16 01:14:07,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:07 WrapperNode [2022-10-16 01:14:07,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 01:14:07,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 01:14:07,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 01:14:07,246 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 01:14:07,255 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:07" (1/1) ... [2022-10-16 01:14:07,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:07" (1/1) ... [2022-10-16 01:14:07,289 INFO L138 Inliner]: procedures = 18, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 99 [2022-10-16 01:14:07,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 01:14:07,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 01:14:07,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 01:14:07,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 01:14:07,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:07" (1/1) ... [2022-10-16 01:14:07,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:07" (1/1) ... [2022-10-16 01:14:07,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:07" (1/1) ... [2022-10-16 01:14:07,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:07" (1/1) ... [2022-10-16 01:14:07,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:07" (1/1) ... [2022-10-16 01:14:07,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:07" (1/1) ... [2022-10-16 01:14:07,317 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:07" (1/1) ... [2022-10-16 01:14:07,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:07" (1/1) ... [2022-10-16 01:14:07,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 01:14:07,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 01:14:07,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 01:14:07,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 01:14:07,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:07" (1/1) ... [2022-10-16 01:14:07,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 01:14:07,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:14:07,359 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-16 01:14:07,366 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-16 01:14:07,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 01:14:07,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 01:14:07,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 01:14:07,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-16 01:14:07,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 01:14:07,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 01:14:07,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-16 01:14:07,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 01:14:07,574 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 01:14:07,577 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 01:14:07,947 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 01:14:07,955 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 01:14:07,955 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-16 01:14:07,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:14:07 BoogieIcfgContainer [2022-10-16 01:14:07,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 01:14:07,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 01:14:07,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 01:14:07,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 01:14:07,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:14:06" (1/3) ... [2022-10-16 01:14:07,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4a4b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:14:07, skipping insertion in model container [2022-10-16 01:14:07,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:14:07" (2/3) ... [2022-10-16 01:14:07,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4a4b19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:14:07, skipping insertion in model container [2022-10-16 01:14:07,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:14:07" (3/3) ... [2022-10-16 01:14:07,979 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation.c.p+cfa-reducer.c [2022-10-16 01:14:08,026 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 01:14:08,026 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-10-16 01:14:08,149 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 01:14:08,165 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;@2298df26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 01:14:08,165 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-10-16 01:14:08,170 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:08,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-16 01:14:08,184 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:14:08,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-16 01:14:08,185 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:14:08,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:14:08,192 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-10-16 01:14:08,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:14:08,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975976734] [2022-10-16 01:14:08,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:14:08,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:14:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:14:08,497 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-16 01:14:08,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:14:08,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975976734] [2022-10-16 01:14:08,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975976734] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:14:08,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:14:08,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:14:08,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721872355] [2022-10-16 01:14:08,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:14:08,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:14:08,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:14:08,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:14:08,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:14:08,559 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:08,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:14:08,656 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-10-16 01:14:08,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:14:08,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-10-16 01:14:08,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:14:08,668 INFO L225 Difference]: With dead ends: 35 [2022-10-16 01:14:08,669 INFO L226 Difference]: Without dead ends: 33 [2022-10-16 01:14:08,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:14:08,678 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 34 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:14:08,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 28 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:14:08,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-10-16 01:14:08,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-10-16 01:14:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:08,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-10-16 01:14:08,718 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 3 [2022-10-16 01:14:08,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:14:08,718 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-10-16 01:14:08,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:08,719 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-10-16 01:14:08,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-10-16 01:14:08,719 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:14:08,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-10-16 01:14:08,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 01:14:08,720 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:14:08,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:14:08,721 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-10-16 01:14:08,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:14:08,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563057369] [2022-10-16 01:14:08,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:14:08,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:14:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:14:08,918 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-16 01:14:08,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:14:08,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563057369] [2022-10-16 01:14:08,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563057369] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:14:08,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:14:08,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:14:08,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659757409] [2022-10-16 01:14:08,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:14:08,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:14:08,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:14:08,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:14:08,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:14:08,923 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:08,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:14:08,951 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-10-16 01:14:08,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:14:08,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-10-16 01:14:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:14:08,952 INFO L225 Difference]: With dead ends: 32 [2022-10-16 01:14:08,953 INFO L226 Difference]: Without dead ends: 32 [2022-10-16 01:14:08,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:14:08,955 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:14:08,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 26 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:14:08,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-10-16 01:14:08,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-10-16 01:14:08,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:08,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-10-16 01:14:08,966 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 3 [2022-10-16 01:14:08,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:14:08,967 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-10-16 01:14:08,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:08,967 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-10-16 01:14:08,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-16 01:14:08,968 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:14:08,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-16 01:14:08,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 01:14:08,968 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:14:08,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:14:08,971 INFO L85 PathProgramCache]: Analyzing trace with hash 28691874, now seen corresponding path program 1 times [2022-10-16 01:14:08,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:14:08,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52833199] [2022-10-16 01:14:08,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:14:08,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:14:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:14:09,072 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-16 01:14:09,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:14:09,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52833199] [2022-10-16 01:14:09,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52833199] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:14:09,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:14:09,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:14:09,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189510791] [2022-10-16 01:14:09,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:14:09,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:14:09,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:14:09,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:14:09,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:14:09,076 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:09,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:14:09,101 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-10-16 01:14:09,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:14:09,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-16 01:14:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:14:09,102 INFO L225 Difference]: With dead ends: 29 [2022-10-16 01:14:09,103 INFO L226 Difference]: Without dead ends: 29 [2022-10-16 01:14:09,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:14:09,105 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:14:09,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 24 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:14:09,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-10-16 01:14:09,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-10-16 01:14:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-10-16 01:14:09,111 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 5 [2022-10-16 01:14:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:14:09,111 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-10-16 01:14:09,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-10-16 01:14:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-16 01:14:09,112 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:14:09,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-16 01:14:09,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 01:14:09,113 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:14:09,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:14:09,116 INFO L85 PathProgramCache]: Analyzing trace with hash 28691875, now seen corresponding path program 1 times [2022-10-16 01:14:09,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:14:09,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367304045] [2022-10-16 01:14:09,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:14:09,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:14:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:14:09,246 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-16 01:14:09,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:14:09,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367304045] [2022-10-16 01:14:09,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367304045] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:14:09,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:14:09,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 01:14:09,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040727074] [2022-10-16 01:14:09,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:14:09,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:14:09,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:14:09,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:14:09,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:14:09,249 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:09,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:14:09,287 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-10-16 01:14:09,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:14:09,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-16 01:14:09,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:14:09,289 INFO L225 Difference]: With dead ends: 28 [2022-10-16 01:14:09,290 INFO L226 Difference]: Without dead ends: 28 [2022-10-16 01:14:09,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:14:09,298 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:14:09,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 23 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:14:09,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-10-16 01:14:09,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-10-16 01:14:09,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-10-16 01:14:09,312 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 5 [2022-10-16 01:14:09,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:14:09,312 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-10-16 01:14:09,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:09,313 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-10-16 01:14:09,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 01:14:09,315 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:14:09,316 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:14:09,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 01:14:09,316 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:14:09,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:14:09,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1805053542, now seen corresponding path program 1 times [2022-10-16 01:14:09,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:14:09,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135521056] [2022-10-16 01:14:09,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:14:09,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:14:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:14:09,470 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-16 01:14:09,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:14:09,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135521056] [2022-10-16 01:14:09,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135521056] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:14:09,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:14:09,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 01:14:09,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670390823] [2022-10-16 01:14:09,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:14:09,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 01:14:09,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:14:09,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 01:14:09,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 01:14:09,474 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:09,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:14:09,510 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-10-16 01:14:09,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 01:14:09,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-16 01:14:09,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:14:09,512 INFO L225 Difference]: With dead ends: 27 [2022-10-16 01:14:09,512 INFO L226 Difference]: Without dead ends: 26 [2022-10-16 01:14:09,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 01:14:09,514 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 26 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:14:09,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 40 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:14:09,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-10-16 01:14:09,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-10-16 01:14:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:09,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-10-16 01:14:09,522 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 7 [2022-10-16 01:14:09,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:14:09,522 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-10-16 01:14:09,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:09,523 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-10-16 01:14:09,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-10-16 01:14:09,523 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:14:09,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:14:09,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 01:14:09,527 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:14:09,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:14:09,528 INFO L85 PathProgramCache]: Analyzing trace with hash 122038548, now seen corresponding path program 1 times [2022-10-16 01:14:09,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:14:09,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420503871] [2022-10-16 01:14:09,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:14:09,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:14:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:14:09,555 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-16 01:14:09,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:14:09,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420503871] [2022-10-16 01:14:09,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420503871] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:14:09,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:14:09,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 01:14:09,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12057249] [2022-10-16 01:14:09,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:14:09,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 01:14:09,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:14:09,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 01:14:09,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:14:09,559 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:09,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:14:09,566 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-10-16 01:14:09,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 01:14:09,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-10-16 01:14:09,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:14:09,567 INFO L225 Difference]: With dead ends: 27 [2022-10-16 01:14:09,568 INFO L226 Difference]: Without dead ends: 25 [2022-10-16 01:14:09,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 01:14:09,569 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:14:09,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:14:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-10-16 01:14:09,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-10-16 01:14:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-10-16 01:14:09,574 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 8 [2022-10-16 01:14:09,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:14:09,575 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-10-16 01:14:09,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-10-16 01:14:09,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 01:14:09,576 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:14:09,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:14:09,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 01:14:09,577 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:14:09,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:14:09,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1894432197, now seen corresponding path program 1 times [2022-10-16 01:14:09,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:14:09,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506990036] [2022-10-16 01:14:09,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:14:09,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:14:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:14:09,666 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-16 01:14:09,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:14:09,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506990036] [2022-10-16 01:14:09,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506990036] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:14:09,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:14:09,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 01:14:09,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283904340] [2022-10-16 01:14:09,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:14:09,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 01:14:09,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:14:09,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 01:14:09,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 01:14:09,670 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:09,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:14:09,748 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2022-10-16 01:14:09,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 01:14:09,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-16 01:14:09,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:14:09,750 INFO L225 Difference]: With dead ends: 41 [2022-10-16 01:14:09,750 INFO L226 Difference]: Without dead ends: 41 [2022-10-16 01:14:09,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 01:14:09,752 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 60 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:14:09,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 29 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:14:09,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-10-16 01:14:09,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2022-10-16 01:14:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-10-16 01:14:09,758 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 9 [2022-10-16 01:14:09,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:14:09,759 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-10-16 01:14:09,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-10-16 01:14:09,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-10-16 01:14:09,760 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:14:09,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:14:09,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 01:14:09,760 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:14:09,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:14:09,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1894430888, now seen corresponding path program 1 times [2022-10-16 01:14:09,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:14:09,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067868140] [2022-10-16 01:14:09,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:14:09,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:14:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:14:09,845 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-16 01:14:09,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:14:09,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067868140] [2022-10-16 01:14:09,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067868140] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:14:09,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:14:09,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 01:14:09,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709237131] [2022-10-16 01:14:09,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:14:09,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 01:14:09,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:14:09,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 01:14:09,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 01:14:09,849 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:09,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:14:09,896 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-10-16 01:14:09,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 01:14:09,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-10-16 01:14:09,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:14:09,898 INFO L225 Difference]: With dead ends: 39 [2022-10-16 01:14:09,898 INFO L226 Difference]: Without dead ends: 39 [2022-10-16 01:14:09,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 01:14:09,900 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 64 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:14:09,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 29 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:14:09,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-10-16 01:14:09,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2022-10-16 01:14:09,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:09,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-10-16 01:14:09,905 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 9 [2022-10-16 01:14:09,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:14:09,905 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-10-16 01:14:09,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:09,906 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-10-16 01:14:09,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 01:14:09,906 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:14:09,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:14:09,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 01:14:09,907 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:14:09,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:14:09,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1120316984, now seen corresponding path program 1 times [2022-10-16 01:14:09,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:14:09,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032640875] [2022-10-16 01:14:09,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:14:09,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:14:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:14:09,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:14:09,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:14:09,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032640875] [2022-10-16 01:14:09,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032640875] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 01:14:09,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42754335] [2022-10-16 01:14:09,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:14:09,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 01:14:09,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:14:09,997 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-16 01:14:10,021 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-16 01:14:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:14:10,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 13 conjunts are in the unsatisfiable core [2022-10-16 01:14:10,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 01:14:10,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-10-16 01:14:10,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-10-16 01:14:10,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-10-16 01:14:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:14:10,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 01:14:10,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:14:10,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42754335] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 01:14:10,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 01:14:10,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-10-16 01:14:10,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246073022] [2022-10-16 01:14:10,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 01:14:10,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-10-16 01:14:10,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:14:10,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-10-16 01:14:10,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-10-16 01:14:10,379 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:10,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:14:10,543 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2022-10-16 01:14:10,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 01:14:10,543 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-16 01:14:10,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:14:10,544 INFO L225 Difference]: With dead ends: 75 [2022-10-16 01:14:10,544 INFO L226 Difference]: Without dead ends: 75 [2022-10-16 01:14:10,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-10-16 01:14:10,546 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 260 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:14:10,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 78 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:14:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-10-16 01:14:10,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 39. [2022-10-16 01:14:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.457142857142857) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:10,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-10-16 01:14:10,551 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 12 [2022-10-16 01:14:10,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:14:10,552 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-10-16 01:14:10,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:10,552 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-10-16 01:14:10,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-16 01:14:10,553 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:14:10,553 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:14:10,592 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-16 01:14:10,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 01:14:10,767 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:14:10,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:14:10,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1120315675, now seen corresponding path program 1 times [2022-10-16 01:14:10,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:14:10,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938470992] [2022-10-16 01:14:10,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:14:10,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:14:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:14:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:14:10,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:14:10,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938470992] [2022-10-16 01:14:10,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938470992] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 01:14:10,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820791096] [2022-10-16 01:14:10,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:14:10,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 01:14:10,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 01:14:10,879 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-16 01:14:10,887 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-16 01:14:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:14:10,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2022-10-16 01:14:10,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 01:14:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:14:11,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 01:14:11,131 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 8 treesize of output 6 [2022-10-16 01:14:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 01:14:11,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820791096] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 01:14:11,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 01:14:11,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2022-10-16 01:14:11,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134727205] [2022-10-16 01:14:11,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 01:14:11,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-16 01:14:11,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:14:11,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-16 01:14:11,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2022-10-16 01:14:11,146 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:11,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:14:11,265 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-10-16 01:14:11,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 01:14:11,266 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-16 01:14:11,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:14:11,267 INFO L225 Difference]: With dead ends: 73 [2022-10-16 01:14:11,267 INFO L226 Difference]: Without dead ends: 73 [2022-10-16 01:14:11,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2022-10-16 01:14:11,268 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 267 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 01:14:11,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 61 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 01:14:11,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-10-16 01:14:11,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 39. [2022-10-16 01:14:11,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:11,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-10-16 01:14:11,273 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 12 [2022-10-16 01:14:11,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:14:11,274 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-10-16 01:14:11,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:11,274 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-10-16 01:14:11,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 01:14:11,275 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:14:11,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:14:11,318 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-16 01:14:11,488 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,SelfDestructingSolverStorable9 [2022-10-16 01:14:11,489 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:14:11,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:14:11,490 INFO L85 PathProgramCache]: Analyzing trace with hash -224975023, now seen corresponding path program 1 times [2022-10-16 01:14:11,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:14:11,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779931316] [2022-10-16 01:14:11,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:14:11,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:14:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 01:14:11,550 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-16 01:14:11,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 01:14:11,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779931316] [2022-10-16 01:14:11,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779931316] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 01:14:11,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 01:14:11,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 01:14:11,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457484356] [2022-10-16 01:14:11,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 01:14:11,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 01:14:11,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 01:14:11,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 01:14:11,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 01:14:11,553 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:11,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 01:14:11,575 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-10-16 01:14:11,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 01:14:11,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-16 01:14:11,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 01:14:11,577 INFO L225 Difference]: With dead ends: 41 [2022-10-16 01:14:11,577 INFO L226 Difference]: Without dead ends: 39 [2022-10-16 01:14:11,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-10-16 01:14:11,579 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 23 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 01:14:11,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 73 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 01:14:11,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-10-16 01:14:11,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-10-16 01:14:11,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 38 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-10-16 01:14:11,583 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 19 [2022-10-16 01:14:11,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 01:14:11,584 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-10-16 01:14:11,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 01:14:11,584 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-10-16 01:14:11,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-16 01:14:11,585 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 01:14:11,585 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:14:11,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 01:14:11,586 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2022-10-16 01:14:11,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 01:14:11,586 INFO L85 PathProgramCache]: Analyzing trace with hash -207964362, now seen corresponding path program 1 times [2022-10-16 01:14:11,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 01:14:11,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338787985] [2022-10-16 01:14:11,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 01:14:11,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 01:14:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 01:14:11,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 01:14:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 01:14:11,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 01:14:11,630 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 01:14:11,631 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (13 of 14 remaining) [2022-10-16 01:14:11,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2022-10-16 01:14:11,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2022-10-16 01:14:11,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2022-10-16 01:14:11,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2022-10-16 01:14:11,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2022-10-16 01:14:11,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2022-10-16 01:14:11,634 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2022-10-16 01:14:11,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2022-10-16 01:14:11,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2022-10-16 01:14:11,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2022-10-16 01:14:11,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2022-10-16 01:14:11,635 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2022-10-16 01:14:11,636 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2022-10-16 01:14:11,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 01:14:11,640 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 01:14:11,644 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 01:14:11,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:14:11 BoogieIcfgContainer [2022-10-16 01:14:11,677 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 01:14:11,678 INFO L158 Benchmark]: Toolchain (without parser) took 4728.56ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 126.3MB in the beginning and 133.0MB in the end (delta: -6.8MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-10-16 01:14:11,678 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 151.0MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 01:14:11,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.51ms. Allocated memory is still 151.0MB. Free memory was 126.0MB in the beginning and 115.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-16 01:14:11,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.27ms. Allocated memory is still 151.0MB. Free memory was 115.5MB in the beginning and 113.8MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-16 01:14:11,679 INFO L158 Benchmark]: Boogie Preprocessor took 30.59ms. Allocated memory is still 151.0MB. Free memory was 113.8MB in the beginning and 112.6MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-16 01:14:11,680 INFO L158 Benchmark]: RCFGBuilder took 636.26ms. Allocated memory is still 151.0MB. Free memory was 112.4MB in the beginning and 99.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-16 01:14:11,680 INFO L158 Benchmark]: TraceAbstraction took 3716.09ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 98.7MB in the beginning and 133.0MB in the end (delta: -34.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-10-16 01:14:11,682 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.23ms. Allocated memory is still 151.0MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 289.51ms. Allocated memory is still 151.0MB. Free memory was 126.0MB in the beginning and 115.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.27ms. Allocated memory is still 151.0MB. Free memory was 115.5MB in the beginning and 113.8MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.59ms. Allocated memory is still 151.0MB. Free memory was 113.8MB in the beginning and 112.6MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 636.26ms. Allocated memory is still 151.0MB. Free memory was 112.4MB in the beginning and 99.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3716.09ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 98.7MB in the beginning and 133.0MB in the end (delta: -34.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 51]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryFLOATComparisonOperation at line 33, overapproximation of memtrack at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of to_real at line 17, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L14] int main__i; [L15] float main__z; [L16] float main__t; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] main__t = __VERIFIER_nondet_float() [L20] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__max={5:0}, main__min={4:0}] [L21] EXPR main__min[0] VAL [__return_main=0, main__max={5:0}, main__min={4:0}, main__min[0]=57] [L21] COND TRUE main__t >= (main__min[0]) [L23] EXPR main__max[4UL] VAL [__return_main=0, main__max={5:0}, main__max[4UL]=56, main__min={4:0}] [L23] COND TRUE main__t <= (main__max[4UL]) [L25] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__max={5:0}, main__min={4:0}] [L27] COND TRUE main____CPAchecker_TMP_0 != 0 [L29] main__i = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}] [L31] COND TRUE main__i < 5UL VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}] [L33] EXPR main__max[main__i] VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__max[main__i]=55, main__min={4:0}] [L33] COND TRUE main__t <= (main__max[main__i]) [L36] EXPR main__min[main__i] VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}, main__min[main__i]=57] [L36] EXPR main__max[main__i] VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__max[main__i]=55, main__min={4:0}, main__min[main__i]=57] [L36] EXPR main__min[main__i] VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__max[main__i]=55, main__min={4:0}, main__min[main__i]=57, main__min[main__i]=57] [L36] main__z = (main__t - (main__min[main__i])) / ((main__max[main__i]) - (main__min[main__i])) [L37] int main____CPAchecker_TMP_1; VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}] [L38] COND FALSE !(main__z >= 0.0) VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}] [L63] main____CPAchecker_TMP_1 = 0 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] [L45] int __tmp_1; [L46] __tmp_1 = main____CPAchecker_TMP_1 [L47] int __VERIFIER_assert__cond; [L48] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] [L49] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] [L51] reach_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 11]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 822 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 822 mSDsluCounter, 469 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 211 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 304 IncrementalHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 258 mSDtfsCounter, 304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=9, InterpolantAutomatonStates: 46, 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, 11 MinimizatonAttempts, 88 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 933 SizeOfPredicates, 5 NumberOfNonLiveVariables, 166 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 0/9 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-16 01:14:11,731 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...