/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_1251.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 16:46:00,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 16:46:00,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 16:46:00,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 16:46:00,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 16:46:00,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 16:46:00,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 16:46:00,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 16:46:00,825 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 16:46:00,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 16:46:00,835 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 16:46:00,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 16:46:00,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 16:46:00,838 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 16:46:00,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 16:46:00,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 16:46:00,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 16:46:00,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 16:46:00,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 16:46:00,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 16:46:00,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 16:46:00,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 16:46:00,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 16:46:00,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 16:46:00,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 16:46:00,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 16:46:00,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 16:46:00,880 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 16:46:00,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 16:46:00,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 16:46:00,882 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 16:46:00,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 16:46:00,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 16:46:00,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 16:46:00,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 16:46:00,888 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 16:46:00,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 16:46:00,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 16:46:00,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 16:46:00,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 16:46:00,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 16:46:00,892 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:46:00,943 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 16:46:00,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 16:46:00,944 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 16:46:00,945 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 16:46:00,947 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 16:46:00,947 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 16:46:00,949 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 16:46:00,950 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 16:46:00,950 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 16:46:00,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 16:46:00,951 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 16:46:00,951 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 16:46:00,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 16:46:00,952 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 16:46:00,952 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 16:46:00,952 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 16:46:00,952 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 16:46:00,953 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 16:46:00,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 16:46:00,953 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 16:46:00,953 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 16:46:00,953 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 16:46:00,954 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 16:46:00,954 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 16:46:00,954 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 16:46:00,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:46:00,955 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 16:46:00,955 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 16:46:00,955 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 16:46:00,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 16:46:00,955 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:46:01,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 16:46:01,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 16:46:01,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 16:46:01,427 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 16:46:01,428 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 16:46:01,429 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2022-10-15 16:46:01,528 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c60907e8f/eadc2d5aa9b344ccb1e228de9b0cccf1/FLAGb1fb13de5 [2022-10-15 16:46:02,319 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 16:46:02,319 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2022-10-15 16:46:02,331 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c60907e8f/eadc2d5aa9b344ccb1e228de9b0cccf1/FLAGb1fb13de5 [2022-10-15 16:46:02,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c60907e8f/eadc2d5aa9b344ccb1e228de9b0cccf1 [2022-10-15 16:46:02,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 16:46:02,647 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 16:46:02,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 16:46:02,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 16:46:02,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 16:46:02,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:46:02" (1/1) ... [2022-10-15 16:46:02,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44d48063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:02, skipping insertion in model container [2022-10-15 16:46:02,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 04:46:02" (1/1) ... [2022-10-15 16:46:02,671 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 16:46:02,696 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 16:46:02,905 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_1251.c[1980,1993] [2022-10-15 16:46:02,909 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_1251.c[2139,2152] [2022-10-15 16:46:02,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:46:02,920 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 16:46:02,948 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_1251.c[1980,1993] [2022-10-15 16:46:02,950 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_1251.c[2139,2152] [2022-10-15 16:46:02,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 16:46:02,970 INFO L208 MainTranslator]: Completed translation [2022-10-15 16:46:02,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:02 WrapperNode [2022-10-15 16:46:02,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 16:46:02,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 16:46:02,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 16:46:02,973 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 16:46:02,983 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:46:02" (1/1) ... [2022-10-15 16:46:02,994 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:46:02" (1/1) ... [2022-10-15 16:46:03,021 INFO L138 Inliner]: procedures = 18, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 107 [2022-10-15 16:46:03,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 16:46:03,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 16:46:03,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 16:46:03,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 16:46:03,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:02" (1/1) ... [2022-10-15 16:46:03,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:02" (1/1) ... [2022-10-15 16:46:03,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:02" (1/1) ... [2022-10-15 16:46:03,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:02" (1/1) ... [2022-10-15 16:46:03,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:02" (1/1) ... [2022-10-15 16:46:03,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:02" (1/1) ... [2022-10-15 16:46:03,055 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:02" (1/1) ... [2022-10-15 16:46:03,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:02" (1/1) ... [2022-10-15 16:46:03,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 16:46:03,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 16:46:03,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 16:46:03,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 16:46:03,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:02" (1/1) ... [2022-10-15 16:46:03,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 16:46:03,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 16:46:03,111 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:46:03,131 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:46:03,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 16:46:03,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 16:46:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 16:46:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2022-10-15 16:46:03,188 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2022-10-15 16:46:03,188 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2022-10-15 16:46:03,189 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2022-10-15 16:46:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-10-15 16:46:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 16:46:03,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 16:46:03,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 16:46:03,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 16:46:03,290 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 16:46:03,294 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 16:46:03,663 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 16:46:03,673 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 16:46:03,674 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 16:46:03,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:46:03 BoogieIcfgContainer [2022-10-15 16:46:03,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 16:46:03,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 16:46:03,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 16:46:03,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 16:46:03,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 04:46:02" (1/3) ... [2022-10-15 16:46:03,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd6cc8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:46:03, skipping insertion in model container [2022-10-15 16:46:03,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 04:46:02" (2/3) ... [2022-10-15 16:46:03,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd6cc8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 04:46:03, skipping insertion in model container [2022-10-15 16:46:03,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 04:46:03" (3/3) ... [2022-10-15 16:46:03,689 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2022-10-15 16:46:03,759 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 16:46:03,759 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-10-15 16:46:03,884 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 16:46:03,901 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;@3b9638ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 16:46:03,902 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-10-15 16:46:03,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 52 states have internal predecessors, (69), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-10-15 16:46:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-15 16:46:03,932 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:03,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:03,936 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2022-10-15 16:46:03,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:03,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1894511603, now seen corresponding path program 1 times [2022-10-15 16:46:03,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:03,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370168221] [2022-10-15 16:46:03,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:03,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:04,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:46:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:04,358 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:46:04,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:04,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370168221] [2022-10-15 16:46:04,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370168221] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:04,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:04,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-15 16:46:04,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080400034] [2022-10-15 16:46:04,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:04,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:04,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:04,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:04,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:04,431 INFO L87 Difference]: Start difference. First operand has 65 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 52 states have internal predecessors, (69), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 16:46:04,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:04,517 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2022-10-15 16:46:04,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:04,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-10-15 16:46:04,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:04,538 INFO L225 Difference]: With dead ends: 66 [2022-10-15 16:46:04,538 INFO L226 Difference]: Without dead ends: 64 [2022-10-15 16:46:04,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:46:04,555 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:04,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:46:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-10-15 16:46:04,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-10-15 16:46:04,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 51 states have internal predecessors, (64), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-10-15 16:46:04,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2022-10-15 16:46:04,622 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 13 [2022-10-15 16:46:04,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:04,624 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2022-10-15 16:46:04,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 16:46:04,625 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2022-10-15 16:46:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-10-15 16:46:04,627 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:04,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:04,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 16:46:04,628 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __fpclassify_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2022-10-15 16:46:04,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:04,630 INFO L85 PathProgramCache]: Analyzing trace with hash -493474965, now seen corresponding path program 1 times [2022-10-15 16:46:04,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:04,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104799] [2022-10-15 16:46:04,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:04,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:04,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:46:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:04,733 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:46:04,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:04,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104799] [2022-10-15 16:46:04,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104799] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:04,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:04,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:46:04,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758358686] [2022-10-15 16:46:04,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:04,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:46:04,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:04,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:46:04,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:46:04,740 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 16:46:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:04,793 INFO L93 Difference]: Finished difference Result 73 states and 97 transitions. [2022-10-15 16:46:04,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:46:04,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-10-15 16:46:04,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:04,797 INFO L225 Difference]: With dead ends: 73 [2022-10-15 16:46:04,797 INFO L226 Difference]: Without dead ends: 73 [2022-10-15 16:46:04,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:46:04,800 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 16 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:04,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 228 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:46:04,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-10-15 16:46:04,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2022-10-15 16:46:04,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 53 states have internal predecessors, (66), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-10-15 16:46:04,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2022-10-15 16:46:04,815 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 15 [2022-10-15 16:46:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:04,816 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2022-10-15 16:46:04,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 16:46:04,817 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2022-10-15 16:46:04,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 16:46:04,818 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:04,818 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:04,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 16:46:04,819 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __fpclassify_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2022-10-15 16:46:04,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:04,820 INFO L85 PathProgramCache]: Analyzing trace with hash -421505872, now seen corresponding path program 1 times [2022-10-15 16:46:04,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:04,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421864367] [2022-10-15 16:46:04,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:04,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:04,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:46:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:05,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 16:46:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:05,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 16:46:05,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:05,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421864367] [2022-10-15 16:46:05,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421864367] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:05,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:05,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:05,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775481873] [2022-10-15 16:46:05,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:05,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:05,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:05,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:05,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:05,013 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:46:05,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:05,055 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2022-10-15 16:46:05,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:05,056 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-10-15 16:46:05,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:05,058 INFO L225 Difference]: With dead ends: 64 [2022-10-15 16:46:05,058 INFO L226 Difference]: Without dead ends: 64 [2022-10-15 16:46:05,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:46:05,063 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:05,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 148 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:46:05,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-10-15 16:46:05,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-10-15 16:46:05,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 51 states have internal predecessors, (64), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-10-15 16:46:05,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2022-10-15 16:46:05,087 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 20 [2022-10-15 16:46:05,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:05,094 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2022-10-15 16:46:05,095 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:46:05,095 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2022-10-15 16:46:05,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 16:46:05,096 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:05,096 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:05,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 16:46:05,097 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __fpclassify_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2022-10-15 16:46:05,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:05,098 INFO L85 PathProgramCache]: Analyzing trace with hash -421505871, now seen corresponding path program 1 times [2022-10-15 16:46:05,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:05,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596105299] [2022-10-15 16:46:05,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:05,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:05,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:46:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:05,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 16:46:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:05,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 16:46:05,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:05,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596105299] [2022-10-15 16:46:05,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596105299] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:05,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:05,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:05,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937873505] [2022-10-15 16:46:05,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:05,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:05,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:05,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:05,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:05,293 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:46:05,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:05,316 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2022-10-15 16:46:05,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:05,319 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-10-15 16:46:05,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:05,321 INFO L225 Difference]: With dead ends: 62 [2022-10-15 16:46:05,325 INFO L226 Difference]: Without dead ends: 62 [2022-10-15 16:46:05,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:46:05,327 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:05,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 150 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:46:05,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-10-15 16:46:05,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-10-15 16:46:05,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 49 states have internal predecessors, (62), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-10-15 16:46:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2022-10-15 16:46:05,353 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 20 [2022-10-15 16:46:05,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:05,358 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2022-10-15 16:46:05,359 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), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:46:05,359 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2022-10-15 16:46:05,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-10-15 16:46:05,360 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:05,360 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:05,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 16:46:05,363 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2022-10-15 16:46:05,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:05,364 INFO L85 PathProgramCache]: Analyzing trace with hash -831839209, now seen corresponding path program 1 times [2022-10-15 16:46:05,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:05,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092677619] [2022-10-15 16:46:05,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:05,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:05,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:46:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:05,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 16:46:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:05,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 16:46:05,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:05,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092677619] [2022-10-15 16:46:05,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092677619] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:05,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:05,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 16:46:05,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392333784] [2022-10-15 16:46:05,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:05,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 16:46:05,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:05,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 16:46:05,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 16:46:05,469 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:46:05,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:05,509 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2022-10-15 16:46:05,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 16:46:05,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-10-15 16:46:05,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:05,511 INFO L225 Difference]: With dead ends: 64 [2022-10-15 16:46:05,511 INFO L226 Difference]: Without dead ends: 62 [2022-10-15 16:46:05,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:46:05,514 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 6 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:05,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 127 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 16:46:05,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-10-15 16:46:05,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-10-15 16:46:05,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 48 states have internal predecessors, (60), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-10-15 16:46:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2022-10-15 16:46:05,524 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 20 [2022-10-15 16:46:05,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:05,525 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2022-10-15 16:46:05,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-10-15 16:46:05,525 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2022-10-15 16:46:05,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-15 16:46:05,527 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:05,527 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:05,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 16:46:05,528 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2022-10-15 16:46:05,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:05,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2003222684, now seen corresponding path program 1 times [2022-10-15 16:46:05,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:05,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225524985] [2022-10-15 16:46:05,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:05,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:05,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:46:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:05,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 16:46:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:05,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:46:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:05,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-10-15 16:46:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:46:05,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:05,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225524985] [2022-10-15 16:46:05,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225524985] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:05,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:05,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:46:05,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514755740] [2022-10-15 16:46:05,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:05,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:46:05,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:05,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:46:05,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:46:05,810 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:46:05,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:05,904 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-10-15 16:46:05,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:46:05,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-10-15 16:46:05,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:05,911 INFO L225 Difference]: With dead ends: 65 [2022-10-15 16:46:05,912 INFO L226 Difference]: Without dead ends: 65 [2022-10-15 16:46:05,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:46:05,917 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 3 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:05,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 244 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:05,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-10-15 16:46:05,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-10-15 16:46:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 51 states have internal predecessors, (63), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2022-10-15 16:46:05,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2022-10-15 16:46:05,941 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 37 [2022-10-15 16:46:05,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:05,942 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2022-10-15 16:46:05,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:46:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-10-15 16:46:05,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-10-15 16:46:05,946 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:05,946 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:05,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-15 16:46:05,947 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2022-10-15 16:46:05,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:05,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1937504656, now seen corresponding path program 1 times [2022-10-15 16:46:05,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:05,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422023797] [2022-10-15 16:46:05,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:05,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:06,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:46:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:06,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 16:46:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:06,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:46:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:06,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-10-15 16:46:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:46:06,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:06,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422023797] [2022-10-15 16:46:06,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422023797] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:06,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:06,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:46:06,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227700063] [2022-10-15 16:46:06,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:06,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:46:06,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:06,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:46:06,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:46:06,189 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:46:06,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:06,287 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2022-10-15 16:46:06,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:46:06,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-10-15 16:46:06,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:06,290 INFO L225 Difference]: With dead ends: 69 [2022-10-15 16:46:06,290 INFO L226 Difference]: Without dead ends: 69 [2022-10-15 16:46:06,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:46:06,292 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 3 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:06,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 260 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:06,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-10-15 16:46:06,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2022-10-15 16:46:06,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 51 states have internal predecessors, (63), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2022-10-15 16:46:06,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2022-10-15 16:46:06,302 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 38 [2022-10-15 16:46:06,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:06,302 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2022-10-15 16:46:06,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:46:06,303 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-10-15 16:46:06,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-10-15 16:46:06,305 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:06,305 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:06,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 16:46:06,306 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2022-10-15 16:46:06,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:06,306 INFO L85 PathProgramCache]: Analyzing trace with hash -2121988712, now seen corresponding path program 1 times [2022-10-15 16:46:06,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:06,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898614726] [2022-10-15 16:46:06,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:06,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:06,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:46:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:06,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 16:46:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:06,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:46:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:06,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-10-15 16:46:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:46:06,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:06,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898614726] [2022-10-15 16:46:06,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898614726] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:06,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:06,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:46:06,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514130399] [2022-10-15 16:46:06,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:06,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:46:06,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:06,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:46:06,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:46:06,458 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:46:06,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:06,540 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2022-10-15 16:46:06,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:46:06,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2022-10-15 16:46:06,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:06,542 INFO L225 Difference]: With dead ends: 69 [2022-10-15 16:46:06,542 INFO L226 Difference]: Without dead ends: 69 [2022-10-15 16:46:06,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:46:06,544 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 3 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:06,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 260 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:06,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-10-15 16:46:06,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2022-10-15 16:46:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 51 states have internal predecessors, (63), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2022-10-15 16:46:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2022-10-15 16:46:06,552 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 39 [2022-10-15 16:46:06,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:06,553 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2022-10-15 16:46:06,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:46:06,554 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-10-15 16:46:06,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-15 16:46:06,555 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:06,556 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:06,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 16:46:06,556 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2022-10-15 16:46:06,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:06,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1139498740, now seen corresponding path program 1 times [2022-10-15 16:46:06,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:06,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070427359] [2022-10-15 16:46:06,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:06,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:06,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:46:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:06,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 16:46:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:06,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:46:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:06,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-15 16:46:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:06,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:46:06,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:06,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070427359] [2022-10-15 16:46:06,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070427359] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:06,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:06,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 16:46:06,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84303329] [2022-10-15 16:46:06,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:06,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 16:46:06,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:06,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 16:46:06,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:46:06,724 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:46:06,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:06,813 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2022-10-15 16:46:06,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 16:46:06,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-10-15 16:46:06,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:06,815 INFO L225 Difference]: With dead ends: 69 [2022-10-15 16:46:06,815 INFO L226 Difference]: Without dead ends: 69 [2022-10-15 16:46:06,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 16:46:06,820 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 3 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:06,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 260 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:06,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-10-15 16:46:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2022-10-15 16:46:06,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 51 states have internal predecessors, (63), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2022-10-15 16:46:06,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2022-10-15 16:46:06,845 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 40 [2022-10-15 16:46:06,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:06,846 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2022-10-15 16:46:06,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-15 16:46:06,847 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-10-15 16:46:06,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-15 16:46:06,852 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:06,853 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:06,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 16:46:06,853 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2022-10-15 16:46:06,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:06,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1645057365, now seen corresponding path program 1 times [2022-10-15 16:46:06,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:06,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610842947] [2022-10-15 16:46:06,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:06,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:06,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 16:46:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:06,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-15 16:46:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:06,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-15 16:46:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:06,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-15 16:46:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 16:46:06,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-15 16:46:06,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 16:46:06,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610842947] [2022-10-15 16:46:06,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610842947] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 16:46:06,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 16:46:06,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 16:46:06,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093681414] [2022-10-15 16:46:06,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 16:46:06,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 16:46:06,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 16:46:06,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 16:46:06,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:46:06,982 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-15 16:46:07,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 16:46:07,050 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2022-10-15 16:46:07,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 16:46:07,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2022-10-15 16:46:07,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 16:46:07,055 INFO L225 Difference]: With dead ends: 66 [2022-10-15 16:46:07,056 INFO L226 Difference]: Without dead ends: 66 [2022-10-15 16:46:07,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 16:46:07,058 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 16:46:07,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 185 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 16:46:07,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-10-15 16:46:07,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-10-15 16:46:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 50 states have (on average 1.28) internal successors, (64), 52 states have internal predecessors, (64), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 11 states have call predecessors, (12), 10 states have call successors, (12) [2022-10-15 16:46:07,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2022-10-15 16:46:07,079 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 40 [2022-10-15 16:46:07,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 16:46:07,080 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2022-10-15 16:46:07,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-15 16:46:07,083 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2022-10-15 16:46:07,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-10-15 16:46:07,084 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 16:46:07,084 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:07,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 16:46:07,085 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2022-10-15 16:46:07,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 16:46:07,086 INFO L85 PathProgramCache]: Analyzing trace with hash -241678148, now seen corresponding path program 1 times [2022-10-15 16:46:07,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 16:46:07,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049882192] [2022-10-15 16:46:07,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 16:46:07,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 16:46:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:46:07,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 16:46:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 16:46:07,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 16:46:07,216 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 16:46:07,217 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2022-10-15 16:46:07,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2022-10-15 16:46:07,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2022-10-15 16:46:07,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __fpclassify_floatErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2022-10-15 16:46:07,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __fpclassify_floatErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2022-10-15 16:46:07,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __fpclassify_floatErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 7 remaining) [2022-10-15 16:46:07,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __fpclassify_floatErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 7 remaining) [2022-10-15 16:46:07,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-15 16:46:07,228 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 16:46:07,233 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 16:46:07,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 04:46:07 BoogieIcfgContainer [2022-10-15 16:46:07,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 16:46:07,308 INFO L158 Benchmark]: Toolchain (without parser) took 4665.42ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 126.7MB in the beginning and 169.7MB in the end (delta: -43.0MB). Peak memory consumption was 105.0MB. Max. memory is 8.0GB. [2022-10-15 16:46:07,308 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 151.0MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 16:46:07,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.03ms. Allocated memory is still 151.0MB. Free memory was 126.5MB in the beginning and 116.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-10-15 16:46:07,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.37ms. Allocated memory is still 151.0MB. Free memory was 116.0MB in the beginning and 114.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-15 16:46:07,310 INFO L158 Benchmark]: Boogie Preprocessor took 37.51ms. Allocated memory is still 151.0MB. Free memory was 114.2MB in the beginning and 112.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 16:46:07,310 INFO L158 Benchmark]: RCFGBuilder took 616.16ms. Allocated memory is still 151.0MB. Free memory was 112.7MB in the beginning and 97.6MB in the end (delta: 15.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-10-15 16:46:07,312 INFO L158 Benchmark]: TraceAbstraction took 3626.26ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 96.8MB in the beginning and 169.7MB in the end (delta: -72.9MB). Peak memory consumption was 74.6MB. Max. memory is 8.0GB. [2022-10-15 16:46:07,315 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.25ms. Allocated memory is still 151.0MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 319.03ms. Allocated memory is still 151.0MB. Free memory was 126.5MB in the beginning and 116.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.37ms. Allocated memory is still 151.0MB. Free memory was 116.0MB in the beginning and 114.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.51ms. Allocated memory is still 151.0MB. Free memory was 114.2MB in the beginning and 112.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 616.16ms. Allocated memory is still 151.0MB. Free memory was 112.7MB in the beginning and 97.6MB in the end (delta: 15.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 3626.26ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 96.8MB in the beginning and 169.7MB in the end (delta: -72.9MB). Peak memory consumption was 74.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 76]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of memtrack at line 76. Possible FailurePath: [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L69] CALL, EXPR isnan_float(x) VAL [\old(x)=4286578697] [L57] return x != x; VAL [\old(x)=4286578697, \result=1, x=4286578697] [L69] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, x=4286578697] [L69] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, x=4286578697] [L69] CALL, EXPR isnan_float(y) VAL [\old(x)=4286578696] [L57] return x != x; VAL [\old(x)=4286578696, \result=0, x=4286578696] [L69] RET, EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=4286578697, y=4286578696] [L69] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=4286578697, y=4286578696] [L69-L70] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) VAL [(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))=1, isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=4286578697, y=4286578696] [L69-L70] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L72] CALL, EXPR fmax_float(x, y) [L46] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=4286578697] [L23] __uint32_t w; VAL [\old(x)=4286578697, x=4286578697] [L26] ieee_float_shape_type gf_u; VAL [\old(x)=4286578697, gf_u={5:0}, x=4286578697] [L27] gf_u.value = (x) VAL [\old(x)=4286578697, gf_u={5:0}, x=4286578697] [L28] EXPR gf_u.word VAL [\old(x)=4286578697, gf_u={5:0}, gf_u.word=4286578689, x=4286578697] [L28] (w) = gf_u.word [L31] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=4286578697, w=4286578689, x=4286578697] [L33-L34] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=4286578697, w=4286578689, x=4286578697] [L36-L37] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=4286578697, w=4286578689, x=4286578697] [L39] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L42] return 0; VAL [\old(x)=4286578697, \result=0, w=4286578689, x=4286578697] [L46] RET, EXPR __fpclassify_float(x) VAL [\old(x)=4286578697, \old(y)=4286578696, __fpclassify_float(x)=0, x=4286578697, y=4286578696] [L46] COND TRUE __fpclassify_float(x) == 0 [L47] return y; VAL [\old(x)=4286578697, \old(y)=4286578696, \result=4286578696, x=4286578697, y=4286578696] [L72] RET, EXPR fmax_float(x, y) [L72] float res = fmax_float(x, y); [L75] CALL, EXPR isnan_float(x) VAL [\old(x)=4286578697] [L57] return x != x; VAL [\old(x)=4286578697, \result=1, x=4286578697] [L75] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, res=4286578696, x=4286578697, y=4286578696] [L75] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, res=4286578696, x=4286578697, y=4286578696] [L75] CALL, EXPR isnan_float(y) VAL [\old(x)=4286578696] [L57] return x != x; VAL [\old(x)=4286578696, \result=0, x=4286578696] [L75] RET, EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=4286578696, x=4286578697, y=4286578696] [L75] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=4286578696, x=4286578697, y=4286578696] [L75] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L76] reach_error() VAL [res=4286578696, x=4286578697, y=4286578696] - UnprovableResult [Line: 82]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 59]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 47 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 2024 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1235 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 302 IncrementalHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 789 mSDtfsCounter, 302 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=2, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 20 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 427 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 54/54 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:46:07,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...