./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3a877d22 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/sll-circular-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 f91abcd8d9f4c4a9bb166bca3090e9f421fd2afed3c0226bce3d2e7c0b6ce95e --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 13:54:18,109 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 13:54:18,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 13:54:18,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 13:54:18,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 13:54:18,145 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 13:54:18,149 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 13:54:18,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 13:54:18,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 13:54:18,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 13:54:18,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 13:54:18,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 13:54:18,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 13:54:18,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 13:54:18,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 13:54:18,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 13:54:18,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 13:54:18,164 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 13:54:18,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 13:54:18,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 13:54:18,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 13:54:18,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 13:54:18,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 13:54:18,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 13:54:18,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 13:54:18,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 13:54:18,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 13:54:18,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 13:54:18,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 13:54:18,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 13:54:18,181 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 13:54:18,181 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 13:54:18,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 13:54:18,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 13:54:18,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 13:54:18,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 13:54:18,184 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 13:54:18,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 13:54:18,184 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 13:54:18,185 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 13:54:18,185 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 13:54:18,188 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-12-15 13:54:18,213 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 13:54:18,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 13:54:18,213 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 13:54:18,213 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 13:54:18,214 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 13:54:18,214 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 13:54:18,215 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 13:54:18,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 13:54:18,215 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 13:54:18,215 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 13:54:18,216 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 13:54:18,216 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 13:54:18,216 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 13:54:18,216 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 13:54:18,216 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 13:54:18,217 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-15 13:54:18,217 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-15 13:54:18,217 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 13:54:18,217 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 13:54:18,217 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 13:54:18,217 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 13:54:18,218 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 13:54:18,218 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 13:54:18,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 13:54:18,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 13:54:18,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 13:54:18,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 13:54:18,218 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 13:54:18,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 13:54:18,219 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 13:54:18,219 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 -> f91abcd8d9f4c4a9bb166bca3090e9f421fd2afed3c0226bce3d2e7c0b6ce95e [2021-12-15 13:54:18,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 13:54:18,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 13:54:18,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 13:54:18,449 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 13:54:18,450 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 13:54:18,451 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-circular-2.i [2021-12-15 13:54:18,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80c20c16c/85d084136a5c41d4a168498e30597882/FLAG4b613a389 [2021-12-15 13:54:18,921 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 13:54:18,921 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-2.i [2021-12-15 13:54:18,936 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80c20c16c/85d084136a5c41d4a168498e30597882/FLAG4b613a389 [2021-12-15 13:54:18,945 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80c20c16c/85d084136a5c41d4a168498e30597882 [2021-12-15 13:54:18,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 13:54:18,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 13:54:18,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 13:54:18,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 13:54:18,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 13:54:18,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 01:54:18" (1/1) ... [2021-12-15 13:54:18,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dd1c108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:54:18, skipping insertion in model container [2021-12-15 13:54:18,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 01:54:18" (1/1) ... [2021-12-15 13:54:18,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 13:54:18,997 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 13:54:19,180 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/sll-circular-2.i[22324,22337] [2021-12-15 13:54:19,185 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/sll-circular-2.i[22430,22443] [2021-12-15 13:54:19,188 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/sll-circular-2.i[22554,22567] [2021-12-15 13:54:19,197 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 13:54:19,204 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 13:54:19,237 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/sll-circular-2.i[22324,22337] [2021-12-15 13:54:19,238 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/sll-circular-2.i[22430,22443] [2021-12-15 13:54:19,239 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/sll-circular-2.i[22554,22567] [2021-12-15 13:54:19,241 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 13:54:19,256 INFO L208 MainTranslator]: Completed translation [2021-12-15 13:54:19,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:54:19 WrapperNode [2021-12-15 13:54:19,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 13:54:19,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 13:54:19,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 13:54:19,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 13:54:19,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:54:19" (1/1) ... [2021-12-15 13:54:19,277 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:54:19" (1/1) ... [2021-12-15 13:54:19,295 INFO L137 Inliner]: procedures = 119, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 119 [2021-12-15 13:54:19,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 13:54:19,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 13:54:19,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 13:54:19,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 13:54:19,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:54:19" (1/1) ... [2021-12-15 13:54:19,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:54:19" (1/1) ... [2021-12-15 13:54:19,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:54:19" (1/1) ... [2021-12-15 13:54:19,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:54:19" (1/1) ... [2021-12-15 13:54:19,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:54:19" (1/1) ... [2021-12-15 13:54:19,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:54:19" (1/1) ... [2021-12-15 13:54:19,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:54:19" (1/1) ... [2021-12-15 13:54:19,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 13:54:19,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 13:54:19,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 13:54:19,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 13:54:19,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:54:19" (1/1) ... [2021-12-15 13:54:19,335 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 13:54:19,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 13:54:19,349 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-15 13:54:19,351 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-15 13:54:19,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 13:54:19,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 13:54:19,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 13:54:19,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 13:54:19,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 13:54:19,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 13:54:19,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 13:54:19,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 13:54:19,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 13:54:19,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 13:54:19,502 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 13:54:19,503 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 13:54:19,713 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 13:54:19,717 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 13:54:19,718 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-15 13:54:19,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:54:19 BoogieIcfgContainer [2021-12-15 13:54:19,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 13:54:19,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 13:54:19,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 13:54:19,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 13:54:19,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 01:54:18" (1/3) ... [2021-12-15 13:54:19,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7974e3a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 01:54:19, skipping insertion in model container [2021-12-15 13:54:19,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 01:54:19" (2/3) ... [2021-12-15 13:54:19,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7974e3a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 01:54:19, skipping insertion in model container [2021-12-15 13:54:19,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:54:19" (3/3) ... [2021-12-15 13:54:19,727 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-circular-2.i [2021-12-15 13:54:19,732 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 13:54:19,732 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2021-12-15 13:54:19,781 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 13:54:19,787 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-15 13:54:19,787 INFO L340 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2021-12-15 13:54:19,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 55 states have (on average 2.1818181818181817) internal successors, (120), 101 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:54:19,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 13:54:19,805 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:54:19,805 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 13:54:19,806 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-15 13:54:19,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:54:19,810 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-15 13:54:19,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:54:19,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849944017] [2021-12-15 13:54:19,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:54:19,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:54:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:54:19,953 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-15 13:54:19,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:54:19,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849944017] [2021-12-15 13:54:19,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849944017] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:54:19,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:54:19,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 13:54:19,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104733181] [2021-12-15 13:54:19,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:54:19,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 13:54:19,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:54:19,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 13:54:19,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 13:54:19,985 INFO L87 Difference]: Start difference. First operand has 102 states, 55 states have (on average 2.1818181818181817) internal successors, (120), 101 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-15 13:54:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:54:20,087 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2021-12-15 13:54:20,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 13:54:20,090 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-15 13:54:20,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:54:20,096 INFO L225 Difference]: With dead ends: 108 [2021-12-15 13:54:20,096 INFO L226 Difference]: Without dead ends: 106 [2021-12-15 13:54:20,098 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-15 13:54:20,101 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 86 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:54:20,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 77 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:54:20,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-15 13:54:20,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2021-12-15 13:54:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 95 states have internal predecessors, (102), 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-15 13:54:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2021-12-15 13:54:20,131 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 3 [2021-12-15 13:54:20,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:54:20,132 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2021-12-15 13:54:20,132 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-15 13:54:20,132 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2021-12-15 13:54:20,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 13:54:20,132 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:54:20,132 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 13:54:20,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 13:54:20,133 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-15 13:54:20,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:54:20,134 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-15 13:54:20,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:54:20,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599588033] [2021-12-15 13:54:20,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:54:20,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:54:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:54:20,185 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-15 13:54:20,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:54:20,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599588033] [2021-12-15 13:54:20,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599588033] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:54:20,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:54:20,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 13:54:20,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958238013] [2021-12-15 13:54:20,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:54:20,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 13:54:20,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:54:20,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 13:54:20,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 13:54:20,193 INFO L87 Difference]: Start difference. First operand 96 states and 102 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-15 13:54:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:54:20,258 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2021-12-15 13:54:20,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 13:54:20,258 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-15 13:54:20,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:54:20,260 INFO L225 Difference]: With dead ends: 104 [2021-12-15 13:54:20,260 INFO L226 Difference]: Without dead ends: 104 [2021-12-15 13:54:20,261 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-15 13:54:20,261 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 84 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:54:20,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 77 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:54:20,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-15 13:54:20,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2021-12-15 13:54:20,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 91 states have internal predecessors, (98), 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-15 13:54:20,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2021-12-15 13:54:20,266 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 3 [2021-12-15 13:54:20,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:54:20,266 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2021-12-15 13:54:20,267 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-15 13:54:20,267 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2021-12-15 13:54:20,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-15 13:54:20,267 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:54:20,267 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:54:20,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 13:54:20,268 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-15 13:54:20,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:54:20,268 INFO L85 PathProgramCache]: Analyzing trace with hash 59263652, now seen corresponding path program 1 times [2021-12-15 13:54:20,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:54:20,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886736443] [2021-12-15 13:54:20,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:54:20,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:54:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:54:20,313 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-15 13:54:20,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:54:20,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886736443] [2021-12-15 13:54:20,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886736443] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:54:20,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:54:20,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 13:54:20,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083209547] [2021-12-15 13:54:20,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:54:20,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:54:20,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:54:20,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:54:20,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:54:20,315 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-15 13:54:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:54:20,385 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2021-12-15 13:54:20,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 13:54:20,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2021-12-15 13:54:20,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:54:20,386 INFO L225 Difference]: With dead ends: 90 [2021-12-15 13:54:20,386 INFO L226 Difference]: Without dead ends: 90 [2021-12-15 13:54:20,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 13:54:20,387 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 137 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:54:20,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 52 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:54:20,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-15 13:54:20,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2021-12-15 13:54:20,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 80 states have internal predecessors, (87), 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-15 13:54:20,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2021-12-15 13:54:20,403 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 8 [2021-12-15 13:54:20,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:54:20,403 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2021-12-15 13:54:20,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-15 13:54:20,403 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2021-12-15 13:54:20,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-15 13:54:20,404 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:54:20,404 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:54:20,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 13:54:20,404 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-15 13:54:20,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:54:20,405 INFO L85 PathProgramCache]: Analyzing trace with hash 59263653, now seen corresponding path program 1 times [2021-12-15 13:54:20,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:54:20,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703640314] [2021-12-15 13:54:20,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:54:20,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:54:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:54:20,470 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-15 13:54:20,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:54:20,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703640314] [2021-12-15 13:54:20,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703640314] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:54:20,472 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:54:20,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 13:54:20,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379871176] [2021-12-15 13:54:20,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:54:20,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 13:54:20,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:54:20,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 13:54:20,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 13:54:20,474 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-15 13:54:20,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:54:20,560 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2021-12-15 13:54:20,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 13:54:20,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2021-12-15 13:54:20,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:54:20,562 INFO L225 Difference]: With dead ends: 101 [2021-12-15 13:54:20,562 INFO L226 Difference]: Without dead ends: 101 [2021-12-15 13:54:20,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 13:54:20,563 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 87 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:54:20,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 97 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:54:20,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-15 13:54:20,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2021-12-15 13:54:20,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 86 states have internal predecessors, (94), 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-15 13:54:20,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2021-12-15 13:54:20,567 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 8 [2021-12-15 13:54:20,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:54:20,567 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2021-12-15 13:54:20,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-15 13:54:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2021-12-15 13:54:20,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 13:54:20,568 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:54:20,568 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:54:20,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 13:54:20,568 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-15 13:54:20,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:54:20,569 INFO L85 PathProgramCache]: Analyzing trace with hash 460324999, now seen corresponding path program 1 times [2021-12-15 13:54:20,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:54:20,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375138289] [2021-12-15 13:54:20,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:54:20,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:54:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:54:20,690 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-15 13:54:20,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:54:20,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375138289] [2021-12-15 13:54:20,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375138289] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:54:20,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:54:20,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 13:54:20,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792730462] [2021-12-15 13:54:20,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:54:20,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 13:54:20,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:54:20,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 13:54:20,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-15 13:54:20,692 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-15 13:54:20,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:54:20,853 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2021-12-15 13:54:20,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 13:54:20,853 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-15 13:54:20,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:54:20,855 INFO L225 Difference]: With dead ends: 170 [2021-12-15 13:54:20,855 INFO L226 Difference]: Without dead ends: 170 [2021-12-15 13:54:20,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-12-15 13:54:20,859 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 316 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:54:20,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [316 Valid, 293 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:54:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2021-12-15 13:54:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 90. [2021-12-15 13:54:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 89 states have internal predecessors, (97), 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-15 13:54:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2021-12-15 13:54:20,878 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 12 [2021-12-15 13:54:20,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:54:20,878 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2021-12-15 13:54:20,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-15 13:54:20,883 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2021-12-15 13:54:20,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 13:54:20,883 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:54:20,884 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:54:20,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 13:54:20,884 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-15 13:54:20,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:54:20,884 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2021-12-15 13:54:20,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:54:20,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477772244] [2021-12-15 13:54:20,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:54:20,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:54:20,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:54:20,947 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-15 13:54:20,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:54:20,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477772244] [2021-12-15 13:54:20,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477772244] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:54:20,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:54:20,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 13:54:20,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911606700] [2021-12-15 13:54:20,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:54:20,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 13:54:20,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:54:20,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 13:54:20,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 13:54:20,949 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-15 13:54:21,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:54:21,079 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2021-12-15 13:54:21,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 13:54:21,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-15 13:54:21,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:54:21,080 INFO L225 Difference]: With dead ends: 89 [2021-12-15 13:54:21,080 INFO L226 Difference]: Without dead ends: 89 [2021-12-15 13:54:21,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-15 13:54:21,081 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 60 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:54:21,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 183 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:54:21,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-15 13:54:21,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-12-15 13:54:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 88 states have internal predecessors, (96), 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-15 13:54:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2021-12-15 13:54:21,083 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 12 [2021-12-15 13:54:21,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:54:21,083 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2021-12-15 13:54:21,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-15 13:54:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2021-12-15 13:54:21,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 13:54:21,083 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:54:21,084 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:54:21,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 13:54:21,084 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-15 13:54:21,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:54:21,084 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2021-12-15 13:54:21,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:54:21,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251808136] [2021-12-15 13:54:21,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:54:21,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:54:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:54:21,148 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-15 13:54:21,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:54:21,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251808136] [2021-12-15 13:54:21,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251808136] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:54:21,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:54:21,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 13:54:21,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102609977] [2021-12-15 13:54:21,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:54:21,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 13:54:21,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:54:21,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 13:54:21,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 13:54:21,150 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-15 13:54:21,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:54:21,291 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2021-12-15 13:54:21,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 13:54:21,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-15 13:54:21,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:54:21,292 INFO L225 Difference]: With dead ends: 85 [2021-12-15 13:54:21,292 INFO L226 Difference]: Without dead ends: 85 [2021-12-15 13:54:21,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-15 13:54:21,293 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 22 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:54:21,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 238 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:54:21,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-15 13:54:21,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2021-12-15 13:54:21,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 80 states have internal predecessors, (88), 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-15 13:54:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2021-12-15 13:54:21,296 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 12 [2021-12-15 13:54:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:54:21,296 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2021-12-15 13:54:21,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-15 13:54:21,296 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2021-12-15 13:54:21,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-15 13:54:21,297 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:54:21,297 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:54:21,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 13:54:21,297 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-15 13:54:21,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:54:21,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1385177244, now seen corresponding path program 1 times [2021-12-15 13:54:21,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:54:21,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954266958] [2021-12-15 13:54:21,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:54:21,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:54:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:54:21,388 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-15 13:54:21,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:54:21,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954266958] [2021-12-15 13:54:21,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954266958] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:54:21,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:54:21,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 13:54:21,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151294927] [2021-12-15 13:54:21,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:54:21,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 13:54:21,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:54:21,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 13:54:21,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-15 13:54:21,390 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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-15 13:54:21,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:54:21,571 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2021-12-15 13:54:21,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 13:54:21,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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-15 13:54:21,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:54:21,573 INFO L225 Difference]: With dead ends: 124 [2021-12-15 13:54:21,573 INFO L226 Difference]: Without dead ends: 124 [2021-12-15 13:54:21,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-12-15 13:54:21,573 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 293 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:54:21,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 200 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:54:21,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-15 13:54:21,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 83. [2021-12-15 13:54:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.467741935483871) internal successors, (91), 82 states have internal predecessors, (91), 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-15 13:54:21,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2021-12-15 13:54:21,576 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 13 [2021-12-15 13:54:21,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:54:21,576 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2021-12-15 13:54:21,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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-15 13:54:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2021-12-15 13:54:21,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-15 13:54:21,576 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:54:21,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:54:21,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 13:54:21,577 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-15 13:54:21,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:54:21,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1385177245, now seen corresponding path program 1 times [2021-12-15 13:54:21,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:54:21,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375979362] [2021-12-15 13:54:21,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:54:21,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:54:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:54:21,684 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-15 13:54:21,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:54:21,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375979362] [2021-12-15 13:54:21,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375979362] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:54:21,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:54:21,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 13:54:21,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149629061] [2021-12-15 13:54:21,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:54:21,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 13:54:21,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:54:21,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 13:54:21,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-15 13:54:21,686 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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-15 13:54:21,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:54:21,896 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2021-12-15 13:54:21,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 13:54:21,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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-15 13:54:21,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:54:21,897 INFO L225 Difference]: With dead ends: 158 [2021-12-15 13:54:21,897 INFO L226 Difference]: Without dead ends: 158 [2021-12-15 13:54:21,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-12-15 13:54:21,898 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 208 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:54:21,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 279 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:54:21,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-15 13:54:21,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 95. [2021-12-15 13:54:21,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.472972972972973) internal successors, (109), 94 states have internal predecessors, (109), 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-15 13:54:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2021-12-15 13:54:21,900 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 13 [2021-12-15 13:54:21,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:54:21,900 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2021-12-15 13:54:21,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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-15 13:54:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2021-12-15 13:54:21,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 13:54:21,901 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:54:21,901 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:54:21,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 13:54:21,901 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-15 13:54:21,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:54:21,901 INFO L85 PathProgramCache]: Analyzing trace with hash -230426379, now seen corresponding path program 1 times [2021-12-15 13:54:21,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:54:21,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118366469] [2021-12-15 13:54:21,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:54:21,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:54:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:54:22,025 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-15 13:54:22,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:54:22,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118366469] [2021-12-15 13:54:22,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118366469] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:54:22,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:54:22,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-15 13:54:22,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630173548] [2021-12-15 13:54:22,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:54:22,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 13:54:22,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:54:22,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 13:54:22,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-15 13:54:22,027 INFO L87 Difference]: Start difference. First operand 95 states and 109 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-15 13:54:22,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:54:22,262 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2021-12-15 13:54:22,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 13:54:22,263 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-15 13:54:22,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:54:22,263 INFO L225 Difference]: With dead ends: 143 [2021-12-15 13:54:22,263 INFO L226 Difference]: Without dead ends: 143 [2021-12-15 13:54:22,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-12-15 13:54:22,264 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 289 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:54:22,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 338 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:54:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-15 13:54:22,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 95. [2021-12-15 13:54:22,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 94 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:54:22,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2021-12-15 13:54:22,266 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 16 [2021-12-15 13:54:22,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:54:22,267 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2021-12-15 13:54:22,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-15 13:54:22,267 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2021-12-15 13:54:22,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 13:54:22,267 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:54:22,267 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:54:22,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-15 13:54:22,268 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-15 13:54:22,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:54:22,268 INFO L85 PathProgramCache]: Analyzing trace with hash -230426378, now seen corresponding path program 1 times [2021-12-15 13:54:22,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:54:22,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016496096] [2021-12-15 13:54:22,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:54:22,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:54:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:54:22,406 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-15 13:54:22,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:54:22,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016496096] [2021-12-15 13:54:22,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016496096] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:54:22,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:54:22,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 13:54:22,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610452968] [2021-12-15 13:54:22,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:54:22,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 13:54:22,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:54:22,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 13:54:22,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-15 13:54:22,408 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 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-15 13:54:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:54:22,621 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2021-12-15 13:54:22,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 13:54:22,622 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 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-15 13:54:22,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:54:22,622 INFO L225 Difference]: With dead ends: 153 [2021-12-15 13:54:22,623 INFO L226 Difference]: Without dead ends: 153 [2021-12-15 13:54:22,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-12-15 13:54:22,623 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 215 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:54:22,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 262 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 13:54:22,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-15 13:54:22,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 95. [2021-12-15 13:54:22,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.445945945945946) internal successors, (107), 94 states have internal predecessors, (107), 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-15 13:54:22,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2021-12-15 13:54:22,651 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 16 [2021-12-15 13:54:22,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:54:22,651 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2021-12-15 13:54:22,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 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-15 13:54:22,652 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2021-12-15 13:54:22,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 13:54:22,653 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:54:22,653 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:54:22,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 13:54:22,654 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-15 13:54:22,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:54:22,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1446702036, now seen corresponding path program 1 times [2021-12-15 13:54:22,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:54:22,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569338115] [2021-12-15 13:54:22,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:54:22,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:54:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:54:22,717 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-15 13:54:22,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:54:22,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569338115] [2021-12-15 13:54:22,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569338115] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:54:22,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:54:22,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 13:54:22,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341869788] [2021-12-15 13:54:22,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:54:22,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 13:54:22,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:54:22,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 13:54:22,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-15 13:54:22,719 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:54:22,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:54:22,892 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2021-12-15 13:54:22,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 13:54:22,893 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-15 13:54:22,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:54:22,893 INFO L225 Difference]: With dead ends: 134 [2021-12-15 13:54:22,894 INFO L226 Difference]: Without dead ends: 134 [2021-12-15 13:54:22,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-12-15 13:54:22,894 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 267 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:54:22,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 208 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:54:22,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-15 13:54:22,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 112. [2021-12-15 13:54:22,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.5164835164835164) internal successors, (138), 111 states have internal predecessors, (138), 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-15 13:54:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2021-12-15 13:54:22,897 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 17 [2021-12-15 13:54:22,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:54:22,898 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2021-12-15 13:54:22,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:54:22,898 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2021-12-15 13:54:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 13:54:22,898 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:54:22,898 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:54:22,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-15 13:54:22,899 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-15 13:54:22,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:54:22,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1446702037, now seen corresponding path program 1 times [2021-12-15 13:54:22,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:54:22,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336994683] [2021-12-15 13:54:22,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:54:22,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:54:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:54:22,996 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-15 13:54:22,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:54:22,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336994683] [2021-12-15 13:54:22,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336994683] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:54:22,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:54:22,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 13:54:22,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135893370] [2021-12-15 13:54:22,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:54:22,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 13:54:22,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:54:22,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 13:54:22,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-15 13:54:22,998 INFO L87 Difference]: Start difference. First operand 112 states and 138 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:54:23,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:54:23,166 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2021-12-15 13:54:23,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 13:54:23,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-15 13:54:23,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:54:23,167 INFO L225 Difference]: With dead ends: 152 [2021-12-15 13:54:23,167 INFO L226 Difference]: Without dead ends: 152 [2021-12-15 13:54:23,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-12-15 13:54:23,167 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 168 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:54:23,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 243 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:54:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-15 13:54:23,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 117. [2021-12-15 13:54:23,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 116 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:54:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2021-12-15 13:54:23,170 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 17 [2021-12-15 13:54:23,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:54:23,170 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2021-12-15 13:54:23,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:54:23,170 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2021-12-15 13:54:23,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-15 13:54:23,170 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:54:23,170 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:54:23,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 13:54:23,170 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-15 13:54:23,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:54:23,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1499460812, now seen corresponding path program 1 times [2021-12-15 13:54:23,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:54:23,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017404311] [2021-12-15 13:54:23,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:54:23,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:54:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:54:23,200 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-15 13:54:23,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:54:23,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017404311] [2021-12-15 13:54:23,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017404311] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:54:23,201 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:54:23,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 13:54:23,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285425869] [2021-12-15 13:54:23,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:54:23,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 13:54:23,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:54:23,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 13:54:23,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-15 13:54:23,203 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:54:23,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:54:23,283 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2021-12-15 13:54:23,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 13:54:23,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-15 13:54:23,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:54:23,284 INFO L225 Difference]: With dead ends: 119 [2021-12-15 13:54:23,285 INFO L226 Difference]: Without dead ends: 119 [2021-12-15 13:54:23,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-15 13:54:23,285 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 17 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:54:23,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 307 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:54:23,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-15 13:54:23,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2021-12-15 13:54:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 114 states have internal predecessors, (141), 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-15 13:54:23,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2021-12-15 13:54:23,288 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 17 [2021-12-15 13:54:23,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:54:23,288 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2021-12-15 13:54:23,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 13:54:23,288 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2021-12-15 13:54:23,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 13:54:23,289 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:54:23,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:54:23,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-15 13:54:23,289 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-15 13:54:23,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:54:23,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1296321320, now seen corresponding path program 1 times [2021-12-15 13:54:23,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:54:23,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928806664] [2021-12-15 13:54:23,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:54:23,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:54:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:54:23,382 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-15 13:54:23,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:54:23,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928806664] [2021-12-15 13:54:23,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928806664] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:54:23,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:54:23,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-15 13:54:23,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130213354] [2021-12-15 13:54:23,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:54:23,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 13:54:23,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:54:23,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 13:54:23,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-15 13:54:23,384 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 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-15 13:54:23,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:54:23,506 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2021-12-15 13:54:23,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 13:54:23,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 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 20 [2021-12-15 13:54:23,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:54:23,507 INFO L225 Difference]: With dead ends: 146 [2021-12-15 13:54:23,507 INFO L226 Difference]: Without dead ends: 146 [2021-12-15 13:54:23,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-12-15 13:54:23,507 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 126 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:54:23,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 308 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:54:23,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-15 13:54:23,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 116. [2021-12-15 13:54:23,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.4791666666666667) internal successors, (142), 115 states have internal predecessors, (142), 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-15 13:54:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2021-12-15 13:54:23,509 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 20 [2021-12-15 13:54:23,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:54:23,509 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2021-12-15 13:54:23,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 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-15 13:54:23,510 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2021-12-15 13:54:23,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 13:54:23,510 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:54:23,510 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:54:23,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 13:54:23,510 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-15 13:54:23,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:54:23,510 INFO L85 PathProgramCache]: Analyzing trace with hash -852621532, now seen corresponding path program 1 times [2021-12-15 13:54:23,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:54:23,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095300734] [2021-12-15 13:54:23,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:54:23,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:54:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:54:23,644 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-15 13:54:23,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:54:23,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095300734] [2021-12-15 13:54:23,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095300734] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:54:23,644 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:54:23,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-15 13:54:23,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368406811] [2021-12-15 13:54:23,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:54:23,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-15 13:54:23,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:54:23,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-15 13:54:23,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-15 13:54:23,646 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 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-15 13:54:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:54:23,946 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2021-12-15 13:54:23,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 13:54:23,946 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 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 20 [2021-12-15 13:54:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:54:23,947 INFO L225 Difference]: With dead ends: 139 [2021-12-15 13:54:23,947 INFO L226 Difference]: Without dead ends: 139 [2021-12-15 13:54:23,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2021-12-15 13:54:23,948 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 184 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 13:54:23,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 534 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 13:54:23,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-15 13:54:23,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 116. [2021-12-15 13:54:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.46875) internal successors, (141), 115 states have internal predecessors, (141), 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-15 13:54:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 141 transitions. [2021-12-15 13:54:23,950 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 141 transitions. Word has length 20 [2021-12-15 13:54:23,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:54:23,951 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 141 transitions. [2021-12-15 13:54:23,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 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-15 13:54:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 141 transitions. [2021-12-15 13:54:23,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 13:54:23,951 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:54:23,951 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:54:23,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-15 13:54:23,952 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-15 13:54:23,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:54:23,952 INFO L85 PathProgramCache]: Analyzing trace with hash -661835897, now seen corresponding path program 1 times [2021-12-15 13:54:23,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:54:23,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702450913] [2021-12-15 13:54:23,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:54:23,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:54:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:54:23,974 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-15 13:54:23,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:54:23,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702450913] [2021-12-15 13:54:23,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702450913] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:54:23,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:54:23,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 13:54:23,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595582611] [2021-12-15 13:54:23,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:54:23,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 13:54:23,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:54:23,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 13:54:23,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 13:54:23,976 INFO L87 Difference]: Start difference. First operand 116 states and 141 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-15 13:54:24,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:54:24,044 INFO L93 Difference]: Finished difference Result 117 states and 142 transitions. [2021-12-15 13:54:24,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 13:54:24,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 21 [2021-12-15 13:54:24,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:54:24,046 INFO L225 Difference]: With dead ends: 117 [2021-12-15 13:54:24,046 INFO L226 Difference]: Without dead ends: 117 [2021-12-15 13:54:24,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-15 13:54:24,047 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 31 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:54:24,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 156 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:54:24,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-15 13:54:24,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2021-12-15 13:54:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.4375) internal successors, (138), 114 states have internal predecessors, (138), 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-15 13:54:24,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 138 transitions. [2021-12-15 13:54:24,050 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 138 transitions. Word has length 21 [2021-12-15 13:54:24,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:54:24,050 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 138 transitions. [2021-12-15 13:54:24,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-15 13:54:24,050 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 138 transitions. [2021-12-15 13:54:24,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 13:54:24,051 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:54:24,051 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:54:24,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-15 13:54:24,051 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-15 13:54:24,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:54:24,052 INFO L85 PathProgramCache]: Analyzing trace with hash -661835896, now seen corresponding path program 1 times [2021-12-15 13:54:24,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:54:24,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093427142] [2021-12-15 13:54:24,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:54:24,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:54:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:54:24,146 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-15 13:54:24,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:54:24,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093427142] [2021-12-15 13:54:24,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093427142] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:54:24,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:54:24,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 13:54:24,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981502217] [2021-12-15 13:54:24,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:54:24,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 13:54:24,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:54:24,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 13:54:24,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-15 13:54:24,148 INFO L87 Difference]: Start difference. First operand 115 states and 138 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 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-15 13:54:24,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:54:24,403 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2021-12-15 13:54:24,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 13:54:24,403 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 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 21 [2021-12-15 13:54:24,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:54:24,404 INFO L225 Difference]: With dead ends: 135 [2021-12-15 13:54:24,404 INFO L226 Difference]: Without dead ends: 135 [2021-12-15 13:54:24,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-12-15 13:54:24,405 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 170 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:54:24,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 376 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:54:24,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-15 13:54:24,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 115. [2021-12-15 13:54:24,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 114 states have internal predecessors, (137), 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-15 13:54:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2021-12-15 13:54:24,407 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 21 [2021-12-15 13:54:24,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:54:24,407 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2021-12-15 13:54:24,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 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-15 13:54:24,408 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2021-12-15 13:54:24,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 13:54:24,408 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:54:24,408 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:54:24,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-15 13:54:24,409 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-15 13:54:24,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:54:24,409 INFO L85 PathProgramCache]: Analyzing trace with hash -2015766217, now seen corresponding path program 1 times [2021-12-15 13:54:24,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:54:24,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401529162] [2021-12-15 13:54:24,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:54:24,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:54:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:54:24,428 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-15 13:54:24,428 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:54:24,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401529162] [2021-12-15 13:54:24,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401529162] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:54:24,428 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:54:24,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 13:54:24,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404995825] [2021-12-15 13:54:24,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:54:24,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 13:54:24,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:54:24,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 13:54:24,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 13:54:24,431 INFO L87 Difference]: Start difference. First operand 115 states and 137 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-15 13:54:24,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:54:24,438 INFO L93 Difference]: Finished difference Result 181 states and 207 transitions. [2021-12-15 13:54:24,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 13:54:24,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2021-12-15 13:54:24,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:54:24,439 INFO L225 Difference]: With dead ends: 181 [2021-12-15 13:54:24,439 INFO L226 Difference]: Without dead ends: 181 [2021-12-15 13:54:24,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-15 13:54:24,440 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 13:54:24,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 145 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 13:54:24,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-15 13:54:24,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 128. [2021-12-15 13:54:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 109 states have (on average 1.3944954128440368) internal successors, (152), 127 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-15 13:54:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 152 transitions. [2021-12-15 13:54:24,442 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 152 transitions. Word has length 21 [2021-12-15 13:54:24,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:54:24,443 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 152 transitions. [2021-12-15 13:54:24,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-15 13:54:24,443 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 152 transitions. [2021-12-15 13:54:24,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-15 13:54:24,444 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:54:24,444 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:54:24,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-15 13:54:24,444 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-15 13:54:24,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:54:24,444 INFO L85 PathProgramCache]: Analyzing trace with hash -224265605, now seen corresponding path program 1 times [2021-12-15 13:54:24,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:54:24,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140890114] [2021-12-15 13:54:24,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:54:24,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:54:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 13:54:24,566 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-15 13:54:24,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 13:54:24,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140890114] [2021-12-15 13:54:24,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140890114] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 13:54:24,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 13:54:24,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 13:54:24,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744338527] [2021-12-15 13:54:24,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 13:54:24,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 13:54:24,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 13:54:24,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 13:54:24,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-15 13:54:24,568 INFO L87 Difference]: Start difference. First operand 128 states and 152 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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-15 13:54:24,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 13:54:24,792 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2021-12-15 13:54:24,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 13:54:24,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 22 [2021-12-15 13:54:24,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 13:54:24,796 INFO L225 Difference]: With dead ends: 146 [2021-12-15 13:54:24,797 INFO L226 Difference]: Without dead ends: 146 [2021-12-15 13:54:24,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-12-15 13:54:24,797 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 199 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 13:54:24,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 405 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 13:54:24,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-15 13:54:24,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2021-12-15 13:54:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 109 states have (on average 1.385321100917431) internal successors, (151), 127 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-15 13:54:24,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 151 transitions. [2021-12-15 13:54:24,800 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 151 transitions. Word has length 22 [2021-12-15 13:54:24,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 13:54:24,800 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 151 transitions. [2021-12-15 13:54:24,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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-15 13:54:24,800 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 151 transitions. [2021-12-15 13:54:24,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 13:54:24,801 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 13:54:24,801 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:54:24,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-15 13:54:24,801 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 42 more)] === [2021-12-15 13:54:24,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 13:54:24,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1441748894, now seen corresponding path program 1 times [2021-12-15 13:54:24,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 13:54:24,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267285162] [2021-12-15 13:54:24,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 13:54:24,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 13:54:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 13:54:24,811 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 13:54:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 13:54:24,839 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 13:54:24,840 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-15 13:54:24,841 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (45 of 46 remaining) [2021-12-15 13:54:24,842 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (44 of 46 remaining) [2021-12-15 13:54:24,842 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (43 of 46 remaining) [2021-12-15 13:54:24,842 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (42 of 46 remaining) [2021-12-15 13:54:24,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (41 of 46 remaining) [2021-12-15 13:54:24,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (40 of 46 remaining) [2021-12-15 13:54:24,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (39 of 46 remaining) [2021-12-15 13:54:24,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (38 of 46 remaining) [2021-12-15 13:54:24,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (37 of 46 remaining) [2021-12-15 13:54:24,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (36 of 46 remaining) [2021-12-15 13:54:24,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (35 of 46 remaining) [2021-12-15 13:54:24,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (34 of 46 remaining) [2021-12-15 13:54:24,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (33 of 46 remaining) [2021-12-15 13:54:24,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (32 of 46 remaining) [2021-12-15 13:54:24,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (31 of 46 remaining) [2021-12-15 13:54:24,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (30 of 46 remaining) [2021-12-15 13:54:24,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (29 of 46 remaining) [2021-12-15 13:54:24,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (28 of 46 remaining) [2021-12-15 13:54:24,844 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK (27 of 46 remaining) [2021-12-15 13:54:24,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (26 of 46 remaining) [2021-12-15 13:54:24,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (25 of 46 remaining) [2021-12-15 13:54:24,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (24 of 46 remaining) [2021-12-15 13:54:24,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (23 of 46 remaining) [2021-12-15 13:54:24,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (22 of 46 remaining) [2021-12-15 13:54:24,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (21 of 46 remaining) [2021-12-15 13:54:24,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (20 of 46 remaining) [2021-12-15 13:54:24,845 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (19 of 46 remaining) [2021-12-15 13:54:24,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (18 of 46 remaining) [2021-12-15 13:54:24,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (17 of 46 remaining) [2021-12-15 13:54:24,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (16 of 46 remaining) [2021-12-15 13:54:24,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (15 of 46 remaining) [2021-12-15 13:54:24,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (14 of 46 remaining) [2021-12-15 13:54:24,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (13 of 46 remaining) [2021-12-15 13:54:24,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (12 of 46 remaining) [2021-12-15 13:54:24,846 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (11 of 46 remaining) [2021-12-15 13:54:24,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (10 of 46 remaining) [2021-12-15 13:54:24,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (9 of 46 remaining) [2021-12-15 13:54:24,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (8 of 46 remaining) [2021-12-15 13:54:24,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (7 of 46 remaining) [2021-12-15 13:54:24,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (6 of 46 remaining) [2021-12-15 13:54:24,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (5 of 46 remaining) [2021-12-15 13:54:24,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (4 of 46 remaining) [2021-12-15 13:54:24,847 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (3 of 46 remaining) [2021-12-15 13:54:24,848 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (2 of 46 remaining) [2021-12-15 13:54:24,848 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (1 of 46 remaining) [2021-12-15 13:54:24,848 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (0 of 46 remaining) [2021-12-15 13:54:24,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-15 13:54:24,852 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 13:54:24,855 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-15 13:54:24,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 01:54:24 BoogieIcfgContainer [2021-12-15 13:54:24,883 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-15 13:54:24,884 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 13:54:24,884 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 13:54:24,884 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 13:54:24,885 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 01:54:19" (3/4) ... [2021-12-15 13:54:24,886 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-15 13:54:24,912 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-15 13:54:24,912 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 13:54:24,912 INFO L158 Benchmark]: Toolchain (without parser) took 5962.97ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 79.2MB in the beginning and 107.7MB in the end (delta: -28.5MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2021-12-15 13:54:24,913 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 107.0MB. Free memory was 66.2MB in the beginning and 66.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 13:54:24,913 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.78ms. Allocated memory is still 107.0MB. Free memory was 79.2MB in the beginning and 76.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 13:54:24,913 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.77ms. Allocated memory is still 107.0MB. Free memory was 76.1MB in the beginning and 74.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 13:54:24,913 INFO L158 Benchmark]: Boogie Preprocessor took 25.77ms. Allocated memory is still 107.0MB. Free memory was 74.1MB in the beginning and 72.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 13:54:24,913 INFO L158 Benchmark]: RCFGBuilder took 397.67ms. Allocated memory is still 107.0MB. Free memory was 72.3MB in the beginning and 55.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-15 13:54:24,914 INFO L158 Benchmark]: TraceAbstraction took 5161.95ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 55.2MB in the beginning and 109.8MB in the end (delta: -54.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 13:54:24,914 INFO L158 Benchmark]: Witness Printer took 28.05ms. Allocated memory is still 157.3MB. Free memory was 109.8MB in the beginning and 107.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 13:54:24,915 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 107.0MB. Free memory was 66.2MB in the beginning and 66.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.78ms. Allocated memory is still 107.0MB. Free memory was 79.2MB in the beginning and 76.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.77ms. Allocated memory is still 107.0MB. Free memory was 76.1MB in the beginning and 74.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.77ms. Allocated memory is still 107.0MB. Free memory was 74.1MB in the beginning and 72.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 397.67ms. Allocated memory is still 107.0MB. Free memory was 72.3MB in the beginning and 55.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5161.95ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 55.2MB in the beginning and 109.8MB in the end (delta: -54.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 28.05ms. Allocated memory is still 157.3MB. Free memory was 109.8MB in the beginning and 107.7MB in the end (delta: 2.1MB). There was no memory consumed. 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: 1032]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L996] SLL* head = malloc(sizeof(SLL)); [L997] head->next = head VAL [head={-1:0}] [L998] head->data = 0 VAL [head={-1:0}] [L1000] SLL* x = head; [L1001] int state = 1; VAL [head={-1:0}, state=1, x={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1025] x->data = state VAL [head={-1:0}, state=1, x={-1:0}] [L1027] EXPR head->next VAL [head={-1:0}, head->next={-1:0}, state=1, x={-1:0}] [L1027] x = head->next [L1028] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, state=1, x={-1:0}] [L1030] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1] [L1030] COND TRUE x->data != 0 [L1032] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}] [L1032] EXPR x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1] [L1032] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1032] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1032] reach_error() VAL [head={-1:0}, state=1, x={-1:0}] - UnprovableResult [Line: 997]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 997]: 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: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: 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: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1025]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1025]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1036]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 993]: 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, 102 locations, 46 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3019 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3019 mSDsluCounter, 4778 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3537 mSDsCounter, 249 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3619 IncrementalHoareTripleChecker+Invalid, 3868 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 249 mSolverCounterUnsat, 1241 mSDtfsCounter, 3619 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=19, InterpolantAutomatonStates: 163, 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, 20 MinimizatonAttempts, 546 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 316 NumberOfCodeBlocks, 316 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 2810 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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-15 13:54:24,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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)