/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-newlib/double_req_bl_1032d.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:44:14,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:44:14,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:44:14,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:44:14,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:44:14,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:44:14,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:44:14,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:44:14,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:44:14,149 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:44:14,150 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:44:14,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:44:14,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:44:14,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:44:14,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:44:14,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:44:14,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:44:14,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:44:14,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:44:14,164 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:44:14,166 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:44:14,168 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:44:14,169 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:44:14,170 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:44:14,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:44:14,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:44:14,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:44:14,179 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:44:14,179 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:44:14,180 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:44:14,181 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:44:14,182 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:44:14,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:44:14,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:44:14,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:44:14,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:44:14,187 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:44:14,187 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:44:14,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:44:14,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:44:14,190 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:44:14,191 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 16:44:14,223 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:44:14,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:44:14,229 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:44:14,230 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:44:14,231 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:44:14,231 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:44:14,232 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:44:14,232 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:44:14,232 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:44:14,233 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:44:14,233 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:44:14,233 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:44:14,233 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:44:14,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:44:14,234 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:44:14,234 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:44:14,234 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:44:14,235 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:44:14,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:44:14,235 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:44:14,235 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:44:14,235 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:44:14,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:44:14,236 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:44:14,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:44:14,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:44:14,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:44:14,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:44:14,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:44:14,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:44:14,238 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 16:44:14,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:44:14,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:44:14,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:44:14,643 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:44:14,644 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:44:14,645 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1032d.c [2022-10-15 16:44:14,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaadc08ae/9d9723c6658a4216a85af2443be515f2/FLAG3a00f075c [2022-10-15 16:44:15,435 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:44:15,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1032d.c [2022-10-15 16:44:15,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaadc08ae/9d9723c6658a4216a85af2443be515f2/FLAG3a00f075c [2022-10-15 16:44:15,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaadc08ae/9d9723c6658a4216a85af2443be515f2 [2022-10-15 16:44:15,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:44:15,479 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:44:15,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:44:15,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:44:15,485 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:44:15,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:44:15" (1/1) ... [2022-10-15 16:44:15,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e69ee2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:15, skipping insertion in model container [2022-10-15 16:44:15,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:44:15" (1/1) ... [2022-10-15 16:44:15,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:44:15,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:44:15,796 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-newlib/double_req_bl_1032d.c[2356,2369] [2022-10-15 16:44:15,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:44:15,819 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:44:15,902 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-newlib/double_req_bl_1032d.c[2356,2369] [2022-10-15 16:44:15,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:44:15,955 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:44:15,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:15 WrapperNode [2022-10-15 16:44:15,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:44:15,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:44:15,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:44:15,957 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:44:15,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:15" (1/1) ... [2022-10-15 16:44:16,004 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:15" (1/1) ... [2022-10-15 16:44:16,096 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 108 [2022-10-15 16:44:16,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:44:16,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:44:16,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:44:16,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:44:16,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:15" (1/1) ... [2022-10-15 16:44:16,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:15" (1/1) ... [2022-10-15 16:44:16,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:15" (1/1) ... [2022-10-15 16:44:16,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:15" (1/1) ... [2022-10-15 16:44:16,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:15" (1/1) ... [2022-10-15 16:44:16,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:15" (1/1) ... [2022-10-15 16:44:16,181 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:15" (1/1) ... [2022-10-15 16:44:16,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:15" (1/1) ... [2022-10-15 16:44:16,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:44:16,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:44:16,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:44:16,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:44:16,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:15" (1/1) ... [2022-10-15 16:44:16,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:44:16,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:44:16,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 16:44:16,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 16:44:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:44:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:44:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:44:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:44:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:44:16,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:44:16,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:44:16,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:44:16,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:44:16,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:44:16,455 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:44:16,458 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:44:17,156 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:44:17,167 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:44:17,167 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-10-15 16:44:17,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:44:17 BoogieIcfgContainer [2022-10-15 16:44:17,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:44:17,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:44:17,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:44:17,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:44:17,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:44:15" (1/3) ... [2022-10-15 16:44:17,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162f3fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:44:17, skipping insertion in model container [2022-10-15 16:44:17,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:15" (2/3) ... [2022-10-15 16:44:17,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162f3fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:44:17, skipping insertion in model container [2022-10-15 16:44:17,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:44:17" (3/3) ... [2022-10-15 16:44:17,187 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1032d.c [2022-10-15 16:44:17,213 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:44:17,213 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-10-15 16:44:17,295 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:44:17,310 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;@5373215c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:44:17,310 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-10-15 16:44:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 41 states have (on average 1.853658536585366) internal successors, (76), 61 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:17,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:44:17,339 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:17,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:44:17,341 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 16:44:17,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:17,349 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-10-15 16:44:17,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:17,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132298976] [2022-10-15 16:44:17,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:17,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:17,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:17,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:17,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132298976] [2022-10-15 16:44:17,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132298976] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:17,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:17,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:17,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601240901] [2022-10-15 16:44:17,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:17,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:17,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:17,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:17,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:17,636 INFO L87 Difference]: Start difference. First operand has 62 states, 41 states have (on average 1.853658536585366) internal successors, (76), 61 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:17,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:17,710 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-10-15 16:44:17,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:17,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:44:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:17,724 INFO L225 Difference]: With dead ends: 59 [2022-10-15 16:44:17,724 INFO L226 Difference]: Without dead ends: 57 [2022-10-15 16:44:17,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:17,731 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:17,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 96 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:44:17,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-10-15 16:44:17,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-10-15 16:44:17,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.6) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:17,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-10-15 16:44:17,777 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 4 [2022-10-15 16:44:17,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:17,778 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-10-15 16:44:17,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:17,779 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-10-15 16:44:17,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:44:17,779 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:17,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:44:17,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:44:17,780 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 16:44:17,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:17,781 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-10-15 16:44:17,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:17,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685155807] [2022-10-15 16:44:17,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:17,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:17,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:17,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685155807] [2022-10-15 16:44:17,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685155807] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:17,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:17,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:17,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220529344] [2022-10-15 16:44:17,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:17,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:17,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:17,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:17,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:17,948 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:18,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:18,020 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2022-10-15 16:44:18,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:18,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:44:18,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:18,025 INFO L225 Difference]: With dead ends: 54 [2022-10-15 16:44:18,025 INFO L226 Difference]: Without dead ends: 54 [2022-10-15 16:44:18,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:18,030 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 4 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:18,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 96 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:18,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-15 16:44:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-10-15 16:44:18,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.525) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-10-15 16:44:18,051 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 4 [2022-10-15 16:44:18,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:18,052 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-10-15 16:44:18,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:18,053 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-10-15 16:44:18,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 16:44:18,054 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:18,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:18,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:44:18,056 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 16:44:18,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:18,063 INFO L85 PathProgramCache]: Analyzing trace with hash 830718997, now seen corresponding path program 1 times [2022-10-15 16:44:18,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:18,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69328207] [2022-10-15 16:44:18,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:18,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:18,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:18,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69328207] [2022-10-15 16:44:18,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69328207] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:18,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:18,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:18,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403529234] [2022-10-15 16:44:18,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:18,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:18,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:18,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:18,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:18,358 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:18,399 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2022-10-15 16:44:18,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:18,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 16:44:18,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:18,401 INFO L225 Difference]: With dead ends: 51 [2022-10-15 16:44:18,401 INFO L226 Difference]: Without dead ends: 51 [2022-10-15 16:44:18,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:18,403 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:18,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 85 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:44:18,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-10-15 16:44:18,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-10-15 16:44:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.45) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:18,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2022-10-15 16:44:18,412 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 15 [2022-10-15 16:44:18,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:18,412 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2022-10-15 16:44:18,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:18,413 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2022-10-15 16:44:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 16:44:18,414 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:18,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:18,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:44:18,415 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 16:44:18,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:18,415 INFO L85 PathProgramCache]: Analyzing trace with hash 830718998, now seen corresponding path program 1 times [2022-10-15 16:44:18,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:18,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003189475] [2022-10-15 16:44:18,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:18,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:18,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:18,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:18,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003189475] [2022-10-15 16:44:18,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003189475] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:18,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:18,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:18,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634554936] [2022-10-15 16:44:18,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:18,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:18,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:18,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:18,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:18,722 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:18,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:18,785 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-10-15 16:44:18,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:18,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-10-15 16:44:18,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:18,787 INFO L225 Difference]: With dead ends: 48 [2022-10-15 16:44:18,787 INFO L226 Difference]: Without dead ends: 48 [2022-10-15 16:44:18,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:18,792 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 3 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:18,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 88 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:18,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-15 16:44:18,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-10-15 16:44:18,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.375) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-10-15 16:44:18,809 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 15 [2022-10-15 16:44:18,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:18,810 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-10-15 16:44:18,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:18,810 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-10-15 16:44:18,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 16:44:18,811 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:18,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:18,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:44:18,815 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 16:44:18,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:18,816 INFO L85 PathProgramCache]: Analyzing trace with hash 565515997, now seen corresponding path program 1 times [2022-10-15 16:44:18,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:18,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226907655] [2022-10-15 16:44:18,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:18,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:18,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:18,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226907655] [2022-10-15 16:44:18,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226907655] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:18,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:18,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:18,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514988481] [2022-10-15 16:44:18,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:18,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:18,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:18,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:18,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:18,924 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:18,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:18,960 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-10-15 16:44:18,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:18,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-15 16:44:18,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:18,962 INFO L225 Difference]: With dead ends: 45 [2022-10-15 16:44:18,962 INFO L226 Difference]: Without dead ends: 45 [2022-10-15 16:44:18,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:18,964 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:18,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 74 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:44:18,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-10-15 16:44:18,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-10-15 16:44:18,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.3) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:18,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2022-10-15 16:44:18,971 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 16 [2022-10-15 16:44:18,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:18,971 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2022-10-15 16:44:18,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:18,972 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2022-10-15 16:44:18,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 16:44:18,973 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:18,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:18,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:44:18,973 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 16:44:18,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:18,974 INFO L85 PathProgramCache]: Analyzing trace with hash 565515998, now seen corresponding path program 1 times [2022-10-15 16:44:18,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:18,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085035999] [2022-10-15 16:44:18,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:18,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:19,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:19,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085035999] [2022-10-15 16:44:19,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085035999] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:19,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:19,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:19,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469865199] [2022-10-15 16:44:19,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:19,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:19,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:19,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:19,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:19,076 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:19,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:19,105 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-10-15 16:44:19,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:19,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-15 16:44:19,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:19,106 INFO L225 Difference]: With dead ends: 42 [2022-10-15 16:44:19,106 INFO L226 Difference]: Without dead ends: 42 [2022-10-15 16:44:19,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:19,108 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 78 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-15 16:44:19,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 78 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:44:19,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-10-15 16:44:19,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-10-15 16:44:19,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:19,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-10-15 16:44:19,114 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 16 [2022-10-15 16:44:19,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:19,115 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-10-15 16:44:19,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:19,115 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-10-15 16:44:19,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 16:44:19,116 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:19,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:19,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:44:19,117 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 16:44:19,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:19,118 INFO L85 PathProgramCache]: Analyzing trace with hash -188507083, now seen corresponding path program 1 times [2022-10-15 16:44:19,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:19,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038229012] [2022-10-15 16:44:19,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:19,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:19,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:19,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038229012] [2022-10-15 16:44:19,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038229012] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:19,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:19,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:44:19,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116641525] [2022-10-15 16:44:19,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:19,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:44:19,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:19,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:44:19,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:44:19,740 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:19,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:19,799 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-10-15 16:44:19,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:44:19,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-10-15 16:44:19,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:19,801 INFO L225 Difference]: With dead ends: 56 [2022-10-15 16:44:19,801 INFO L226 Difference]: Without dead ends: 55 [2022-10-15 16:44:19,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:44:19,803 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 17 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:19,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 109 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:19,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-10-15 16:44:19,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-10-15 16:44:19,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 52 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2022-10-15 16:44:19,810 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 25 [2022-10-15 16:44:19,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:19,811 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2022-10-15 16:44:19,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:19,811 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2022-10-15 16:44:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-10-15 16:44:19,812 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:19,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:19,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:44:19,813 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2022-10-15 16:44:19,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:19,814 INFO L85 PathProgramCache]: Analyzing trace with hash -188507212, now seen corresponding path program 1 times [2022-10-15 16:44:19,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:19,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901956948] [2022-10-15 16:44:19,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:19,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:44:19,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:44:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:44:20,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:44:20,081 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:44:20,082 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (19 of 20 remaining) [2022-10-15 16:44:20,084 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2022-10-15 16:44:20,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2022-10-15 16:44:20,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2022-10-15 16:44:20,085 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2022-10-15 16:44:20,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2022-10-15 16:44:20,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2022-10-15 16:44:20,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2022-10-15 16:44:20,086 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2022-10-15 16:44:20,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2022-10-15 16:44:20,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2022-10-15 16:44:20,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2022-10-15 16:44:20,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2022-10-15 16:44:20,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2022-10-15 16:44:20,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2022-10-15 16:44:20,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2022-10-15 16:44:20,088 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 20 remaining) [2022-10-15 16:44:20,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 20 remaining) [2022-10-15 16:44:20,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 20 remaining) [2022-10-15 16:44:20,089 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (0 of 20 remaining) [2022-10-15 16:44:20,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:44:20,096 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:20,101 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:44:20,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:44:20 BoogieIcfgContainer [2022-10-15 16:44:20,164 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:44:20,165 INFO L158 Benchmark]: Toolchain (without parser) took 4690.17ms. Allocated memory was 151.0MB in the beginning and 183.5MB in the end (delta: 32.5MB). Free memory was 124.5MB in the beginning and 82.9MB in the end (delta: 41.6MB). Peak memory consumption was 75.0MB. Max. memory is 8.0GB. [2022-10-15 16:44:20,165 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 151.0MB. Free memory was 121.3MB in the beginning and 121.2MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:44:20,166 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.51ms. Allocated memory is still 151.0MB. Free memory was 124.4MB in the beginning and 113.3MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-10-15 16:44:20,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 140.49ms. Allocated memory is still 151.0MB. Free memory was 113.1MB in the beginning and 109.8MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 16:44:20,176 INFO L158 Benchmark]: Boogie Preprocessor took 99.59ms. Allocated memory is still 151.0MB. Free memory was 109.8MB in the beginning and 107.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 16:44:20,177 INFO L158 Benchmark]: RCFGBuilder took 971.90ms. Allocated memory is still 151.0MB. Free memory was 107.2MB in the beginning and 113.4MB in the end (delta: -6.2MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. [2022-10-15 16:44:20,178 INFO L158 Benchmark]: TraceAbstraction took 2987.82ms. Allocated memory was 151.0MB in the beginning and 183.5MB in the end (delta: 32.5MB). Free memory was 112.9MB in the beginning and 82.9MB in the end (delta: 30.0MB). Peak memory consumption was 62.0MB. Max. memory is 8.0GB. [2022-10-15 16:44:20,181 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.27ms. Allocated memory is still 151.0MB. Free memory was 121.3MB in the beginning and 121.2MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 475.51ms. Allocated memory is still 151.0MB. Free memory was 124.4MB in the beginning and 113.3MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 140.49ms. Allocated memory is still 151.0MB. Free memory was 113.1MB in the beginning and 109.8MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 99.59ms. Allocated memory is still 151.0MB. Free memory was 109.8MB in the beginning and 107.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 971.90ms. Allocated memory is still 151.0MB. Free memory was 107.2MB in the beginning and 113.4MB in the end (delta: -6.2MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. * TraceAbstraction took 2987.82ms. Allocated memory was 151.0MB in the beginning and 183.5MB in the end (delta: 32.5MB). Free memory was 112.9MB in the beginning and 82.9MB in the end (delta: 30.0MB). Peak memory consumption was 62.0MB. 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: 93]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of bitwiseOr at line 75, overapproximation of someBinaryArithmeticDOUBLEoperation at line 42, overapproximation of bitwiseAnd at line 74, overapproximation of memtrack at line 93. Possible FailurePath: [L88] double x = -1.0 / 0.0; [L89] CALL, EXPR round_double(x) [L17] __int32_t msw, exponent_less_1023; [L18] __uint32_t lsw; VAL [\old(x)=8589934602, x=8589934602] [L20] ieee_double_shape_type ew_u; VAL [\old(x)=8589934602, ew_u={6:0}, x=8589934602] [L21] ew_u.value = (x) VAL [\old(x)=8589934602, ew_u={6:0}, x=8589934602] [L22] EXPR ew_u.parts.msw VAL [\old(x)=8589934602, ew_u={6:0}, ew_u.parts.msw=8589934590, x=8589934602] [L22] (msw) = ew_u.parts.msw [L23] EXPR ew_u.parts.lsw VAL [\old(x)=8589934602, ew_u={6:0}, ew_u.parts.lsw=8589934591, msw=-2, x=8589934602] [L23] (lsw) = ew_u.parts.lsw [L25] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 VAL [\old(x)=8589934602, exponent_less_1023=1024, lsw=4294967295, msw=-2, x=8589934602] [L26] COND FALSE !(exponent_less_1023 < 20) VAL [\old(x)=8589934602, exponent_less_1023=1024, lsw=4294967295, msw=-2, x=8589934602] [L40] COND TRUE exponent_less_1023 > 51 VAL [\old(x)=8589934602, exponent_less_1023=1024, lsw=4294967295, msw=-2, x=8589934602] [L41] COND TRUE exponent_less_1023 == 1024 [L42] return x + x; VAL [\old(x)=8589934602, exponent_less_1023=1024, lsw=4294967295, msw=-2, x=8589934602] [L89] RET, EXPR round_double(x) [L89] double res = round_double(x); [L92] CALL, EXPR isinf_double(res) [L67] __int32_t hx, lx; VAL [\old(x)=8589934603, x=8589934603] [L69] ieee_double_shape_type ew_u; VAL [\old(x)=8589934603, ew_u={5:0}, x=8589934603] [L70] ew_u.value = (x) VAL [\old(x)=8589934603, ew_u={5:0}, x=8589934603] [L71] EXPR ew_u.parts.msw VAL [\old(x)=8589934603, ew_u={5:0}, ew_u.parts.msw=4294967303, x=8589934603] [L71] (hx) = ew_u.parts.msw [L72] EXPR ew_u.parts.lsw VAL [\old(x)=8589934603, ew_u={5:0}, ew_u.parts.lsw=4294967295, hx=7, x=8589934603] [L72] (lx) = ew_u.parts.lsw [L74] hx &= 0x7fffffff [L75] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L76] hx = 0x7ff00000 - hx [L77] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=8589934603, \result=0, hx=2146435072, lx=-1, x=8589934603] [L92] RET, EXPR isinf_double(res) [L92] COND TRUE !isinf_double(res) [L93] reach_error() VAL [res=8589934603, x=8589934602] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 80]: 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, 62 locations, 20 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 626 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 280 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 188 IncrementalHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 346 mSDtfsCounter, 188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, InterpolantAutomatonStates: 23, 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, 7 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 16:44:20,231 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...