/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/float-newlib/double_req_bl_1131b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:44:28,712 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:44:28,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:44:28,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:44:28,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:44:28,773 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:44:28,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:44:28,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:44:28,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:44:28,809 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:44:28,810 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:44:28,812 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:44:28,812 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:44:28,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:44:28,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:44:28,819 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:44:28,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:44:28,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:44:28,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:44:28,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:44:28,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:44:28,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:44:28,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:44:28,848 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:44:28,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:44:28,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:44:28,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:44:28,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:44:28,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:44:28,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:44:28,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:44:28,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:44:28,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:44:28,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:44:28,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:44:28,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:44:28,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:44:28,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:44:28,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:44:28,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:44:28,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:44:28,874 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 16:44:28,933 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:44:28,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:44:28,934 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:44:28,934 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:44:28,936 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:44:28,937 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:44:28,940 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:44:28,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:44:28,940 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:44:28,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:44:28,942 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:44:28,942 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:44:28,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:44:28,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:44:28,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:44:28,943 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:44:28,944 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:44:28,944 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:44:28,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:44:28,944 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:44:28,944 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:44:28,945 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:44:28,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:44:28,945 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:44:28,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:44:28,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:44:28,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:44:28,946 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:44:28,946 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:44:28,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:44:28,947 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 16:44:29,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:44:29,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:44:29,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:44:29,424 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:44:29,424 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:44:29,426 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1131b.c [2022-10-15 16:44:29,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbfb51507/4d0aad28d6f04ca493a8c13356ee5a7b/FLAG201157b1a [2022-10-15 16:44:30,206 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:44:30,207 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1131b.c [2022-10-15 16:44:30,216 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbfb51507/4d0aad28d6f04ca493a8c13356ee5a7b/FLAG201157b1a [2022-10-15 16:44:30,550 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbfb51507/4d0aad28d6f04ca493a8c13356ee5a7b [2022-10-15 16:44:30,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:44:30,560 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:44:30,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:44:30,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:44:30,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:44:30,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:44:30" (1/1) ... [2022-10-15 16:44:30,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85362cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:30, skipping insertion in model container [2022-10-15 16:44:30,569 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:44:30" (1/1) ... [2022-10-15 16:44:30,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:44:30,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:44:30,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1131b.c[4119,4132] [2022-10-15 16:44:30,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:44:30,866 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:44:30,956 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1131b.c[4119,4132] [2022-10-15 16:44:30,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:44:30,986 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:44:30,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:30 WrapperNode [2022-10-15 16:44:30,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:44:30,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:44:30,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:44:30,989 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:44:30,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:30" (1/1) ... [2022-10-15 16:44:31,029 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:30" (1/1) ... [2022-10-15 16:44:31,101 INFO L138 Inliner]: procedures = 18, calls = 39, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 319 [2022-10-15 16:44:31,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:44:31,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:44:31,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:44:31,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:44:31,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:30" (1/1) ... [2022-10-15 16:44:31,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:30" (1/1) ... [2022-10-15 16:44:31,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:30" (1/1) ... [2022-10-15 16:44:31,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:30" (1/1) ... [2022-10-15 16:44:31,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:30" (1/1) ... [2022-10-15 16:44:31,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:30" (1/1) ... [2022-10-15 16:44:31,158 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:30" (1/1) ... [2022-10-15 16:44:31,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:30" (1/1) ... [2022-10-15 16:44:31,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:44:31,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:44:31,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:44:31,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:44:31,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:30" (1/1) ... [2022-10-15 16:44:31,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:44:31,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:44:31,223 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 16:44:31,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 16:44:31,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:44:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:44:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:44:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:44:31,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:44:31,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:44:31,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:44:31,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:44:31,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:44:31,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-10-15 16:44:31,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:44:31,483 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:44:31,488 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:44:32,404 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:44:32,414 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:44:32,416 INFO L300 CfgBuilder]: Removed 16 assume(true) statements. [2022-10-15 16:44:32,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:44:32 BoogieIcfgContainer [2022-10-15 16:44:32,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:44:32,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:44:32,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:44:32,427 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:44:32,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:44:30" (1/3) ... [2022-10-15 16:44:32,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc5db7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:44:32, skipping insertion in model container [2022-10-15 16:44:32,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:44:30" (2/3) ... [2022-10-15 16:44:32,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc5db7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:44:32, skipping insertion in model container [2022-10-15 16:44:32,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:44:32" (3/3) ... [2022-10-15 16:44:32,431 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1131b.c [2022-10-15 16:44:32,455 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:44:32,455 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2022-10-15 16:44:32,519 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:44:32,529 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;@27afd571, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:44:32,529 INFO L358 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2022-10-15 16:44:32,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 117 states have (on average 1.9316239316239316) internal successors, (226), 153 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:32,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:44:32,562 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:32,563 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:44:32,564 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-10-15 16:44:32,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:32,575 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-10-15 16:44:32,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:32,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160881072] [2022-10-15 16:44:32,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:32,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:32,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:32,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:32,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160881072] [2022-10-15 16:44:32,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160881072] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:32,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:32,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:32,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940144159] [2022-10-15 16:44:32,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:32,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:32,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:32,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:33,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:33,005 INFO L87 Difference]: Start difference. First operand has 154 states, 117 states have (on average 1.9316239316239316) internal successors, (226), 153 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:33,216 INFO L93 Difference]: Finished difference Result 152 states and 199 transitions. [2022-10-15 16:44:33,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:33,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:44:33,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:33,239 INFO L225 Difference]: With dead ends: 152 [2022-10-15 16:44:33,239 INFO L226 Difference]: Without dead ends: 150 [2022-10-15 16:44:33,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:33,249 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 4 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:33,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 345 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:33,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-10-15 16:44:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-10-15 16:44:33,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 116 states have (on average 1.6982758620689655) internal successors, (197), 149 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 197 transitions. [2022-10-15 16:44:33,310 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 197 transitions. Word has length 4 [2022-10-15 16:44:33,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:33,310 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 197 transitions. [2022-10-15 16:44:33,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:33,311 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 197 transitions. [2022-10-15 16:44:33,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:44:33,312 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:33,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:44:33,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:44:33,313 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-10-15 16:44:33,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:33,314 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-10-15 16:44:33,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:33,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391141127] [2022-10-15 16:44:33,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:33,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:33,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:33,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:33,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391141127] [2022-10-15 16:44:33,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391141127] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:33,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:33,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:33,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199928275] [2022-10-15 16:44:33,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:33,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:33,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:33,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:33,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:33,475 INFO L87 Difference]: Start difference. First operand 150 states and 197 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:33,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:33,571 INFO L93 Difference]: Finished difference Result 148 states and 195 transitions. [2022-10-15 16:44:33,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:33,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:44:33,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:33,575 INFO L225 Difference]: With dead ends: 148 [2022-10-15 16:44:33,575 INFO L226 Difference]: Without dead ends: 148 [2022-10-15 16:44:33,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:33,578 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 2 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:33,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 347 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:33,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-10-15 16:44:33,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-10-15 16:44:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 116 states have (on average 1.6810344827586208) internal successors, (195), 147 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:33,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 195 transitions. [2022-10-15 16:44:33,594 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 195 transitions. Word has length 4 [2022-10-15 16:44:33,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:33,595 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 195 transitions. [2022-10-15 16:44:33,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:33,595 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 195 transitions. [2022-10-15 16:44:33,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:44:33,596 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:33,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:33,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:44:33,597 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-10-15 16:44:33,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:33,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1129607011, now seen corresponding path program 1 times [2022-10-15 16:44:33,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:33,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304804249] [2022-10-15 16:44:33,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:33,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:33,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:33,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:33,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304804249] [2022-10-15 16:44:33,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304804249] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:33,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:33,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:44:33,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18065856] [2022-10-15 16:44:33,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:33,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:44:33,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:33,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:44:33,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:44:33,932 INFO L87 Difference]: Start difference. First operand 148 states and 195 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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:44:34,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:34,024 INFO L93 Difference]: Finished difference Result 150 states and 196 transitions. [2022-10-15 16:44:34,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:44:34,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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:44:34,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:34,027 INFO L225 Difference]: With dead ends: 150 [2022-10-15 16:44:34,027 INFO L226 Difference]: Without dead ends: 148 [2022-10-15 16:44:34,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:44:34,029 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 1 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:34,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 485 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:34,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-10-15 16:44:34,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-10-15 16:44:34,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 116 states have (on average 1.6724137931034482) internal successors, (194), 147 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:34,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 194 transitions. [2022-10-15 16:44:34,042 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 194 transitions. Word has length 12 [2022-10-15 16:44:34,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:34,042 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 194 transitions. [2022-10-15 16:44:34,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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:44:34,043 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 194 transitions. [2022-10-15 16:44:34,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:44:34,044 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:34,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:34,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:44:34,044 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-10-15 16:44:34,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:34,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1130063727, now seen corresponding path program 1 times [2022-10-15 16:44:34,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:34,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138412644] [2022-10-15 16:44:34,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:34,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:34,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:34,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:34,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138412644] [2022-10-15 16:44:34,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138412644] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:34,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:34,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:34,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458569540] [2022-10-15 16:44:34,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:34,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:34,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:34,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:34,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:34,134 INFO L87 Difference]: Start difference. First operand 148 states and 194 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:44:34,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:34,199 INFO L93 Difference]: Finished difference Result 145 states and 191 transitions. [2022-10-15 16:44:34,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:34,200 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:44:34,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:34,201 INFO L225 Difference]: With dead ends: 145 [2022-10-15 16:44:34,202 INFO L226 Difference]: Without dead ends: 145 [2022-10-15 16:44:34,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:34,204 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 7 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:34,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 328 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:34,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-10-15 16:44:34,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-10-15 16:44:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 116 states have (on average 1.646551724137931) internal successors, (191), 144 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 191 transitions. [2022-10-15 16:44:34,214 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 191 transitions. Word has length 12 [2022-10-15 16:44:34,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:34,215 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 191 transitions. [2022-10-15 16:44:34,215 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:44:34,215 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 191 transitions. [2022-10-15 16:44:34,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-10-15 16:44:34,216 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:34,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:34,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:44:34,217 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-10-15 16:44:34,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:34,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1130063726, now seen corresponding path program 1 times [2022-10-15 16:44:34,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:34,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577246048] [2022-10-15 16:44:34,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:34,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:34,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:34,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577246048] [2022-10-15 16:44:34,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577246048] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:34,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:34,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:34,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216428305] [2022-10-15 16:44:34,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:34,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:34,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:34,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:34,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:34,332 INFO L87 Difference]: Start difference. First operand 145 states and 191 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:44:34,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:34,396 INFO L93 Difference]: Finished difference Result 142 states and 188 transitions. [2022-10-15 16:44:34,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:34,397 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:44:34,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:34,399 INFO L225 Difference]: With dead ends: 142 [2022-10-15 16:44:34,399 INFO L226 Difference]: Without dead ends: 142 [2022-10-15 16:44:34,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:34,401 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 4 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:34,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 334 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:34,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-10-15 16:44:34,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-10-15 16:44:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 116 states have (on average 1.6206896551724137) internal successors, (188), 141 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 188 transitions. [2022-10-15 16:44:34,410 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 188 transitions. Word has length 12 [2022-10-15 16:44:34,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:34,411 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 188 transitions. [2022-10-15 16:44:34,411 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:44:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 188 transitions. [2022-10-15 16:44:34,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 16:44:34,412 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:34,412 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:44:34,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:44:34,413 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-10-15 16:44:34,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:34,414 INFO L85 PathProgramCache]: Analyzing trace with hash 582305402, now seen corresponding path program 1 times [2022-10-15 16:44:34,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:34,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483848738] [2022-10-15 16:44:34,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:34,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:34,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:34,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483848738] [2022-10-15 16:44:34,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483848738] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:34,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:34,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:34,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861736867] [2022-10-15 16:44:34,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:34,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:34,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:34,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:34,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:34,519 INFO L87 Difference]: Start difference. First operand 142 states and 188 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 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:44:34,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:34,580 INFO L93 Difference]: Finished difference Result 139 states and 185 transitions. [2022-10-15 16:44:34,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:34,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 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:44:34,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:34,582 INFO L225 Difference]: With dead ends: 139 [2022-10-15 16:44:34,583 INFO L226 Difference]: Without dead ends: 139 [2022-10-15 16:44:34,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:34,584 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 7 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:34,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 319 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-10-15 16:44:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-10-15 16:44:34,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 116 states have (on average 1.5948275862068966) internal successors, (185), 138 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 185 transitions. [2022-10-15 16:44:34,592 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 185 transitions. Word has length 19 [2022-10-15 16:44:34,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:34,593 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 185 transitions. [2022-10-15 16:44:34,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 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:44:34,593 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 185 transitions. [2022-10-15 16:44:34,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-10-15 16:44:34,594 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:34,594 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:44:34,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:44:34,595 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-10-15 16:44:34,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:34,595 INFO L85 PathProgramCache]: Analyzing trace with hash 582305403, now seen corresponding path program 1 times [2022-10-15 16:44:34,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:34,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689818552] [2022-10-15 16:44:34,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:34,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:44:34,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:44:34,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:44:34,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689818552] [2022-10-15 16:44:34,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689818552] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:44:34,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:44:34,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:44:34,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558717221] [2022-10-15 16:44:34,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:44:34,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:44:34,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:44:34,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:44:34,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:34,808 INFO L87 Difference]: Start difference. First operand 139 states and 185 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 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:44:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:44:34,864 INFO L93 Difference]: Finished difference Result 136 states and 182 transitions. [2022-10-15 16:44:34,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:44:34,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 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:44:34,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:44:34,867 INFO L225 Difference]: With dead ends: 136 [2022-10-15 16:44:34,867 INFO L226 Difference]: Without dead ends: 136 [2022-10-15 16:44:34,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:44:34,868 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 4 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:44:34,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 325 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:44:34,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-10-15 16:44:34,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-10-15 16:44:34,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 116 states have (on average 1.5689655172413792) internal successors, (182), 135 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:44:34,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 182 transitions. [2022-10-15 16:44:34,875 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 182 transitions. Word has length 19 [2022-10-15 16:44:34,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:44:34,875 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 182 transitions. [2022-10-15 16:44:34,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 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:44:34,876 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 182 transitions. [2022-10-15 16:44:34,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 16:44:34,877 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:44:34,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:34,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:44:34,878 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2022-10-15 16:44:34,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:44:34,879 INFO L85 PathProgramCache]: Analyzing trace with hash 127486678, now seen corresponding path program 1 times [2022-10-15 16:44:34,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:44:34,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258599709] [2022-10-15 16:44:34,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:44:34,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:44:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:44:35,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:44:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:44:35,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:44:35,180 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:44:35,181 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (35 of 36 remaining) [2022-10-15 16:44:35,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 36 remaining) [2022-10-15 16:44:35,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 36 remaining) [2022-10-15 16:44:35,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 36 remaining) [2022-10-15 16:44:35,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 36 remaining) [2022-10-15 16:44:35,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 36 remaining) [2022-10-15 16:44:35,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 36 remaining) [2022-10-15 16:44:35,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 36 remaining) [2022-10-15 16:44:35,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 36 remaining) [2022-10-15 16:44:35,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 36 remaining) [2022-10-15 16:44:35,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 36 remaining) [2022-10-15 16:44:35,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 36 remaining) [2022-10-15 16:44:35,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 36 remaining) [2022-10-15 16:44:35,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 36 remaining) [2022-10-15 16:44:35,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 36 remaining) [2022-10-15 16:44:35,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 36 remaining) [2022-10-15 16:44:35,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 36 remaining) [2022-10-15 16:44:35,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 36 remaining) [2022-10-15 16:44:35,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 36 remaining) [2022-10-15 16:44:35,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 36 remaining) [2022-10-15 16:44:35,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 36 remaining) [2022-10-15 16:44:35,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 36 remaining) [2022-10-15 16:44:35,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 36 remaining) [2022-10-15 16:44:35,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 36 remaining) [2022-10-15 16:44:35,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 36 remaining) [2022-10-15 16:44:35,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 36 remaining) [2022-10-15 16:44:35,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 36 remaining) [2022-10-15 16:44:35,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 36 remaining) [2022-10-15 16:44:35,207 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 36 remaining) [2022-10-15 16:44:35,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 36 remaining) [2022-10-15 16:44:35,211 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 36 remaining) [2022-10-15 16:44:35,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 36 remaining) [2022-10-15 16:44:35,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 36 remaining) [2022-10-15 16:44:35,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 36 remaining) [2022-10-15 16:44:35,212 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 36 remaining) [2022-10-15 16:44:35,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK (0 of 36 remaining) [2022-10-15 16:44:35,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:44:35,218 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:44:35,224 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:44:35,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:44:35 BoogieIcfgContainer [2022-10-15 16:44:35,321 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:44:35,322 INFO L158 Benchmark]: Toolchain (without parser) took 4766.32ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 129.1MB in the beginning and 114.8MB in the end (delta: 14.3MB). Peak memory consumption was 46.5MB. Max. memory is 8.0GB. [2022-10-15 16:44:35,322 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 155.2MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:44:35,323 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.14ms. Allocated memory is still 155.2MB. Free memory was 128.8MB in the beginning and 114.9MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-10-15 16:44:35,323 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.71ms. Allocated memory is still 155.2MB. Free memory was 114.9MB in the beginning and 110.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-10-15 16:44:35,324 INFO L158 Benchmark]: Boogie Preprocessor took 68.64ms. Allocated memory is still 155.2MB. Free memory was 110.2MB in the beginning and 106.7MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 16:44:35,326 INFO L158 Benchmark]: RCFGBuilder took 1248.09ms. Allocated memory is still 155.2MB. Free memory was 106.6MB in the beginning and 94.9MB in the end (delta: 11.7MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-10-15 16:44:35,326 INFO L158 Benchmark]: TraceAbstraction took 2897.29ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 93.8MB in the beginning and 114.8MB in the end (delta: -21.0MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2022-10-15 16:44:35,329 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.33ms. Allocated memory is still 155.2MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 425.14ms. Allocated memory is still 155.2MB. Free memory was 128.8MB in the beginning and 114.9MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 113.71ms. Allocated memory is still 155.2MB. Free memory was 114.9MB in the beginning and 110.2MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.64ms. Allocated memory is still 155.2MB. Free memory was 110.2MB in the beginning and 106.7MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1248.09ms. Allocated memory is still 155.2MB. Free memory was 106.6MB in the beginning and 94.9MB in the end (delta: 11.7MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * TraceAbstraction took 2897.29ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 93.8MB in the beginning and 114.8MB in the end (delta: -21.0MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 188]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 44, overapproximation of bitwiseXOr at line 39, overapproximation of bitwiseOr at line 43, overapproximation of someUnaryDOUBLEoperation at line 19, overapproximation of bitwiseAnd at line 40, overapproximation of memtrack at line 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 187. Possible FailurePath: [L17-L20] static const double one_fmod = 1.0, Zero_fmod[] = { 0.0, -0.0, }; VAL [one_fmod=1, Zero_fmod={4:0}] [L179] double y = -1.0 / 0.0; [L180] double x = __VERIFIER_nondet_double(); [L182] CALL isfinite_double(x) [L163] __int32_t hx; VAL [\old(x)=4294967323, one_fmod=1, x=4294967323, Zero_fmod={4:0}] [L165] ieee_double_shape_type gh_u; VAL [\old(x)=4294967323, gh_u={6:0}, one_fmod=1, x=4294967323, Zero_fmod={4:0}] [L166] gh_u.value = (x) VAL [\old(x)=4294967323, gh_u={6:0}, one_fmod=1, x=4294967323, Zero_fmod={4:0}] [L167] EXPR gh_u.parts.msw VAL [\old(x)=4294967323, gh_u={6:0}, gh_u.parts.msw=4294967295, one_fmod=1, x=4294967323, Zero_fmod={4:0}] [L167] (hx) = gh_u.parts.msw [L169] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); VAL [\old(x)=4294967323, \result=1, hx=-1, one_fmod=1, x=4294967323, Zero_fmod={4:0}] [L182] RET isfinite_double(x) [L182] COND TRUE isfinite_double(x) [L184] CALL, EXPR fmod_double(x, y) [L23] __int32_t n, hx, hy, hz, ix, iy, sx, i; [L24] __uint32_t lx, ly, lz; VAL [\old(x)=4294967323, \old(y)=4294967322, one_fmod=1, x=4294967323, y=4294967322, Zero_fmod={4:0}] [L27] ieee_double_shape_type ew_u; VAL [\old(x)=4294967323, \old(y)=4294967322, ew_u={7:0}, one_fmod=1, x=4294967323, y=4294967322, Zero_fmod={4:0}] [L28] ew_u.value = (x) VAL [\old(x)=4294967323, \old(y)=4294967322, ew_u={7:0}, one_fmod=1, x=4294967323, y=4294967322, Zero_fmod={4:0}] [L29] EXPR ew_u.parts.msw VAL [\old(x)=4294967323, \old(y)=4294967322, ew_u={7:0}, ew_u.parts.msw=4294967296, one_fmod=1, x=4294967323, y=4294967322, Zero_fmod={4:0}] [L29] (hx) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw VAL [\old(x)=4294967323, \old(y)=4294967322, ew_u={7:0}, ew_u.parts.lsw=4294967306, hx=0, one_fmod=1, x=4294967323, y=4294967322, Zero_fmod={4:0}] [L30] (lx) = ew_u.parts.lsw [L33] ieee_double_shape_type ew_u; VAL [\old(x)=4294967323, \old(y)=4294967322, ew_u={5:0}, hx=0, lx=4294967306, one_fmod=1, x=4294967323, y=4294967322, Zero_fmod={4:0}] [L34] ew_u.value = (y) VAL [\old(x)=4294967323, \old(y)=4294967322, ew_u={5:0}, hx=0, lx=4294967306, one_fmod=1, x=4294967323, y=4294967322, Zero_fmod={4:0}] [L35] EXPR ew_u.parts.msw VAL [\old(x)=4294967323, \old(y)=4294967322, ew_u={5:0}, ew_u.parts.msw=4294967305, hx=0, lx=4294967306, one_fmod=1, x=4294967323, y=4294967322, Zero_fmod={4:0}] [L35] (hy) = ew_u.parts.msw [L36] EXPR ew_u.parts.lsw VAL [\old(x)=4294967323, \old(y)=4294967322, ew_u={5:0}, ew_u.parts.lsw=1, hx=0, hy=9, lx=4294967306, one_fmod=1, x=4294967323, y=4294967322, Zero_fmod={4:0}] [L36] (ly) = ew_u.parts.lsw [L38] sx = hx & 0x80000000 VAL [\old(x)=4294967323, \old(y)=4294967322, hx=0, hy=9, lx=4294967306, ly=1, one_fmod=1, sx=0, x=4294967323, y=4294967322, Zero_fmod={4:0}] [L39] hx ^= sx [L40] hy &= 0x7fffffff VAL [\old(x)=4294967323, \old(y)=4294967322, hx=0, hy=1, lx=4294967306, ly=1, one_fmod=1, sx=0, x=4294967323, y=4294967322, Zero_fmod={4:0}] [L42-L43] COND TRUE (hy | ly) == 0 || (hx >= 0x7ff00000) || ((hy | ((ly | -ly) >> 31)) > 0x7ff00000) [L44] return (x * y) / (x * y); VAL [\old(x)=4294967323, \old(y)=4294967322, hx=0, hy=1, lx=4294967306, ly=1, one_fmod=1, sx=0, x=4294967323, y=4294967322, Zero_fmod={4:0}] [L184] RET, EXPR fmod_double(x, y) [L184] double res = fmod_double(x, y); [L187] COND TRUE res != x VAL [one_fmod=1, res=4294967321, x=4294967323, y=4294967322, Zero_fmod={4:0}] [L188] reach_error() VAL [one_fmod=1, res=4294967321, x=4294967323, y=4294967322, Zero_fmod={4:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 172]: 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, 154 locations, 36 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 2483 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1183 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 338 IncrementalHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 1300 mSDtfsCounter, 338 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=0, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 140 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 16:44:35,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...