./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-optional-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-optional-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8287e6117d458104c3f33a0e7a83f771b50c3974e23296edc32c92f0b8cae546 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 19:19:10,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 19:19:10,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 19:19:10,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 19:19:10,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 19:19:10,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 19:19:10,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 19:19:10,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 19:19:10,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 19:19:10,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 19:19:10,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 19:19:10,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 19:19:10,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 19:19:10,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 19:19:10,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 19:19:10,929 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 19:19:10,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 19:19:10,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 19:19:10,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 19:19:10,934 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 19:19:10,936 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 19:19:10,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 19:19:10,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 19:19:10,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 19:19:10,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 19:19:10,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 19:19:10,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 19:19:10,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 19:19:10,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 19:19:10,944 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 19:19:10,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 19:19:10,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 19:19:10,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 19:19:10,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 19:19:10,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 19:19:10,948 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 19:19:10,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 19:19:10,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 19:19:10,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 19:19:10,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 19:19:10,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 19:19:10,950 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-12-18 19:19:10,977 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 19:19:10,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 19:19:10,977 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 19:19:10,978 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 19:19:10,978 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 19:19:10,978 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 19:19:10,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 19:19:10,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 19:19:10,979 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 19:19:10,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 19:19:10,980 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 19:19:10,980 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 19:19:10,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 19:19:10,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 19:19:10,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 19:19:10,981 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 19:19:10,981 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 19:19:10,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 19:19:10,981 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 19:19:10,982 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 19:19:10,982 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 19:19:10,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 19:19:10,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 19:19:10,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 19:19:10,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 19:19:10,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 19:19:10,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 19:19:10,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 19:19:10,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 19:19:10,984 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 19:19:10,984 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8287e6117d458104c3f33a0e7a83f771b50c3974e23296edc32c92f0b8cae546 [2021-12-18 19:19:11,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 19:19:11,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 19:19:11,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 19:19:11,194 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 19:19:11,194 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 19:19:11,195 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-optional-2.i [2021-12-18 19:19:11,238 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9a5a73b8/3d75975d13f54bb29156eaaf969f47b2/FLAGebc6d2d63 [2021-12-18 19:19:11,670 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 19:19:11,671 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-2.i [2021-12-18 19:19:11,684 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9a5a73b8/3d75975d13f54bb29156eaaf969f47b2/FLAGebc6d2d63 [2021-12-18 19:19:11,694 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9a5a73b8/3d75975d13f54bb29156eaaf969f47b2 [2021-12-18 19:19:11,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 19:19:11,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 19:19:11,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 19:19:11,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 19:19:11,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 19:19:11,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:19:11" (1/1) ... [2021-12-18 19:19:11,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@328a789d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:11, skipping insertion in model container [2021-12-18 19:19:11,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:19:11" (1/1) ... [2021-12-18 19:19:11,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 19:19:11,740 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 19:19:11,913 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/forester-heap/dll-optional-2.i[22706,22719] [2021-12-18 19:19:11,917 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 19:19:11,921 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 19:19:11,945 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/forester-heap/dll-optional-2.i[22706,22719] [2021-12-18 19:19:11,948 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 19:19:11,971 INFO L208 MainTranslator]: Completed translation [2021-12-18 19:19:11,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:11 WrapperNode [2021-12-18 19:19:11,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 19:19:11,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 19:19:11,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 19:19:11,973 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 19:19:11,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:11" (1/1) ... [2021-12-18 19:19:11,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:11" (1/1) ... [2021-12-18 19:19:12,004 INFO L137 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2021-12-18 19:19:12,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 19:19:12,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 19:19:12,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 19:19:12,006 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 19:19:12,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:11" (1/1) ... [2021-12-18 19:19:12,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:11" (1/1) ... [2021-12-18 19:19:12,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:11" (1/1) ... [2021-12-18 19:19:12,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:11" (1/1) ... [2021-12-18 19:19:12,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:11" (1/1) ... [2021-12-18 19:19:12,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:11" (1/1) ... [2021-12-18 19:19:12,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:11" (1/1) ... [2021-12-18 19:19:12,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 19:19:12,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 19:19:12,027 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 19:19:12,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 19:19:12,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:11" (1/1) ... [2021-12-18 19:19:12,032 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 19:19:12,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 19:19:12,048 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) [2021-12-18 19:19:12,064 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 [2021-12-18 19:19:12,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 19:19:12,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 19:19:12,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 19:19:12,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 19:19:12,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 19:19:12,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 19:19:12,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 19:19:12,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 19:19:12,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 19:19:12,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 19:19:12,147 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 19:19:12,149 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 19:19:12,513 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 19:19:12,521 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 19:19:12,521 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-18 19:19:12,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:19:12 BoogieIcfgContainer [2021-12-18 19:19:12,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 19:19:12,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 19:19:12,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 19:19:12,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 19:19:12,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:19:11" (1/3) ... [2021-12-18 19:19:12,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e83bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:19:12, skipping insertion in model container [2021-12-18 19:19:12,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:19:11" (2/3) ... [2021-12-18 19:19:12,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e83bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:19:12, skipping insertion in model container [2021-12-18 19:19:12,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:19:12" (3/3) ... [2021-12-18 19:19:12,529 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-optional-2.i [2021-12-18 19:19:12,532 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 19:19:12,533 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2021-12-18 19:19:12,566 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 19:19:12,574 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 19:19:12,574 INFO L340 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2021-12-18 19:19:12,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 71 states have (on average 2.140845070422535) internal successors, (152), 137 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:12,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 19:19:12,600 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:12,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 19:19:12,601 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-18 19:19:12,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:12,605 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-18 19:19:12,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:12,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177042338] [2021-12-18 19:19:12,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:12,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:12,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:12,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:12,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177042338] [2021-12-18 19:19:12,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177042338] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:12,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:12,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 19:19:12,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886438238] [2021-12-18 19:19:12,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:12,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 19:19:12,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:12,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 19:19:12,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 19:19:12,747 INFO L87 Difference]: Start difference. First operand has 138 states, 71 states have (on average 2.140845070422535) internal successors, (152), 137 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:12,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:12,889 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2021-12-18 19:19:12,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 19:19:12,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-18 19:19:12,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:12,901 INFO L225 Difference]: With dead ends: 139 [2021-12-18 19:19:12,902 INFO L226 Difference]: Without dead ends: 135 [2021-12-18 19:19:12,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 19:19:12,905 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 120 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:12,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 76 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-18 19:19:12,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 129. [2021-12-18 19:19:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 73 states have (on average 1.904109589041096) internal successors, (139), 128 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:12,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2021-12-18 19:19:12,933 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 3 [2021-12-18 19:19:12,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:12,933 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2021-12-18 19:19:12,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:12,933 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2021-12-18 19:19:12,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 19:19:12,933 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:12,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 19:19:12,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 19:19:12,934 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-18 19:19:12,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:12,937 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-18 19:19:12,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:12,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644243594] [2021-12-18 19:19:12,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:12,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:12,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:12,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:12,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644243594] [2021-12-18 19:19:12,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644243594] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:12,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:12,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 19:19:12,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269413068] [2021-12-18 19:19:12,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:12,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 19:19:12,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:12,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 19:19:12,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 19:19:12,989 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:13,078 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2021-12-18 19:19:13,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 19:19:13,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-18 19:19:13,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:13,079 INFO L225 Difference]: With dead ends: 124 [2021-12-18 19:19:13,081 INFO L226 Difference]: Without dead ends: 124 [2021-12-18 19:19:13,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 19:19:13,082 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 96 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:13,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 89 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:13,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-18 19:19:13,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2021-12-18 19:19:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 73 states have (on average 1.7808219178082192) internal successors, (130), 119 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2021-12-18 19:19:13,096 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 3 [2021-12-18 19:19:13,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:13,097 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2021-12-18 19:19:13,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,097 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2021-12-18 19:19:13,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-18 19:19:13,098 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:13,098 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:13,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 19:19:13,098 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-18 19:19:13,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:13,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1483656077, now seen corresponding path program 1 times [2021-12-18 19:19:13,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:13,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037872891] [2021-12-18 19:19:13,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:13,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:13,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:13,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037872891] [2021-12-18 19:19:13,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037872891] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:13,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:13,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 19:19:13,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896774507] [2021-12-18 19:19:13,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:13,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 19:19:13,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:13,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 19:19:13,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 19:19:13,170 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:13,305 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2021-12-18 19:19:13,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 19:19:13,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-18 19:19:13,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:13,306 INFO L225 Difference]: With dead ends: 149 [2021-12-18 19:19:13,306 INFO L226 Difference]: Without dead ends: 149 [2021-12-18 19:19:13,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 19:19:13,307 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 34 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:13,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 286 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:13,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-18 19:19:13,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 119. [2021-12-18 19:19:13,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 73 states have (on average 1.7671232876712328) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2021-12-18 19:19:13,312 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 12 [2021-12-18 19:19:13,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:13,313 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2021-12-18 19:19:13,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,313 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2021-12-18 19:19:13,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-18 19:19:13,313 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:13,314 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:13,314 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 19:19:13,314 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-18 19:19:13,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:13,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1483656076, now seen corresponding path program 1 times [2021-12-18 19:19:13,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:13,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692211114] [2021-12-18 19:19:13,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:13,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:13,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:13,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692211114] [2021-12-18 19:19:13,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692211114] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:13,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:13,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 19:19:13,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448171435] [2021-12-18 19:19:13,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:13,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 19:19:13,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:13,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 19:19:13,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 19:19:13,379 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:13,503 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2021-12-18 19:19:13,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 19:19:13,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-18 19:19:13,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:13,513 INFO L225 Difference]: With dead ends: 118 [2021-12-18 19:19:13,513 INFO L226 Difference]: Without dead ends: 118 [2021-12-18 19:19:13,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 19:19:13,514 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 2 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:13,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 316 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:13,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-18 19:19:13,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-12-18 19:19:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 73 states have (on average 1.7534246575342465) internal successors, (128), 117 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2021-12-18 19:19:13,518 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 12 [2021-12-18 19:19:13,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:13,518 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2021-12-18 19:19:13,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,519 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2021-12-18 19:19:13,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 19:19:13,519 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:13,519 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:13,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 19:19:13,519 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-18 19:19:13,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:13,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1002115696, now seen corresponding path program 1 times [2021-12-18 19:19:13,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:13,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634035786] [2021-12-18 19:19:13,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:13,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:13,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:13,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634035786] [2021-12-18 19:19:13,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634035786] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:13,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:13,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 19:19:13,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176683793] [2021-12-18 19:19:13,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:13,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 19:19:13,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:13,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 19:19:13,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 19:19:13,617 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:13,738 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2021-12-18 19:19:13,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 19:19:13,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-18 19:19:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:13,739 INFO L225 Difference]: With dead ends: 121 [2021-12-18 19:19:13,740 INFO L226 Difference]: Without dead ends: 121 [2021-12-18 19:19:13,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 19:19:13,741 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 153 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:13,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 67 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-18 19:19:13,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 112. [2021-12-18 19:19:13,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.6075949367088607) internal successors, (127), 111 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2021-12-18 19:19:13,745 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 13 [2021-12-18 19:19:13,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:13,745 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2021-12-18 19:19:13,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,746 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2021-12-18 19:19:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 19:19:13,746 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:13,746 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:13,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 19:19:13,746 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-18 19:19:13,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:13,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1002115697, now seen corresponding path program 1 times [2021-12-18 19:19:13,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:13,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813863442] [2021-12-18 19:19:13,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:13,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:13,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:13,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:13,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813863442] [2021-12-18 19:19:13,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813863442] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:13,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:13,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 19:19:13,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460711041] [2021-12-18 19:19:13,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:13,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 19:19:13,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:13,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 19:19:13,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 19:19:13,834 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:13,991 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2021-12-18 19:19:13,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 19:19:13,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-18 19:19:13,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:13,992 INFO L225 Difference]: With dead ends: 159 [2021-12-18 19:19:13,992 INFO L226 Difference]: Without dead ends: 159 [2021-12-18 19:19:13,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-18 19:19:13,993 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 270 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:13,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 126 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:13,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-18 19:19:13,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2021-12-18 19:19:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 101 states have (on average 1.5346534653465347) internal successors, (155), 133 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2021-12-18 19:19:13,997 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 13 [2021-12-18 19:19:13,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:13,997 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2021-12-18 19:19:13,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:13,998 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2021-12-18 19:19:13,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-18 19:19:13,998 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:13,998 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:13,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 19:19:13,999 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-18 19:19:13,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:13,999 INFO L85 PathProgramCache]: Analyzing trace with hash -288943149, now seen corresponding path program 1 times [2021-12-18 19:19:13,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:13,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260975674] [2021-12-18 19:19:13,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:14,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:14,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:14,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:14,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260975674] [2021-12-18 19:19:14,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260975674] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:14,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:14,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 19:19:14,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358288417] [2021-12-18 19:19:14,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:14,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 19:19:14,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:14,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 19:19:14,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 19:19:14,049 INFO L87 Difference]: Start difference. First operand 134 states and 155 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:14,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:14,167 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2021-12-18 19:19:14,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 19:19:14,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-18 19:19:14,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:14,168 INFO L225 Difference]: With dead ends: 133 [2021-12-18 19:19:14,169 INFO L226 Difference]: Without dead ends: 133 [2021-12-18 19:19:14,169 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 19:19:14,169 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 9 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:14,170 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 263 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:14,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-18 19:19:14,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-12-18 19:19:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 101 states have (on average 1.5148514851485149) internal successors, (153), 132 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:14,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2021-12-18 19:19:14,175 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 16 [2021-12-18 19:19:14,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:14,176 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2021-12-18 19:19:14,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:14,176 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2021-12-18 19:19:14,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-18 19:19:14,176 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:14,177 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:14,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 19:19:14,177 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-18 19:19:14,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:14,177 INFO L85 PathProgramCache]: Analyzing trace with hash -288943148, now seen corresponding path program 1 times [2021-12-18 19:19:14,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:14,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437903] [2021-12-18 19:19:14,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:14,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:14,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:14,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:14,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437903] [2021-12-18 19:19:14,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437903] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:14,245 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:14,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 19:19:14,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490547806] [2021-12-18 19:19:14,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:14,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 19:19:14,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:14,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 19:19:14,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 19:19:14,246 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:14,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:14,346 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2021-12-18 19:19:14,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 19:19:14,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-18 19:19:14,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:14,348 INFO L225 Difference]: With dead ends: 132 [2021-12-18 19:19:14,348 INFO L226 Difference]: Without dead ends: 132 [2021-12-18 19:19:14,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 19:19:14,349 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 4 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:14,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 258 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:14,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-18 19:19:14,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-12-18 19:19:14,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 101 states have (on average 1.495049504950495) internal successors, (151), 131 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 151 transitions. [2021-12-18 19:19:14,352 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 151 transitions. Word has length 16 [2021-12-18 19:19:14,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:14,352 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 151 transitions. [2021-12-18 19:19:14,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:14,352 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 151 transitions. [2021-12-18 19:19:14,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-18 19:19:14,353 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:14,353 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:14,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 19:19:14,353 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-18 19:19:14,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:14,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1503593626, now seen corresponding path program 1 times [2021-12-18 19:19:14,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:14,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552907383] [2021-12-18 19:19:14,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:14,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 19:19:14,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 19:19:14,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 19:19:14,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552907383] [2021-12-18 19:19:14,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552907383] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 19:19:14,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 19:19:14,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 19:19:14,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91176119] [2021-12-18 19:19:14,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 19:19:14,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 19:19:14,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 19:19:14,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 19:19:14,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 19:19:14,383 INFO L87 Difference]: Start difference. First operand 132 states and 151 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:14,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 19:19:14,465 INFO L93 Difference]: Finished difference Result 149 states and 164 transitions. [2021-12-18 19:19:14,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 19:19:14,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-18 19:19:14,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 19:19:14,466 INFO L225 Difference]: With dead ends: 149 [2021-12-18 19:19:14,466 INFO L226 Difference]: Without dead ends: 149 [2021-12-18 19:19:14,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 19:19:14,467 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 112 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 19:19:14,468 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 143 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 19:19:14,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-18 19:19:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 132. [2021-12-18 19:19:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 101 states have (on average 1.4752475247524752) internal successors, (149), 131 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:14,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2021-12-18 19:19:14,470 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 18 [2021-12-18 19:19:14,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 19:19:14,470 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2021-12-18 19:19:14,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 19:19:14,471 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2021-12-18 19:19:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-18 19:19:14,471 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 19:19:14,471 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:14,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 19:19:14,472 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-12-18 19:19:14,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 19:19:14,472 INFO L85 PathProgramCache]: Analyzing trace with hash -610482213, now seen corresponding path program 1 times [2021-12-18 19:19:14,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 19:19:14,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258011572] [2021-12-18 19:19:14,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 19:19:14,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 19:19:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 19:19:14,484 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-18 19:19:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 19:19:14,514 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-18 19:19:14,515 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-18 19:19:14,515 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK (65 of 66 remaining) [2021-12-18 19:19:14,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (64 of 66 remaining) [2021-12-18 19:19:14,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (63 of 66 remaining) [2021-12-18 19:19:14,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (62 of 66 remaining) [2021-12-18 19:19:14,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (61 of 66 remaining) [2021-12-18 19:19:14,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (60 of 66 remaining) [2021-12-18 19:19:14,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (59 of 66 remaining) [2021-12-18 19:19:14,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (58 of 66 remaining) [2021-12-18 19:19:14,517 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (57 of 66 remaining) [2021-12-18 19:19:14,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (56 of 66 remaining) [2021-12-18 19:19:14,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (55 of 66 remaining) [2021-12-18 19:19:14,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (54 of 66 remaining) [2021-12-18 19:19:14,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (53 of 66 remaining) [2021-12-18 19:19:14,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (52 of 66 remaining) [2021-12-18 19:19:14,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (51 of 66 remaining) [2021-12-18 19:19:14,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (50 of 66 remaining) [2021-12-18 19:19:14,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (49 of 66 remaining) [2021-12-18 19:19:14,518 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (48 of 66 remaining) [2021-12-18 19:19:14,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (47 of 66 remaining) [2021-12-18 19:19:14,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (46 of 66 remaining) [2021-12-18 19:19:14,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (45 of 66 remaining) [2021-12-18 19:19:14,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (44 of 66 remaining) [2021-12-18 19:19:14,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (43 of 66 remaining) [2021-12-18 19:19:14,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (42 of 66 remaining) [2021-12-18 19:19:14,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (41 of 66 remaining) [2021-12-18 19:19:14,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (40 of 66 remaining) [2021-12-18 19:19:14,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (39 of 66 remaining) [2021-12-18 19:19:14,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (38 of 66 remaining) [2021-12-18 19:19:14,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (37 of 66 remaining) [2021-12-18 19:19:14,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (36 of 66 remaining) [2021-12-18 19:19:14,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (35 of 66 remaining) [2021-12-18 19:19:14,519 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (34 of 66 remaining) [2021-12-18 19:19:14,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (33 of 66 remaining) [2021-12-18 19:19:14,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (32 of 66 remaining) [2021-12-18 19:19:14,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (31 of 66 remaining) [2021-12-18 19:19:14,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (30 of 66 remaining) [2021-12-18 19:19:14,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (29 of 66 remaining) [2021-12-18 19:19:14,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (28 of 66 remaining) [2021-12-18 19:19:14,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (27 of 66 remaining) [2021-12-18 19:19:14,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (26 of 66 remaining) [2021-12-18 19:19:14,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (25 of 66 remaining) [2021-12-18 19:19:14,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (24 of 66 remaining) [2021-12-18 19:19:14,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (23 of 66 remaining) [2021-12-18 19:19:14,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (22 of 66 remaining) [2021-12-18 19:19:14,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (21 of 66 remaining) [2021-12-18 19:19:14,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (20 of 66 remaining) [2021-12-18 19:19:14,520 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (19 of 66 remaining) [2021-12-18 19:19:14,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (18 of 66 remaining) [2021-12-18 19:19:14,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (17 of 66 remaining) [2021-12-18 19:19:14,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (16 of 66 remaining) [2021-12-18 19:19:14,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (15 of 66 remaining) [2021-12-18 19:19:14,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION (14 of 66 remaining) [2021-12-18 19:19:14,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (13 of 66 remaining) [2021-12-18 19:19:14,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION (12 of 66 remaining) [2021-12-18 19:19:14,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION (11 of 66 remaining) [2021-12-18 19:19:14,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (10 of 66 remaining) [2021-12-18 19:19:14,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION (9 of 66 remaining) [2021-12-18 19:19:14,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION (8 of 66 remaining) [2021-12-18 19:19:14,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION (7 of 66 remaining) [2021-12-18 19:19:14,521 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE (6 of 66 remaining) [2021-12-18 19:19:14,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE (5 of 66 remaining) [2021-12-18 19:19:14,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE (4 of 66 remaining) [2021-12-18 19:19:14,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE (3 of 66 remaining) [2021-12-18 19:19:14,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (2 of 66 remaining) [2021-12-18 19:19:14,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (1 of 66 remaining) [2021-12-18 19:19:14,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK (0 of 66 remaining) [2021-12-18 19:19:14,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-18 19:19:14,525 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 19:19:14,527 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 19:19:14,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:19:14 BoogieIcfgContainer [2021-12-18 19:19:14,542 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 19:19:14,542 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 19:19:14,542 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 19:19:14,543 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 19:19:14,543 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:19:12" (3/4) ... [2021-12-18 19:19:14,544 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-18 19:19:14,582 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-18 19:19:14,582 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 19:19:14,582 INFO L158 Benchmark]: Toolchain (without parser) took 2884.26ms. Allocated memory was 88.1MB in the beginning and 136.3MB in the end (delta: 48.2MB). Free memory was 55.6MB in the beginning and 111.5MB in the end (delta: -55.9MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2021-12-18 19:19:14,583 INFO L158 Benchmark]: CDTParser took 8.80ms. Allocated memory is still 88.1MB. Free memory was 45.7MB in the beginning and 60.8MB in the end (delta: -15.0MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2021-12-18 19:19:14,583 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.36ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 55.4MB in the beginning and 82.7MB in the end (delta: -27.3MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2021-12-18 19:19:14,583 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.44ms. Allocated memory is still 113.2MB. Free memory was 82.7MB in the beginning and 80.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 19:19:14,583 INFO L158 Benchmark]: Boogie Preprocessor took 20.68ms. Allocated memory is still 113.2MB. Free memory was 80.6MB in the beginning and 79.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 19:19:14,584 INFO L158 Benchmark]: RCFGBuilder took 496.70ms. Allocated memory is still 113.2MB. Free memory was 79.1MB in the beginning and 58.7MB in the end (delta: 20.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-18 19:19:14,584 INFO L158 Benchmark]: TraceAbstraction took 2017.55ms. Allocated memory is still 113.2MB. Free memory was 58.1MB in the beginning and 38.4MB in the end (delta: 19.8MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2021-12-18 19:19:14,584 INFO L158 Benchmark]: Witness Printer took 39.77ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 38.4MB in the beginning and 111.5MB in the end (delta: -73.1MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2021-12-18 19:19:14,585 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 8.80ms. Allocated memory is still 88.1MB. Free memory was 45.7MB in the beginning and 60.8MB in the end (delta: -15.0MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.36ms. Allocated memory was 88.1MB in the beginning and 113.2MB in the end (delta: 25.2MB). Free memory was 55.4MB in the beginning and 82.7MB in the end (delta: -27.3MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.44ms. Allocated memory is still 113.2MB. Free memory was 82.7MB in the beginning and 80.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.68ms. Allocated memory is still 113.2MB. Free memory was 80.6MB in the beginning and 79.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 496.70ms. Allocated memory is still 113.2MB. Free memory was 79.1MB in the beginning and 58.7MB in the end (delta: 20.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2017.55ms. Allocated memory is still 113.2MB. Free memory was 58.1MB in the beginning and 38.4MB in the end (delta: 19.8MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Witness Printer took 39.77ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 38.4MB in the beginning and 111.5MB in the end (delta: -73.1MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 1009]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = ((void*)0) VAL [head={-1:0}] [L999] head->prev = ((void*)0) VAL [head={-1:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1000] COND TRUE __VERIFIER_nondet_int() [L1000] head->data = 1 VAL [head={-1:0}] [L1000] head->opt = head VAL [head={-1:0}] [L1001] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1003] COND FALSE !(__VERIFIER_nondet_int()) [L1006] x = head VAL [head={-1:0}, x={-1:0}] [L1007] COND TRUE x != ((void*)0) VAL [head={-1:0}, x={-1:0}] [L1009] EXPR x->data VAL [head={-1:0}, x={-1:0}, x->data=1] [L1009] EXPR x->data == 2 && x->opt == x VAL [head={-1:0}, x={-1:0}, x->data=1, x->data == 2 && x->opt == x=0] [L1009] COND TRUE !(x->data == 2 && x->opt == x) [L1009] reach_error() VAL [head={-1:0}, x={-1:0}] - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 994]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 138 locations, 66 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 800 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 800 mSDsluCounter, 1624 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 877 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1296 IncrementalHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 747 mSDtfsCounter, 1296 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=0, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 91 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 482 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-18 19:19:14,617 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)