/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/float-newlib/float_req_bl_1072d.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:45:48,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:45:48,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:45:48,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:45:48,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:45:48,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:45:48,612 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:45:48,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:45:48,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:45:48,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:45:48,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:45:48,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:45:48,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:45:48,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:45:48,653 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:45:48,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:45:48,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:45:48,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:45:48,667 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:45:48,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:45:48,679 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:45:48,681 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:45:48,682 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:45:48,683 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:45:48,687 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:45:48,688 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:45:48,688 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:45:48,689 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:45:48,690 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:45:48,691 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:45:48,691 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:45:48,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:45:48,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:45:48,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:45:48,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:45:48,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:45:48,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:45:48,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:45:48,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:45:48,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:45:48,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:45:48,701 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 16:45:48,729 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:45:48,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:45:48,730 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:45:48,730 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:45:48,731 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:45:48,731 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:45:48,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:45:48,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:45:48,733 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:45:48,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:45:48,733 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:45:48,733 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:45:48,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:45:48,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:45:48,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:45:48,734 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:45:48,734 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:45:48,735 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:45:48,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:45:48,735 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:45:48,735 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:45:48,735 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:45:48,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:45:48,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:45:48,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:45:48,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:48,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:45:48,737 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:45:48,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:45:48,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:45:48,737 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 16:45:49,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:45:49,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:45:49,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:45:49,139 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:45:49,140 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:45:49,141 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1072d.c [2022-10-15 16:45:49,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a93f42963/5bf0455479474f52b524c97c4de119b7/FLAG320e33900 [2022-10-15 16:45:49,830 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:45:49,831 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1072d.c [2022-10-15 16:45:49,841 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a93f42963/5bf0455479474f52b524c97c4de119b7/FLAG320e33900 [2022-10-15 16:45:50,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a93f42963/5bf0455479474f52b524c97c4de119b7 [2022-10-15 16:45:50,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:45:50,198 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:45:50,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:50,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:45:50,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:45:50,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:50" (1/1) ... [2022-10-15 16:45:50,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e5786c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:50, skipping insertion in model container [2022-10-15 16:45:50,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:45:50" (1/1) ... [2022-10-15 16:45:50,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:45:50,240 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:45:50,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1072d.c[1573,1586] [2022-10-15 16:45:50,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:50,450 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:45:50,480 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1072d.c[1573,1586] [2022-10-15 16:45:50,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:45:50,504 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:45:50,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:50 WrapperNode [2022-10-15 16:45:50,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:45:50,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:50,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:45:50,507 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:45:50,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:50" (1/1) ... [2022-10-15 16:45:50,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:50" (1/1) ... [2022-10-15 16:45:50,570 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102 [2022-10-15 16:45:50,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:45:50,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:45:50,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:45:50,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:45:50,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:50" (1/1) ... [2022-10-15 16:45:50,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:50" (1/1) ... [2022-10-15 16:45:50,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:50" (1/1) ... [2022-10-15 16:45:50,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:50" (1/1) ... [2022-10-15 16:45:50,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:50" (1/1) ... [2022-10-15 16:45:50,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:50" (1/1) ... [2022-10-15 16:45:50,654 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:50" (1/1) ... [2022-10-15 16:45:50,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:50" (1/1) ... [2022-10-15 16:45:50,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:45:50,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:45:50,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:45:50,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:45:50,675 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:50" (1/1) ... [2022-10-15 16:45:50,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:45:50,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:45:50,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 16:45:50,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 16:45:50,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:45:50,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:45:50,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:45:50,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-10-15 16:45:50,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 16:45:50,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:45:50,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:45:50,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:45:50,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:45:50,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:45:50,974 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:45:50,977 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:45:51,624 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:45:51,633 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:45:51,633 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-10-15 16:45:51,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:51 BoogieIcfgContainer [2022-10-15 16:45:51,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:45:51,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:45:51,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:45:51,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:45:51,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:45:50" (1/3) ... [2022-10-15 16:45:51,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7540f3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:51, skipping insertion in model container [2022-10-15 16:45:51,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:45:50" (2/3) ... [2022-10-15 16:45:51,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7540f3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:45:51, skipping insertion in model container [2022-10-15 16:45:51,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:45:51" (3/3) ... [2022-10-15 16:45:51,651 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1072d.c [2022-10-15 16:45:51,680 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:45:51,681 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-10-15 16:45:51,752 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:45:51,764 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;@e839be2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:45:51,764 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-10-15 16:45:51,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 57 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:51,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:45:51,782 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:51,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:45:51,784 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:45:51,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:51,793 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-10-15 16:45:51,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:51,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235389984] [2022-10-15 16:45:51,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:51,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:45:52,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:52,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235389984] [2022-10-15 16:45:52,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235389984] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:52,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:52,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:52,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458561648] [2022-10-15 16:45:52,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:52,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:52,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:52,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:52,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:52,187 INFO L87 Difference]: Start difference. First operand has 58 states, 39 states have (on average 1.8974358974358974) internal successors, (74), 57 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:52,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:52,282 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-10-15 16:45:52,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:52,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:45:52,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:52,297 INFO L225 Difference]: With dead ends: 56 [2022-10-15 16:45:52,297 INFO L226 Difference]: Without dead ends: 54 [2022-10-15 16:45:52,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:52,305 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:52,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 89 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:52,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-10-15 16:45:52,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-10-15 16:45:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-10-15 16:45:52,354 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 4 [2022-10-15 16:45:52,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:52,354 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-10-15 16:45:52,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:52,355 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-10-15 16:45:52,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-10-15 16:45:52,355 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:52,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-10-15 16:45:52,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:45:52,360 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:45:52,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:52,362 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-10-15 16:45:52,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:52,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253001581] [2022-10-15 16:45:52,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:52,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:52,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:45:52,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:52,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253001581] [2022-10-15 16:45:52,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253001581] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:52,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:52,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:52,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248477540] [2022-10-15 16:45:52,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:52,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:52,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:52,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:52,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:52,486 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:52,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:52,545 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-10-15 16:45:52,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:52,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-10-15 16:45:52,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:52,547 INFO L225 Difference]: With dead ends: 52 [2022-10-15 16:45:52,554 INFO L226 Difference]: Without dead ends: 52 [2022-10-15 16:45:52,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:52,557 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:52,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 90 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:45:52,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-10-15 16:45:52,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-10-15 16:45:52,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.5) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:52,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-10-15 16:45:52,580 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 4 [2022-10-15 16:45:52,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:52,580 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-10-15 16:45:52,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:52,581 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-10-15 16:45:52,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:45:52,582 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:52,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:52,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:45:52,583 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:45:52,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:52,585 INFO L85 PathProgramCache]: Analyzing trace with hash -596847966, now seen corresponding path program 1 times [2022-10-15 16:45:52,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:52,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940622946] [2022-10-15 16:45:52,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:52,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:52,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:45:52,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:52,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940622946] [2022-10-15 16:45:52,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940622946] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:52,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:52,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:52,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940334670] [2022-10-15 16:45:52,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:52,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:52,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:52,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:52,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:52,901 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:52,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:52,964 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-10-15 16:45:52,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:52,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2022-10-15 16:45:52,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:52,966 INFO L225 Difference]: With dead ends: 50 [2022-10-15 16:45:52,967 INFO L226 Difference]: Without dead ends: 50 [2022-10-15 16:45:52,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:52,969 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:52,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 80 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:52,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-10-15 16:45:52,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-10-15 16:45:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-10-15 16:45:52,979 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 13 [2022-10-15 16:45:52,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:52,980 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-10-15 16:45:52,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:52,981 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-10-15 16:45:52,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:45:52,981 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:52,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:52,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:45:52,983 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:45:52,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:52,984 INFO L85 PathProgramCache]: Analyzing trace with hash -596847965, now seen corresponding path program 1 times [2022-10-15 16:45:52,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:52,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431634455] [2022-10-15 16:45:52,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:52,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:53,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:45:53,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:53,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431634455] [2022-10-15 16:45:53,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431634455] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:53,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:53,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:53,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307444461] [2022-10-15 16:45:53,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:53,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:53,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:53,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:53,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:53,297 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:53,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:53,356 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-10-15 16:45:53,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:53,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2022-10-15 16:45:53,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:53,358 INFO L225 Difference]: With dead ends: 48 [2022-10-15 16:45:53,358 INFO L226 Difference]: Without dead ends: 48 [2022-10-15 16:45:53,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:53,361 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:53,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 84 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:45:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-10-15 16:45:53,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-10-15 16:45:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 38 states have (on average 1.394736842105263) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:53,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-10-15 16:45:53,370 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 13 [2022-10-15 16:45:53,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:53,371 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-10-15 16:45:53,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:53,372 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-10-15 16:45:53,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:45:53,373 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:53,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:53,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:45:53,374 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:45:53,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:53,376 INFO L85 PathProgramCache]: Analyzing trace with hash -596827113, now seen corresponding path program 1 times [2022-10-15 16:45:53,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:53,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571426180] [2022-10-15 16:45:53,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:53,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:53,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:45:53,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:53,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571426180] [2022-10-15 16:45:53,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571426180] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:53,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:53,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:53,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096824058] [2022-10-15 16:45:53,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:53,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:53,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:53,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:53,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:53,486 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:53,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:53,561 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-10-15 16:45:53,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:53,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2022-10-15 16:45:53,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:53,563 INFO L225 Difference]: With dead ends: 46 [2022-10-15 16:45:53,563 INFO L226 Difference]: Without dead ends: 46 [2022-10-15 16:45:53,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:53,566 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:53,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 74 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:45:53,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-10-15 16:45:53,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-10-15 16:45:53,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:53,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-10-15 16:45:53,576 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 13 [2022-10-15 16:45:53,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:53,576 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-10-15 16:45:53,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:53,577 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-10-15 16:45:53,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:45:53,578 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:53,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:53,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:45:53,617 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:45:53,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:53,620 INFO L85 PathProgramCache]: Analyzing trace with hash -596827112, now seen corresponding path program 1 times [2022-10-15 16:45:53,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:53,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678636283] [2022-10-15 16:45:53,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:53,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:45:53,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:53,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678636283] [2022-10-15 16:45:53,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678636283] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:53,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:53,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:45:53,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314399799] [2022-10-15 16:45:53,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:53,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:45:53,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:53,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:45:53,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:45:53,835 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:53,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:53,907 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-10-15 16:45:53,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:45:53,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-10-15 16:45:53,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:53,915 INFO L225 Difference]: With dead ends: 73 [2022-10-15 16:45:53,915 INFO L226 Difference]: Without dead ends: 73 [2022-10-15 16:45:53,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:45:53,918 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 52 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:53,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 152 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:45:53,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-10-15 16:45:53,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 49. [2022-10-15 16:45:53,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-10-15 16:45:53,936 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 13 [2022-10-15 16:45:53,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:53,936 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-10-15 16:45:53,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:53,937 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-10-15 16:45:53,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-15 16:45:53,943 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:53,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:53,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:45:53,945 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:45:53,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:53,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1127193748, now seen corresponding path program 1 times [2022-10-15 16:45:53,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:53,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842899600] [2022-10-15 16:45:53,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:53,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:45:54,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:54,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842899600] [2022-10-15 16:45:54,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842899600] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:54,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:54,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:54,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641421347] [2022-10-15 16:45:54,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:54,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:54,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:54,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:54,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:54,098 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:54,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:54,140 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-10-15 16:45:54,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:54,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-10-15 16:45:54,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:54,142 INFO L225 Difference]: With dead ends: 47 [2022-10-15 16:45:54,142 INFO L226 Difference]: Without dead ends: 47 [2022-10-15 16:45:54,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:54,145 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:54,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 78 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:45:54,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-10-15 16:45:54,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-10-15 16:45:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:54,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2022-10-15 16:45:54,152 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 16 [2022-10-15 16:45:54,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:54,152 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2022-10-15 16:45:54,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:54,153 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-10-15 16:45:54,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 16:45:54,154 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:54,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:54,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:45:54,155 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:45:54,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:54,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2082254783, now seen corresponding path program 1 times [2022-10-15 16:45:54,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:54,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511468] [2022-10-15 16:45:54,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:54,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:45:54,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:54,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511468] [2022-10-15 16:45:54,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511468] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:54,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:54,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:54,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441072651] [2022-10-15 16:45:54,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:54,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:54,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:54,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:54,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:54,254 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:54,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:54,312 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-10-15 16:45:54,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:54,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2022-10-15 16:45:54,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:54,318 INFO L225 Difference]: With dead ends: 45 [2022-10-15 16:45:54,318 INFO L226 Difference]: Without dead ends: 45 [2022-10-15 16:45:54,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:54,327 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:54,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 67 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:45:54,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-10-15 16:45:54,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-10-15 16:45:54,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-10-15 16:45:54,350 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 18 [2022-10-15 16:45:54,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:54,352 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-10-15 16:45:54,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:54,353 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-10-15 16:45:54,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 16:45:54,354 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:54,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:54,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:45:54,357 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:45:54,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:54,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2082254782, now seen corresponding path program 1 times [2022-10-15 16:45:54,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:54,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416436209] [2022-10-15 16:45:54,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:54,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:45:54,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 16:45:54,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:45:54,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416436209] [2022-10-15 16:45:54,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416436209] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:45:54,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:45:54,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:45:54,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979220563] [2022-10-15 16:45:54,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:45:54,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:45:54,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:45:54,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:45:54,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:54,467 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:54,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:45:54,500 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-10-15 16:45:54,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:45:54,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2022-10-15 16:45:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:45:54,502 INFO L225 Difference]: With dead ends: 43 [2022-10-15 16:45:54,502 INFO L226 Difference]: Without dead ends: 43 [2022-10-15 16:45:54,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:45:54,503 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:45:54,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 72 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:45:54,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-10-15 16:45:54,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-10-15 16:45:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.170731707317073) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-10-15 16:45:54,509 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 18 [2022-10-15 16:45:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:45:54,509 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-10-15 16:45:54,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 16:45:54,510 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-10-15 16:45:54,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-10-15 16:45:54,510 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:45:54,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:54,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:45:54,511 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2022-10-15 16:45:54,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:45:54,512 INFO L85 PathProgramCache]: Analyzing trace with hash -2082230952, now seen corresponding path program 1 times [2022-10-15 16:45:54,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:45:54,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822941344] [2022-10-15 16:45:54,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:45:54,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:45:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:45:54,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:45:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:45:54,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:45:54,577 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:45:54,578 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (17 of 18 remaining) [2022-10-15 16:45:54,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 18 remaining) [2022-10-15 16:45:54,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 18 remaining) [2022-10-15 16:45:54,581 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 18 remaining) [2022-10-15 16:45:54,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 18 remaining) [2022-10-15 16:45:54,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 18 remaining) [2022-10-15 16:45:54,582 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 18 remaining) [2022-10-15 16:45:54,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 18 remaining) [2022-10-15 16:45:54,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 18 remaining) [2022-10-15 16:45:54,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 18 remaining) [2022-10-15 16:45:54,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 18 remaining) [2022-10-15 16:45:54,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 18 remaining) [2022-10-15 16:45:54,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 18 remaining) [2022-10-15 16:45:54,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 18 remaining) [2022-10-15 16:45:54,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 18 remaining) [2022-10-15 16:45:54,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 18 remaining) [2022-10-15 16:45:54,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 18 remaining) [2022-10-15 16:45:54,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK (0 of 18 remaining) [2022-10-15 16:45:54,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:45:54,591 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:45:54,596 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:45:54,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:45:54 BoogieIcfgContainer [2022-10-15 16:45:54,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:45:54,648 INFO L158 Benchmark]: Toolchain (without parser) took 4454.56ms. Allocated memory was 153.1MB in the beginning and 206.6MB in the end (delta: 53.5MB). Free memory was 126.5MB in the beginning and 118.5MB in the end (delta: 7.9MB). Peak memory consumption was 63.0MB. Max. memory is 8.0GB. [2022-10-15 16:45:54,648 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 153.1MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:45:54,649 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.64ms. Allocated memory is still 153.1MB. Free memory was 126.3MB in the beginning and 115.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-15 16:45:54,649 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.59ms. Allocated memory is still 153.1MB. Free memory was 115.1MB in the beginning and 112.6MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-15 16:45:54,650 INFO L158 Benchmark]: Boogie Preprocessor took 96.97ms. Allocated memory is still 153.1MB. Free memory was 112.6MB in the beginning and 110.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:45:54,650 INFO L158 Benchmark]: RCFGBuilder took 964.04ms. Allocated memory is still 153.1MB. Free memory was 110.4MB in the beginning and 127.2MB in the end (delta: -16.9MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. [2022-10-15 16:45:54,651 INFO L158 Benchmark]: TraceAbstraction took 3007.39ms. Allocated memory was 153.1MB in the beginning and 206.6MB in the end (delta: 53.5MB). Free memory was 126.7MB in the beginning and 118.5MB in the end (delta: 8.2MB). Peak memory consumption was 62.7MB. Max. memory is 8.0GB. [2022-10-15 16:45:54,654 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 153.1MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 300.64ms. Allocated memory is still 153.1MB. Free memory was 126.3MB in the beginning and 115.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.59ms. Allocated memory is still 153.1MB. Free memory was 115.1MB in the beginning and 112.6MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 96.97ms. Allocated memory is still 153.1MB. Free memory was 112.6MB in the beginning and 110.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 964.04ms. Allocated memory is still 153.1MB. Free memory was 110.4MB in the beginning and 127.2MB in the end (delta: -16.9MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. * TraceAbstraction took 3007.39ms. Allocated memory was 153.1MB in the beginning and 206.6MB in the end (delta: 53.5MB). Free memory was 126.7MB in the beginning and 118.5MB in the end (delta: 8.2MB). Peak memory consumption was 62.7MB. 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: 69]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of bitwiseAnd at line 22, overapproximation of memtrack at line 69, overapproximation of someUnaryFLOAToperation at line 64, overapproximation of someBinaryArithmeticFLOAToperation at line 40. Possible FailurePath: [L64] float x = -0.0f; [L65] CALL, EXPR trunc_float(x) [L15] __int32_t signbit, w, exponent_less_127; VAL [\old(x)=6442450951, x=6442450951] [L17] ieee_float_shape_type gf_u; VAL [\old(x)=6442450951, gf_u={5:0}, x=6442450951] [L18] gf_u.value = (x) VAL [\old(x)=6442450951, gf_u={5:0}, x=6442450951] [L19] EXPR gf_u.word VAL [\old(x)=6442450951, gf_u={5:0}, gf_u.word=6442450943, x=6442450951] [L19] (w) = gf_u.word [L21] signbit = w & 0x80000000 VAL [\old(x)=6442450951, signbit=2147483646, signbit = w & 0x80000000=2147483647, w=2147483647, x=6442450951] [L22] exponent_less_127 = ((w & 0x7f800000) >> 23) - 127 VAL [\old(x)=6442450951, exponent_less_127=255, signbit=2147483646, signbit = w & 0x80000000=2147483647, w=2147483647, x=6442450951] [L23] COND FALSE !(exponent_less_127 < 23) VAL [\old(x)=6442450951, exponent_less_127=255, signbit=2147483646, signbit = w & 0x80000000=2147483647, w=2147483647, x=6442450951] [L39] COND TRUE exponent_less_127 == 255 [L40] return x + x; VAL [\old(x)=6442450951, exponent_less_127=255, signbit=2147483646, signbit = w & 0x80000000=2147483647, w=2147483647, x=6442450951] [L65] RET, EXPR trunc_float(x) [L65] float res = trunc_float(x); [L68] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [res=6442450952, res == -0.0f && __signbit_float(res) == 1=0, signbit = w & 0x80000000=2147483647, x=6442450951] [L68] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L69] reach_error() VAL [res=6442450952, signbit = w & 0x80000000=2147483647, x=6442450951] - 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: 57]: 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, 58 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 786 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 333 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 189 IncrementalHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 453 mSDtfsCounter, 189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 24 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 161 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 16:45:54,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...