/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/float_req_bl_0960b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:45:32,906 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:45:32,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:45:32,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:45:32,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:45:32,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:45:32,978 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:45:32,988 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:45:33,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:45:33,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:45:33,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:45:33,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:45:33,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:45:33,026 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:45:33,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:45:33,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:45:33,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:45:33,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:45:33,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:45:33,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:45:33,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:45:33,054 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:45:33,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:45:33,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:45:33,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:45:33,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:45:33,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:45:33,072 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:45:33,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:45:33,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:45:33,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:45:33,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:45:33,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:45:33,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:45:33,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:45:33,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:45:33,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:45:33,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:45:33,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:45:33,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:45:33,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:45:33,087 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:45:33,140 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:45:33,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:45:33,141 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:45:33,142 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:45:33,144 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:45:33,144 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:45:33,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:45:33,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:45:33,147 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:45:33,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:45:33,148 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:45:33,149 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:45:33,149 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:45:33,149 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:45:33,149 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:45:33,149 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:45:33,149 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:45:33,150 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:45:33,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:45:33,150 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:45:33,150 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:45:33,150 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:45:33,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:45:33,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:45:33,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:45:33,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:33,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:45:33,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:45:33,152 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:45:33,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:45:33,152 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:45:33,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:45:33,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:45:33,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:45:33,648 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:45:33,650 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:45:33,651 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0960b.c [2022-10-15 16:45:33,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b550048/c269b2ba7eed4c17b84a9f2ce98b819c/FLAGa17d653ee [2022-10-15 16:45:34,404 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:45:34,405 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0960b.c [2022-10-15 16:45:34,414 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b550048/c269b2ba7eed4c17b84a9f2ce98b819c/FLAGa17d653ee [2022-10-15 16:45:34,744 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83b550048/c269b2ba7eed4c17b84a9f2ce98b819c [2022-10-15 16:45:34,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:45:34,755 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:45:34,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:34,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:45:34,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:45:34,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:34" (1/1) ... [2022-10-15 16:45:34,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7e1e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:34, skipping insertion in model container [2022-10-15 16:45:34,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:34" (1/1) ... [2022-10-15 16:45:34,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:45:34,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:45:35,029 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0960b.c[4186,4199] [2022-10-15 16:45:35,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:35,044 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:45:35,095 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/float_req_bl_0960b.c[4186,4199] [2022-10-15 16:45:35,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:35,115 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:45:35,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:35 WrapperNode [2022-10-15 16:45:35,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:35,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:35,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:45:35,118 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:45:35,127 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:45:35" (1/1) ... [2022-10-15 16:45:35,140 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:45:35" (1/1) ... [2022-10-15 16:45:35,180 INFO L138 Inliner]: procedures = 17, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 243 [2022-10-15 16:45:35,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:35,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:45:35,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:45:35,182 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:45:35,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:35" (1/1) ... [2022-10-15 16:45:35,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:35" (1/1) ... [2022-10-15 16:45:35,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:35" (1/1) ... [2022-10-15 16:45:35,198 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:35" (1/1) ... [2022-10-15 16:45:35,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:35" (1/1) ... [2022-10-15 16:45:35,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:35" (1/1) ... [2022-10-15 16:45:35,222 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:35" (1/1) ... [2022-10-15 16:45:35,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:35" (1/1) ... [2022-10-15 16:45:35,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:45:35,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:45:35,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:45:35,231 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:45:35,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:35" (1/1) ... [2022-10-15 16:45:35,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:35,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:45:35,270 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:45:35,284 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:45:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:45:35,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:45:35,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:45:35,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:45:35,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:45:35,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:45:35,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:45:35,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:45:35,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:45:35,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:45:35,518 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:45:35,522 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:45:36,395 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:45:36,411 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:45:36,411 INFO L300 CfgBuilder]: Removed 14 assume(true) statements. [2022-10-15 16:45:36,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:36 BoogieIcfgContainer [2022-10-15 16:45:36,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:45:36,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:45:36,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:45:36,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:45:36,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:45:34" (1/3) ... [2022-10-15 16:45:36,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15537871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:36, skipping insertion in model container [2022-10-15 16:45:36,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:35" (2/3) ... [2022-10-15 16:45:36,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15537871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:36, skipping insertion in model container [2022-10-15 16:45:36,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:36" (3/3) ... [2022-10-15 16:45:36,427 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0960b.c [2022-10-15 16:45:36,450 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:45:36,450 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-10-15 16:45:36,517 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:45:36,526 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;@dba4ff9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:45:36,526 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-10-15 16:45:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 105 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:45:36,539 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:36,540 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:45:36,540 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:45:36,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:36,546 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-10-15 16:45:36,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:36,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639853893] [2022-10-15 16:45:36,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:36,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:36,867 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:45:36,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:36,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639853893] [2022-10-15 16:45:36,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639853893] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:36,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:36,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:36,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34655728] [2022-10-15 16:45:36,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:36,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:36,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:36,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:36,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:36,910 INFO L87 Difference]: Start difference. First operand has 106 states, 75 states have (on average 1.9066666666666667) internal successors, (143), 105 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:45:37,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:37,077 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2022-10-15 16:45:37,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:37,081 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:45:37,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:37,097 INFO L225 Difference]: With dead ends: 104 [2022-10-15 16:45:37,097 INFO L226 Difference]: Without dead ends: 102 [2022-10-15 16:45:37,099 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:45:37,108 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:37,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 197 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:37,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-10-15 16:45:37,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-10-15 16:45:37,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.6486486486486487) internal successors, (122), 101 states have internal predecessors, (122), 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:45:37,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2022-10-15 16:45:37,174 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 4 [2022-10-15 16:45:37,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:37,174 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2022-10-15 16:45:37,175 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:45:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2022-10-15 16:45:37,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:45:37,176 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:37,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:45:37,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:45:37,177 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:45:37,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:37,178 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-10-15 16:45:37,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:37,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119548546] [2022-10-15 16:45:37,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:37,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:37,317 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:45:37,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:37,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119548546] [2022-10-15 16:45:37,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119548546] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:37,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:37,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:37,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932318122] [2022-10-15 16:45:37,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:37,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:37,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:37,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:37,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:37,323 INFO L87 Difference]: Start difference. First operand 102 states and 122 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:45:37,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:37,398 INFO L93 Difference]: Finished difference Result 100 states and 120 transitions. [2022-10-15 16:45:37,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:37,399 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:45:37,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:37,401 INFO L225 Difference]: With dead ends: 100 [2022-10-15 16:45:37,401 INFO L226 Difference]: Without dead ends: 100 [2022-10-15 16:45:37,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:45:37,403 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 2 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:37,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 201 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:37,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-10-15 16:45:37,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-10-15 16:45:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.6216216216216217) internal successors, (120), 99 states have internal predecessors, (120), 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:45:37,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2022-10-15 16:45:37,416 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 4 [2022-10-15 16:45:37,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:37,417 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2022-10-15 16:45:37,417 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:45:37,417 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2022-10-15 16:45:37,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:45:37,418 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:37,418 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:37,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:45:37,419 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:45:37,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:37,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1129817462, now seen corresponding path program 1 times [2022-10-15 16:45:37,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:37,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913470928] [2022-10-15 16:45:37,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:37,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:37,593 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:45:37,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:37,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913470928] [2022-10-15 16:45:37,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913470928] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:37,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:37,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:37,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879223413] [2022-10-15 16:45:37,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:37,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:37,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:37,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:37,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:37,600 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:37,670 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2022-10-15 16:45:37,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:37,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 16:45:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:37,673 INFO L225 Difference]: With dead ends: 98 [2022-10-15 16:45:37,673 INFO L226 Difference]: Without dead ends: 98 [2022-10-15 16:45:37,673 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:45:37,675 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:37,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 187 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:37,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-10-15 16:45:37,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-10-15 16:45:37,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.5945945945945945) internal successors, (118), 97 states have internal predecessors, (118), 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:45:37,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2022-10-15 16:45:37,687 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 12 [2022-10-15 16:45:37,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:37,687 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2022-10-15 16:45:37,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:37,688 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2022-10-15 16:45:37,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:45:37,688 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:37,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:37,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:45:37,689 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:45:37,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:37,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1129817461, now seen corresponding path program 1 times [2022-10-15 16:45:37,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:37,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549488684] [2022-10-15 16:45:37,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:37,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:37,892 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:45:37,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:37,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549488684] [2022-10-15 16:45:37,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549488684] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:37,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:37,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:37,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123549173] [2022-10-15 16:45:37,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:37,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:37,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:37,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:37,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:37,902 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:37,984 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-10-15 16:45:37,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:37,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-10-15 16:45:37,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:37,987 INFO L225 Difference]: With dead ends: 96 [2022-10-15 16:45:37,987 INFO L226 Difference]: Without dead ends: 96 [2022-10-15 16:45:37,988 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:45:38,001 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 2 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:38,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 195 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:38,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-10-15 16:45:38,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-10-15 16:45:38,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 95 states have internal predecessors, (116), 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:45:38,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2022-10-15 16:45:38,024 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 12 [2022-10-15 16:45:38,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:38,026 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2022-10-15 16:45:38,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:38,027 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-10-15 16:45:38,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:45:38,027 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:38,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:38,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:45:38,028 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:45:38,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:38,029 INFO L85 PathProgramCache]: Analyzing trace with hash 726176182, now seen corresponding path program 1 times [2022-10-15 16:45:38,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:38,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109201982] [2022-10-15 16:45:38,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:38,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:38,182 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:45:38,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:38,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109201982] [2022-10-15 16:45:38,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109201982] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:38,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:38,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:38,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614966727] [2022-10-15 16:45:38,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:38,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:38,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:38,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:38,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:38,186 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:38,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:38,290 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2022-10-15 16:45:38,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:38,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-15 16:45:38,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:38,295 INFO L225 Difference]: With dead ends: 94 [2022-10-15 16:45:38,295 INFO L226 Difference]: Without dead ends: 94 [2022-10-15 16:45:38,295 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:45:38,297 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 4 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:38,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 182 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-10-15 16:45:38,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-10-15 16:45:38,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.5405405405405406) internal successors, (114), 93 states have internal predecessors, (114), 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:45:38,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2022-10-15 16:45:38,315 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 14 [2022-10-15 16:45:38,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:38,316 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2022-10-15 16:45:38,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2022-10-15 16:45:38,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-15 16:45:38,317 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:38,317 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:38,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:45:38,320 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:45:38,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:38,324 INFO L85 PathProgramCache]: Analyzing trace with hash 726176183, now seen corresponding path program 1 times [2022-10-15 16:45:38,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:38,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851203988] [2022-10-15 16:45:38,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:38,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:38,488 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:45:38,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:38,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851203988] [2022-10-15 16:45:38,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851203988] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:38,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:38,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:38,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119228424] [2022-10-15 16:45:38,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:38,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:38,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:38,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:38,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:38,492 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:38,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:38,559 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2022-10-15 16:45:38,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:38,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-10-15 16:45:38,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:38,562 INFO L225 Difference]: With dead ends: 92 [2022-10-15 16:45:38,562 INFO L226 Difference]: Without dead ends: 92 [2022-10-15 16:45:38,562 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:45:38,565 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 2 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:38,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 189 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:38,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-10-15 16:45:38,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-10-15 16:45:38,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 74 states have (on average 1.5135135135135136) internal successors, (112), 91 states have internal predecessors, (112), 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:45:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2022-10-15 16:45:38,590 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 14 [2022-10-15 16:45:38,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:38,590 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2022-10-15 16:45:38,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:38,594 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2022-10-15 16:45:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 16:45:38,595 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:38,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:38,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:45:38,595 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:45:38,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:38,597 INFO L85 PathProgramCache]: Analyzing trace with hash 383807435, now seen corresponding path program 1 times [2022-10-15 16:45:38,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:38,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297928305] [2022-10-15 16:45:38,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:38,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:38,707 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:45:38,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:38,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297928305] [2022-10-15 16:45:38,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297928305] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:38,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:38,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906997063] [2022-10-15 16:45:38,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:38,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:38,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:38,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:38,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:38,710 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:38,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:38,786 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2022-10-15 16:45:38,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:38,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-15 16:45:38,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:38,789 INFO L225 Difference]: With dead ends: 90 [2022-10-15 16:45:38,789 INFO L226 Difference]: Without dead ends: 90 [2022-10-15 16:45:38,789 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:45:38,792 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 4 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:38,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 176 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:38,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-10-15 16:45:38,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-10-15 16:45:38,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 74 states have (on average 1.4864864864864864) internal successors, (110), 89 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2022-10-15 16:45:38,808 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 17 [2022-10-15 16:45:38,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:38,809 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2022-10-15 16:45:38,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:38,810 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2022-10-15 16:45:38,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-10-15 16:45:38,811 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:38,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:38,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:45:38,816 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:45:38,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:38,817 INFO L85 PathProgramCache]: Analyzing trace with hash 383807436, now seen corresponding path program 1 times [2022-10-15 16:45:38,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:38,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34980673] [2022-10-15 16:45:38,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:38,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:38,970 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:45:38,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:38,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34980673] [2022-10-15 16:45:38,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34980673] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:38,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:38,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:38,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667398264] [2022-10-15 16:45:38,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:38,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:38,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:38,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:38,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:38,973 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:39,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:39,020 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2022-10-15 16:45:39,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:39,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-10-15 16:45:39,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:39,021 INFO L225 Difference]: With dead ends: 88 [2022-10-15 16:45:39,021 INFO L226 Difference]: Without dead ends: 88 [2022-10-15 16:45:39,022 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:45:39,023 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 2 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:39,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 183 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:45:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-10-15 16:45:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-10-15 16:45:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 87 states have internal predecessors, (108), 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:45:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2022-10-15 16:45:39,028 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 17 [2022-10-15 16:45:39,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:39,028 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2022-10-15 16:45:39,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2022-10-15 16:45:39,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 16:45:39,039 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:39,040 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-15 16:45:39,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:45:39,040 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:45:39,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:39,041 INFO L85 PathProgramCache]: Analyzing trace with hash 46987644, now seen corresponding path program 1 times [2022-10-15 16:45:39,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:39,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224939550] [2022-10-15 16:45:39,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:39,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:39,308 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:45:39,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:39,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224939550] [2022-10-15 16:45:39,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224939550] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:39,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:39,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:45:39,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038646043] [2022-10-15 16:45:39,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:39,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:45:39,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:39,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:45:39,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:45:39,312 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:39,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:39,433 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2022-10-15 16:45:39,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:45:39,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-10-15 16:45:39,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:39,435 INFO L225 Difference]: With dead ends: 107 [2022-10-15 16:45:39,435 INFO L226 Difference]: Without dead ends: 106 [2022-10-15 16:45:39,436 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:45:39,438 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 19 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:39,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 300 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:39,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-10-15 16:45:39,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2022-10-15 16:45:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 96 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:39,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2022-10-15 16:45:39,447 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 19 [2022-10-15 16:45:39,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:39,447 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2022-10-15 16:45:39,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:39,448 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2022-10-15 16:45:39,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 16:45:39,450 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:39,450 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-15 16:45:39,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:45:39,451 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2022-10-15 16:45:39,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:39,452 INFO L85 PathProgramCache]: Analyzing trace with hash 46987515, now seen corresponding path program 1 times [2022-10-15 16:45:39,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:39,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421597742] [2022-10-15 16:45:39,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:39,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:45:39,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:45:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:45:39,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:45:39,560 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:45:39,561 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK (29 of 30 remaining) [2022-10-15 16:45:39,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 30 remaining) [2022-10-15 16:45:39,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 30 remaining) [2022-10-15 16:45:39,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 30 remaining) [2022-10-15 16:45:39,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 30 remaining) [2022-10-15 16:45:39,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 30 remaining) [2022-10-15 16:45:39,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 30 remaining) [2022-10-15 16:45:39,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 30 remaining) [2022-10-15 16:45:39,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 30 remaining) [2022-10-15 16:45:39,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 30 remaining) [2022-10-15 16:45:39,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 30 remaining) [2022-10-15 16:45:39,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 30 remaining) [2022-10-15 16:45:39,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 30 remaining) [2022-10-15 16:45:39,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 30 remaining) [2022-10-15 16:45:39,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 30 remaining) [2022-10-15 16:45:39,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 30 remaining) [2022-10-15 16:45:39,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 30 remaining) [2022-10-15 16:45:39,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 30 remaining) [2022-10-15 16:45:39,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 30 remaining) [2022-10-15 16:45:39,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 30 remaining) [2022-10-15 16:45:39,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 30 remaining) [2022-10-15 16:45:39,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 30 remaining) [2022-10-15 16:45:39,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 30 remaining) [2022-10-15 16:45:39,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 30 remaining) [2022-10-15 16:45:39,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 30 remaining) [2022-10-15 16:45:39,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 30 remaining) [2022-10-15 16:45:39,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 30 remaining) [2022-10-15 16:45:39,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 30 remaining) [2022-10-15 16:45:39,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 30 remaining) [2022-10-15 16:45:39,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK (0 of 30 remaining) [2022-10-15 16:45:39,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:45:39,581 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:39,586 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:45:39,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:45:39 BoogieIcfgContainer [2022-10-15 16:45:39,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:45:39,674 INFO L158 Benchmark]: Toolchain (without parser) took 4924.18ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 125.0MB in the beginning and 134.3MB in the end (delta: -9.3MB). Peak memory consumption was 29.3MB. Max. memory is 8.0GB. [2022-10-15 16:45:39,675 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 151.0MB. Free memory was 121.9MB in the beginning and 121.8MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:45:39,675 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.50ms. Allocated memory is still 151.0MB. Free memory was 124.9MB in the beginning and 111.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-15 16:45:39,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.66ms. Allocated memory is still 151.0MB. Free memory was 111.8MB in the beginning and 109.1MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 16:45:39,679 INFO L158 Benchmark]: Boogie Preprocessor took 47.78ms. Allocated memory is still 151.0MB. Free memory was 109.1MB in the beginning and 106.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:45:39,679 INFO L158 Benchmark]: RCFGBuilder took 1185.09ms. Allocated memory is still 151.0MB. Free memory was 106.8MB in the beginning and 117.7MB in the end (delta: -10.9MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. [2022-10-15 16:45:39,680 INFO L158 Benchmark]: TraceAbstraction took 3255.45ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 117.1MB in the beginning and 134.3MB in the end (delta: -17.2MB). Peak memory consumption was 20.6MB. Max. memory is 8.0GB. [2022-10-15 16:45:39,683 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.32ms. Allocated memory is still 151.0MB. Free memory was 121.9MB in the beginning and 121.8MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 358.50ms. Allocated memory is still 151.0MB. Free memory was 124.9MB in the beginning and 111.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.66ms. Allocated memory is still 151.0MB. Free memory was 111.8MB in the beginning and 109.1MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.78ms. Allocated memory is still 151.0MB. Free memory was 109.1MB in the beginning and 106.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1185.09ms. Allocated memory is still 151.0MB. Free memory was 106.8MB in the beginning and 117.7MB in the end (delta: -10.9MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3255.45ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 117.1MB in the beginning and 134.3MB in the end (delta: -17.2MB). Peak memory consumption was 20.6MB. 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: 168]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of bitwiseAnd at line 153, overapproximation of memtrack at line 168, overapproximation of someUnaryFLOAToperation at line 163, overapproximation of someBinaryArithmeticFLOAToperation at line 118. Possible FailurePath: [L13-L17] static const float ln2_hi_log = 6.9313812256e-01, ln2_lo_log = 9.0580006145e-06, two25_log = 3.355443200e+07, Lg1_log = 6.6666668653e-01, Lg2_log = 4.0000000596e-01, Lg3_log = 2.8571429849e-01, Lg4_log = 2.2222198546e-01, Lg5_log = 1.8183572590e-01, Lg6_log = 1.5313838422e-01, Lg7_log = 1.4798198640e-01; [L19] static const float zero_log = 0.0; [L99-L102] static const float two25_log10 = 3.3554432000e+07, ivln10_log10 = 4.3429449201e-01, log10_2hi_log10 = 3.0102920532e-01, log10_2lo_log10 = 7.9034151668e-07; [L104] static const float zero = 0.0; VAL [ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, zero=0, zero_log=0] [L163] float x = -0.0f; [L164] CALL, EXPR __ieee754_log10f(x) [L107] float y, z; [L108] __int32_t i, k, hx; VAL [\old(x)=4294967308, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967308, zero=0, zero_log=0] [L111] ieee_float_shape_type gf_u; VAL [\old(x)=4294967308, gf_u={6:0}, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967308, zero=0, zero_log=0] [L112] gf_u.value = (x) VAL [\old(x)=4294967308, gf_u={6:0}, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967308, zero=0, zero_log=0] [L113] EXPR gf_u.word VAL [\old(x)=4294967308, gf_u={6:0}, gf_u.word=4294967296, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967308, zero=0, zero_log=0] [L113] (hx) = gf_u.word [L116] k = 0 VAL [\old(x)=4294967308, hx=0, ivln10_log10=43429449201/100000000000, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967308, zero=0, zero_log=0] [L117] COND TRUE ((hx & 0x7fffffff) == 0) [L118] return -two25_log10 / zero; VAL [\old(x)=4294967308, hx=0, ivln10_log10=43429449201/100000000000, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967308, zero=0, zero_log=0] [L164] RET, EXPR __ieee754_log10f(x) [L164] float res = __ieee754_log10f(x); [L167] CALL, EXPR isinf_float(res) [L147] __int32_t ix; VAL [\old(x)=4294967307, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967307, zero=0, zero_log=0] [L149] ieee_float_shape_type gf_u; VAL [\old(x)=4294967307, gf_u={5:0}, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967307, zero=0, zero_log=0] [L150] gf_u.value = (x) VAL [\old(x)=4294967307, gf_u={5:0}, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967307, zero=0, zero_log=0] [L151] EXPR gf_u.word VAL [\old(x)=4294967307, gf_u={5:0}, gf_u.word=4294967295, ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967307, zero=0, zero_log=0] [L151] (ix) = gf_u.word [L153] ix &= 0x7fffffff [L154] return ((ix) == 0x7f800000L); VAL [\old(x)=4294967307, \result=0, ivln10_log10=43429449201/100000000000, ix=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, two25_log=33554432, two25_log10=33554432, x=4294967307, zero=0, zero_log=0] [L167] RET, EXPR isinf_float(res) [L167] COND TRUE !isinf_float(res) [L168] reach_error() VAL [ivln10_log10=43429449201/100000000000, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, log10_2hi_log10=7525730133/25000000000, log10_2lo_log10=19758537917/25000000000000000, res=4294967307, two25_log=33554432, two25_log10=33554432, x=4294967308, zero=0, zero_log=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: -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: 157]: 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, 106 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 1810 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 822 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 419 IncrementalHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 988 mSDtfsCounter, 419 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=0, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 204 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:45:39,757 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...