./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/s3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/loops/s3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d053be7ac759c4172c4b0b5fbe009ed8f624c0c8659eb750e9996926d5d3b0a1 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 10:49:01,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 10:49:01,085 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 10:49:01,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 10:49:01,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 10:49:01,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 10:49:01,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 10:49:01,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 10:49:01,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 10:49:01,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 10:49:01,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 10:49:01,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 10:49:01,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 10:49:01,132 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 10:49:01,133 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 10:49:01,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 10:49:01,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 10:49:01,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 10:49:01,140 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 10:49:01,145 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 10:49:01,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 10:49:01,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 10:49:01,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 10:49:01,149 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 10:49:01,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 10:49:01,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 10:49:01,154 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 10:49:01,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 10:49:01,156 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 10:49:01,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 10:49:01,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 10:49:01,157 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 10:49:01,158 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 10:49:01,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 10:49:01,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 10:49:01,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 10:49:01,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 10:49:01,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 10:49:01,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 10:49:01,162 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 10:49:01,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 10:49:01,164 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 10:49:01,190 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 10:49:01,191 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 10:49:01,191 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 10:49:01,192 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 10:49:01,193 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 10:49:01,193 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 10:49:01,193 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 10:49:01,193 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 10:49:01,194 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 10:49:01,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 10:49:01,195 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 10:49:01,195 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 10:49:01,195 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 10:49:01,195 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 10:49:01,196 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 10:49:01,196 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 10:49:01,196 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 10:49:01,196 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 10:49:01,196 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 10:49:01,196 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 10:49:01,196 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 10:49:01,197 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 10:49:01,197 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 10:49:01,197 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 10:49:01,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 10:49:01,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 10:49:01,198 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 10:49:01,198 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 10:49:01,198 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 10:49:01,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 10:49:01,198 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 10:49:01,199 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 10:49:01,199 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 10:49:01,199 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 10:49:01,199 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 ! call(reach_error())) ) 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 -> d053be7ac759c4172c4b0b5fbe009ed8f624c0c8659eb750e9996926d5d3b0a1 [2021-12-15 10:49:01,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 10:49:01,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 10:49:01,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 10:49:01,459 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 10:49:01,460 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 10:49:01,461 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/s3.i [2021-12-15 10:49:01,527 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36546a8f3/c32e517b9fc84794958bda084a36176d/FLAG85a5cacf3 [2021-12-15 10:49:02,006 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 10:49:02,006 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/s3.i [2021-12-15 10:49:02,025 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36546a8f3/c32e517b9fc84794958bda084a36176d/FLAG85a5cacf3 [2021-12-15 10:49:02,498 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36546a8f3/c32e517b9fc84794958bda084a36176d [2021-12-15 10:49:02,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 10:49:02,501 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 10:49:02,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 10:49:02,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 10:49:02,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 10:49:02,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:49:02" (1/1) ... [2021-12-15 10:49:02,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2325d4ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:02, skipping insertion in model container [2021-12-15 10:49:02,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:49:02" (1/1) ... [2021-12-15 10:49:02,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 10:49:02,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 10:49:02,819 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/loops/s3.i[64167,64180] [2021-12-15 10:49:02,831 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 10:49:02,838 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 10:49:02,902 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/loops/s3.i[64167,64180] [2021-12-15 10:49:02,904 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 10:49:02,914 INFO L208 MainTranslator]: Completed translation [2021-12-15 10:49:02,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:02 WrapperNode [2021-12-15 10:49:02,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 10:49:02,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 10:49:02,916 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 10:49:02,916 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 10:49:02,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:02" (1/1) ... [2021-12-15 10:49:02,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:02" (1/1) ... [2021-12-15 10:49:02,992 INFO L137 Inliner]: procedures = 30, calls = 222, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 732 [2021-12-15 10:49:02,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 10:49:02,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 10:49:02,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 10:49:02,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 10:49:03,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:02" (1/1) ... [2021-12-15 10:49:03,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:02" (1/1) ... [2021-12-15 10:49:03,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:02" (1/1) ... [2021-12-15 10:49:03,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:02" (1/1) ... [2021-12-15 10:49:03,056 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:02" (1/1) ... [2021-12-15 10:49:03,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:02" (1/1) ... [2021-12-15 10:49:03,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:02" (1/1) ... [2021-12-15 10:49:03,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 10:49:03,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 10:49:03,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 10:49:03,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 10:49:03,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:02" (1/1) ... [2021-12-15 10:49:03,089 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 10:49:03,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:49:03,125 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 10:49:03,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 10:49:03,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 10:49:03,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 10:49:03,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 10:49:03,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 10:49:03,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 10:49:03,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 10:49:03,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 10:49:03,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 10:49:03,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 10:49:03,260 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 10:49:03,261 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 10:49:03,269 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-15 10:49:05,883 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-12-15 10:49:05,884 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-12-15 10:49:05,884 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 10:49:05,889 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 10:49:05,889 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 10:49:05,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:49:05 BoogieIcfgContainer [2021-12-15 10:49:05,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 10:49:05,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 10:49:05,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 10:49:05,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 10:49:05,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:49:02" (1/3) ... [2021-12-15 10:49:05,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ceb54d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:49:05, skipping insertion in model container [2021-12-15 10:49:05,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:49:02" (2/3) ... [2021-12-15 10:49:05,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37ceb54d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:49:05, skipping insertion in model container [2021-12-15 10:49:05,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:49:05" (3/3) ... [2021-12-15 10:49:05,897 INFO L111 eAbstractionObserver]: Analyzing ICFG s3.i [2021-12-15 10:49:05,900 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 10:49:05,901 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 10:49:05,931 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 10:49:05,936 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 10:49:05,936 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 10:49:05,950 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 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 10:49:05,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 10:49:05,956 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:05,956 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 10:49:05,957 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:05,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:05,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1457703967, now seen corresponding path program 1 times [2021-12-15 10:49:05,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:49:05,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822316468] [2021-12-15 10:49:05,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:05,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:49:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:06,405 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 10:49:06,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:49:06,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822316468] [2021-12-15 10:49:06,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822316468] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:06,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:06,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 10:49:06,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427728630] [2021-12-15 10:49:06,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:06,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 10:49:06,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:49:06,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 10:49:06,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:49:06,438 INFO L87 Difference]: Start difference. First operand has 131 states, 129 states have (on average 1.689922480620155) internal successors, (218), 130 states have internal predecessors, (218), 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, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 10:49:06,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:06,547 INFO L93 Difference]: Finished difference Result 375 states and 626 transitions. [2021-12-15 10:49:06,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 10:49:06,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2021-12-15 10:49:06,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:06,559 INFO L225 Difference]: With dead ends: 375 [2021-12-15 10:49:06,559 INFO L226 Difference]: Without dead ends: 217 [2021-12-15 10:49:06,563 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 10:49:06,567 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 181 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:49:06,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 402 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:49:06,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-12-15 10:49:06,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-12-15 10:49:06,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 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 10:49:06,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 321 transitions. [2021-12-15 10:49:06,635 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 321 transitions. Word has length 24 [2021-12-15 10:49:06,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:06,635 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 321 transitions. [2021-12-15 10:49:06,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 10:49:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 321 transitions. [2021-12-15 10:49:06,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-15 10:49:06,639 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:06,639 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:06,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 10:49:06,640 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:06,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:06,641 INFO L85 PathProgramCache]: Analyzing trace with hash 546953675, now seen corresponding path program 1 times [2021-12-15 10:49:06,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:49:06,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274012204] [2021-12-15 10:49:06,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:06,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:49:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:49:06,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:49:06,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274012204] [2021-12-15 10:49:06,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274012204] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:06,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:06,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:49:06,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685353093] [2021-12-15 10:49:06,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:06,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:49:06,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:49:06,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:49:06,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:49:06,802 INFO L87 Difference]: Start difference. First operand 217 states and 321 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 10:49:08,821 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:09,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:09,105 INFO L93 Difference]: Finished difference Result 612 states and 909 transitions. [2021-12-15 10:49:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:49:09,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2021-12-15 10:49:09,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:09,108 INFO L225 Difference]: With dead ends: 612 [2021-12-15 10:49:09,108 INFO L226 Difference]: Without dead ends: 402 [2021-12-15 10:49:09,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:49:09,109 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 107 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-15 10:49:09,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 271 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-12-15 10:49:09,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2021-12-15 10:49:09,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 265. [2021-12-15 10:49:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.5340909090909092) internal successors, (405), 264 states have internal predecessors, (405), 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 10:49:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 405 transitions. [2021-12-15 10:49:09,138 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 405 transitions. Word has length 39 [2021-12-15 10:49:09,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:09,139 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 405 transitions. [2021-12-15 10:49:09,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 10:49:09,139 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 405 transitions. [2021-12-15 10:49:09,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 10:49:09,140 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:09,140 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:09,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 10:49:09,141 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:09,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:09,141 INFO L85 PathProgramCache]: Analyzing trace with hash -228723188, now seen corresponding path program 1 times [2021-12-15 10:49:09,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:49:09,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959130863] [2021-12-15 10:49:09,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:09,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:49:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:09,232 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:49:09,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:49:09,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959130863] [2021-12-15 10:49:09,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959130863] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:09,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:09,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:49:09,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080196979] [2021-12-15 10:49:09,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:09,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:49:09,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:49:09,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:49:09,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:49:09,234 INFO L87 Difference]: Start difference. First operand 265 states and 405 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 10:49:11,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:13,264 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:13,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:13,455 INFO L93 Difference]: Finished difference Result 431 states and 660 transitions. [2021-12-15 10:49:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:49:13,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2021-12-15 10:49:13,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:13,457 INFO L225 Difference]: With dead ends: 431 [2021-12-15 10:49:13,457 INFO L226 Difference]: Without dead ends: 300 [2021-12-15 10:49:13,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:49:13,459 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 31 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:49:13,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 476 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2021-12-15 10:49:13,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-12-15 10:49:13,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 283. [2021-12-15 10:49:13,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.5425531914893618) internal successors, (435), 282 states have internal predecessors, (435), 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 10:49:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 435 transitions. [2021-12-15 10:49:13,469 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 435 transitions. Word has length 40 [2021-12-15 10:49:13,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:13,469 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 435 transitions. [2021-12-15 10:49:13,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 10:49:13,470 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 435 transitions. [2021-12-15 10:49:13,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-15 10:49:13,471 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:13,471 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:13,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 10:49:13,472 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:13,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:13,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1727416149, now seen corresponding path program 1 times [2021-12-15 10:49:13,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:49:13,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869411524] [2021-12-15 10:49:13,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:13,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:49:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:13,625 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:49:13,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:49:13,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869411524] [2021-12-15 10:49:13,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869411524] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:13,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:13,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:49:13,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793298146] [2021-12-15 10:49:13,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:13,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:49:13,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:49:13,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:49:13,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:49:13,632 INFO L87 Difference]: Start difference. First operand 283 states and 435 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:49:15,647 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:17,661 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:17,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:17,844 INFO L93 Difference]: Finished difference Result 448 states and 688 transitions. [2021-12-15 10:49:17,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:49:17,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-12-15 10:49:17,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:17,845 INFO L225 Difference]: With dead ends: 448 [2021-12-15 10:49:17,846 INFO L226 Difference]: Without dead ends: 299 [2021-12-15 10:49:17,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:49:17,847 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 37 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:49:17,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 476 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2021-12-15 10:49:17,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-12-15 10:49:17,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 283. [2021-12-15 10:49:17,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.5390070921985815) internal successors, (434), 282 states have internal predecessors, (434), 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 10:49:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 434 transitions. [2021-12-15 10:49:17,856 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 434 transitions. Word has length 55 [2021-12-15 10:49:17,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:17,857 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 434 transitions. [2021-12-15 10:49:17,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:49:17,858 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 434 transitions. [2021-12-15 10:49:17,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-15 10:49:17,860 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:17,861 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:17,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 10:49:17,863 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:17,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:17,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1149096951, now seen corresponding path program 1 times [2021-12-15 10:49:17,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:49:17,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647296959] [2021-12-15 10:49:17,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:17,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:49:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:49:17,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:49:17,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647296959] [2021-12-15 10:49:17,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647296959] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:17,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:17,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:49:17,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240652102] [2021-12-15 10:49:17,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:17,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:49:17,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:49:17,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:49:17,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:49:17,989 INFO L87 Difference]: Start difference. First operand 283 states and 434 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:49:20,004 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:20,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:20,270 INFO L93 Difference]: Finished difference Result 744 states and 1135 transitions. [2021-12-15 10:49:20,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:49:20,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-12-15 10:49:20,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:20,273 INFO L225 Difference]: With dead ends: 744 [2021-12-15 10:49:20,273 INFO L226 Difference]: Without dead ends: 468 [2021-12-15 10:49:20,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:49:20,274 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 120 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-15 10:49:20,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 270 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-12-15 10:49:20,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-12-15 10:49:20,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 307. [2021-12-15 10:49:20,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.526143790849673) internal successors, (467), 306 states have internal predecessors, (467), 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 10:49:20,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 467 transitions. [2021-12-15 10:49:20,283 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 467 transitions. Word has length 55 [2021-12-15 10:49:20,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:20,283 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 467 transitions. [2021-12-15 10:49:20,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:49:20,283 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 467 transitions. [2021-12-15 10:49:20,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-15 10:49:20,285 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:20,285 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:20,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 10:49:20,285 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:20,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:20,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1382837768, now seen corresponding path program 1 times [2021-12-15 10:49:20,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:49:20,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662158796] [2021-12-15 10:49:20,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:20,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:49:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:49:20,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:49:20,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662158796] [2021-12-15 10:49:20,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662158796] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:20,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:20,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:49:20,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855299913] [2021-12-15 10:49:20,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:20,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:49:20,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:49:20,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:49:20,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:49:20,368 INFO L87 Difference]: Start difference. First operand 307 states and 467 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 10:49:22,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:22,659 INFO L93 Difference]: Finished difference Result 768 states and 1163 transitions. [2021-12-15 10:49:22,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:49:22,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2021-12-15 10:49:22,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:22,661 INFO L225 Difference]: With dead ends: 768 [2021-12-15 10:49:22,661 INFO L226 Difference]: Without dead ends: 468 [2021-12-15 10:49:22,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:49:22,662 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 118 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-15 10:49:22,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 292 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-12-15 10:49:22,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-12-15 10:49:22,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 309. [2021-12-15 10:49:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.5129870129870129) internal successors, (466), 308 states have internal predecessors, (466), 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 10:49:22,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 466 transitions. [2021-12-15 10:49:22,674 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 466 transitions. Word has length 56 [2021-12-15 10:49:22,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:22,674 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 466 transitions. [2021-12-15 10:49:22,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 10:49:22,674 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 466 transitions. [2021-12-15 10:49:22,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-15 10:49:22,675 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:22,675 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:22,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 10:49:22,676 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:22,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:22,676 INFO L85 PathProgramCache]: Analyzing trace with hash 270979954, now seen corresponding path program 1 times [2021-12-15 10:49:22,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:49:22,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211039889] [2021-12-15 10:49:22,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:22,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:49:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:49:22,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:49:22,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211039889] [2021-12-15 10:49:22,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211039889] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:22,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:22,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:49:22,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412695617] [2021-12-15 10:49:22,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:22,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:49:22,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:49:22,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:49:22,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:49:22,769 INFO L87 Difference]: Start difference. First operand 309 states and 466 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:49:24,784 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:26,801 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:26,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:26,960 INFO L93 Difference]: Finished difference Result 487 states and 733 transitions. [2021-12-15 10:49:26,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:49:26,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-12-15 10:49:26,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:26,962 INFO L225 Difference]: With dead ends: 487 [2021-12-15 10:49:26,962 INFO L226 Difference]: Without dead ends: 325 [2021-12-15 10:49:26,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:49:26,963 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 31 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:49:26,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 470 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2021-12-15 10:49:26,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2021-12-15 10:49:26,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 309. [2021-12-15 10:49:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.5097402597402598) internal successors, (465), 308 states have internal predecessors, (465), 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 10:49:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 465 transitions. [2021-12-15 10:49:26,970 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 465 transitions. Word has length 57 [2021-12-15 10:49:26,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:26,970 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 465 transitions. [2021-12-15 10:49:26,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:49:26,970 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 465 transitions. [2021-12-15 10:49:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-15 10:49:26,971 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:26,971 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:26,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 10:49:26,972 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:26,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:26,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1460862829, now seen corresponding path program 1 times [2021-12-15 10:49:26,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:49:26,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611255328] [2021-12-15 10:49:26,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:26,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:49:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:27,076 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:49:27,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:49:27,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611255328] [2021-12-15 10:49:27,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611255328] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:27,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:27,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:49:27,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906604946] [2021-12-15 10:49:27,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:27,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:49:27,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:49:27,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:49:27,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:49:27,080 INFO L87 Difference]: Start difference. First operand 309 states and 465 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 10:49:29,095 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:31,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:31,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:31,232 INFO L93 Difference]: Finished difference Result 478 states and 720 transitions. [2021-12-15 10:49:31,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:49:31,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 58 [2021-12-15 10:49:31,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:31,234 INFO L225 Difference]: With dead ends: 478 [2021-12-15 10:49:31,234 INFO L226 Difference]: Without dead ends: 316 [2021-12-15 10:49:31,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:49:31,235 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 22 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:49:31,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 456 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2021-12-15 10:49:31,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-12-15 10:49:31,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 309. [2021-12-15 10:49:31,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.5064935064935066) internal successors, (464), 308 states have internal predecessors, (464), 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 10:49:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 464 transitions. [2021-12-15 10:49:31,241 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 464 transitions. Word has length 58 [2021-12-15 10:49:31,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:31,241 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 464 transitions. [2021-12-15 10:49:31,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 10:49:31,241 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 464 transitions. [2021-12-15 10:49:31,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-15 10:49:31,241 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:31,241 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:31,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 10:49:31,242 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:31,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:31,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1518169684, now seen corresponding path program 1 times [2021-12-15 10:49:31,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:49:31,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297371971] [2021-12-15 10:49:31,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:31,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:49:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-15 10:49:31,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:49:31,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297371971] [2021-12-15 10:49:31,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297371971] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:31,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:31,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 10:49:31,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386185807] [2021-12-15 10:49:31,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:31,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 10:49:31,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:49:31,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 10:49:31,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:49:31,310 INFO L87 Difference]: Start difference. First operand 309 states and 464 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:49:33,316 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:33,348 INFO L93 Difference]: Finished difference Result 630 states and 950 transitions. [2021-12-15 10:49:33,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 10:49:33,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-12-15 10:49:33,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:33,350 INFO L225 Difference]: With dead ends: 630 [2021-12-15 10:49:33,350 INFO L226 Difference]: Without dead ends: 468 [2021-12-15 10:49:33,350 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 10:49:33,351 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 127 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:49:33,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 474 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2021-12-15 10:49:33,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2021-12-15 10:49:33,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2021-12-15 10:49:33,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 1.4989293361884368) internal successors, (700), 467 states have internal predecessors, (700), 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 10:49:33,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 700 transitions. [2021-12-15 10:49:33,359 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 700 transitions. Word has length 58 [2021-12-15 10:49:33,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:33,359 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 700 transitions. [2021-12-15 10:49:33,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:49:33,360 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 700 transitions. [2021-12-15 10:49:33,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-12-15 10:49:33,360 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:33,360 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:33,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 10:49:33,361 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:33,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:33,361 INFO L85 PathProgramCache]: Analyzing trace with hash -853569578, now seen corresponding path program 1 times [2021-12-15 10:49:33,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:49:33,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130163065] [2021-12-15 10:49:33,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:33,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:49:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:49:33,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:49:33,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130163065] [2021-12-15 10:49:33,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130163065] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:33,455 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:33,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 10:49:33,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875508643] [2021-12-15 10:49:33,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:33,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 10:49:33,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:49:33,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 10:49:33,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:49:33,457 INFO L87 Difference]: Start difference. First operand 468 states and 700 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 10:49:35,462 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:35,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:35,489 INFO L93 Difference]: Finished difference Result 813 states and 1214 transitions. [2021-12-15 10:49:35,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 10:49:35,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 58 [2021-12-15 10:49:35,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:35,491 INFO L225 Difference]: With dead ends: 813 [2021-12-15 10:49:35,491 INFO L226 Difference]: Without dead ends: 492 [2021-12-15 10:49:35,492 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 10:49:35,492 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 15 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:49:35,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 354 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2021-12-15 10:49:35,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-12-15 10:49:35,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 492. [2021-12-15 10:49:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 1.490835030549898) internal successors, (732), 491 states have internal predecessors, (732), 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 10:49:35,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 732 transitions. [2021-12-15 10:49:35,505 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 732 transitions. Word has length 58 [2021-12-15 10:49:35,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:35,505 INFO L470 AbstractCegarLoop]: Abstraction has 492 states and 732 transitions. [2021-12-15 10:49:35,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 10:49:35,506 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 732 transitions. [2021-12-15 10:49:35,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-15 10:49:35,506 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:35,507 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:35,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-15 10:49:35,507 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:35,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:35,508 INFO L85 PathProgramCache]: Analyzing trace with hash -533479020, now seen corresponding path program 1 times [2021-12-15 10:49:35,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:49:35,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161282283] [2021-12-15 10:49:35,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:35,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:49:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-15 10:49:35,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:49:35,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161282283] [2021-12-15 10:49:35,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161282283] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:35,593 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:35,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:49:35,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982101787] [2021-12-15 10:49:35,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:35,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:49:35,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:49:35,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:49:35,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:49:35,595 INFO L87 Difference]: Start difference. First operand 492 states and 732 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 10:49:37,608 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:39,623 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:39,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:39,906 INFO L93 Difference]: Finished difference Result 1257 states and 1861 transitions. [2021-12-15 10:49:39,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:49:39,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 78 [2021-12-15 10:49:39,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:39,910 INFO L225 Difference]: With dead ends: 1257 [2021-12-15 10:49:39,910 INFO L226 Difference]: Without dead ends: 772 [2021-12-15 10:49:39,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 10:49:39,912 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 99 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-12-15 10:49:39,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 568 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 237 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2021-12-15 10:49:39,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2021-12-15 10:49:39,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 555. [2021-12-15 10:49:39,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 1.5) internal successors, (831), 554 states have internal predecessors, (831), 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 10:49:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 831 transitions. [2021-12-15 10:49:39,939 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 831 transitions. Word has length 78 [2021-12-15 10:49:39,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:39,939 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 831 transitions. [2021-12-15 10:49:39,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 10:49:39,939 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 831 transitions. [2021-12-15 10:49:39,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-12-15 10:49:39,944 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:39,944 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:39,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 10:49:39,944 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:39,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:39,945 INFO L85 PathProgramCache]: Analyzing trace with hash 360007318, now seen corresponding path program 1 times [2021-12-15 10:49:39,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:49:39,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739014053] [2021-12-15 10:49:39,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:39,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:49:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-15 10:49:40,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:49:40,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739014053] [2021-12-15 10:49:40,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739014053] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:40,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:40,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:49:40,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522110642] [2021-12-15 10:49:40,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:40,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:49:40,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:49:40,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:49:40,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:49:40,038 INFO L87 Difference]: Start difference. First operand 555 states and 831 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:49:42,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:44,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:44,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:44,234 INFO L93 Difference]: Finished difference Result 1243 states and 1852 transitions. [2021-12-15 10:49:44,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:49:44,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-12-15 10:49:44,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:44,237 INFO L225 Difference]: With dead ends: 1243 [2021-12-15 10:49:44,237 INFO L226 Difference]: Without dead ends: 695 [2021-12-15 10:49:44,238 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:49:44,239 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 41 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:49:44,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 500 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 151 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2021-12-15 10:49:44,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2021-12-15 10:49:44,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 621. [2021-12-15 10:49:44,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 620 states have (on average 1.514516129032258) internal successors, (939), 620 states have internal predecessors, (939), 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 10:49:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 939 transitions. [2021-12-15 10:49:44,251 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 939 transitions. Word has length 78 [2021-12-15 10:49:44,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:44,251 INFO L470 AbstractCegarLoop]: Abstraction has 621 states and 939 transitions. [2021-12-15 10:49:44,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:49:44,251 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 939 transitions. [2021-12-15 10:49:44,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-15 10:49:44,252 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:44,252 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:44,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-15 10:49:44,253 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:44,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:44,254 INFO L85 PathProgramCache]: Analyzing trace with hash 16159115, now seen corresponding path program 1 times [2021-12-15 10:49:44,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:49:44,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098090568] [2021-12-15 10:49:44,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:44,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:49:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:44,371 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-15 10:49:44,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:49:44,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098090568] [2021-12-15 10:49:44,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098090568] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:44,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:44,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:49:44,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746906495] [2021-12-15 10:49:44,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:44,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:49:44,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:49:44,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:49:44,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:49:44,373 INFO L87 Difference]: Start difference. First operand 621 states and 939 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:49:46,380 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:48,393 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:48,560 INFO L93 Difference]: Finished difference Result 1306 states and 1954 transitions. [2021-12-15 10:49:48,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:49:48,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2021-12-15 10:49:48,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:48,574 INFO L225 Difference]: With dead ends: 1306 [2021-12-15 10:49:48,574 INFO L226 Difference]: Without dead ends: 692 [2021-12-15 10:49:48,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:49:48,576 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 51 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:49:48,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 500 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2021-12-15 10:49:48,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2021-12-15 10:49:48,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 621. [2021-12-15 10:49:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 620 states have (on average 1.5096774193548388) internal successors, (936), 620 states have internal predecessors, (936), 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 10:49:48,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 936 transitions. [2021-12-15 10:49:48,588 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 936 transitions. Word has length 93 [2021-12-15 10:49:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:48,588 INFO L470 AbstractCegarLoop]: Abstraction has 621 states and 936 transitions. [2021-12-15 10:49:48,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 10:49:48,588 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 936 transitions. [2021-12-15 10:49:48,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-15 10:49:48,589 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:48,589 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:48,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 10:49:48,590 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:48,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:48,590 INFO L85 PathProgramCache]: Analyzing trace with hash 725444648, now seen corresponding path program 1 times [2021-12-15 10:49:48,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:49:48,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532895508] [2021-12-15 10:49:48,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:48,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:49:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-15 10:49:48,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:49:48,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532895508] [2021-12-15 10:49:48,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532895508] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:48,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:48,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:49:48,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840163197] [2021-12-15 10:49:48,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:48,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:49:48,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:49:48,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:49:48,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:49:48,701 INFO L87 Difference]: Start difference. First operand 621 states and 936 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 10:49:50,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:50,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:50,967 INFO L93 Difference]: Finished difference Result 1473 states and 2212 transitions. [2021-12-15 10:49:50,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:49:50,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 95 [2021-12-15 10:49:50,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:50,970 INFO L225 Difference]: With dead ends: 1473 [2021-12-15 10:49:50,970 INFO L226 Difference]: Without dead ends: 859 [2021-12-15 10:49:50,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:49:50,972 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 117 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:49:50,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 270 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-15 10:49:50,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2021-12-15 10:49:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 624. [2021-12-15 10:49:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 623 states have (on average 1.492776886035313) internal successors, (930), 623 states have internal predecessors, (930), 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 10:49:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 930 transitions. [2021-12-15 10:49:50,985 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 930 transitions. Word has length 95 [2021-12-15 10:49:50,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:50,985 INFO L470 AbstractCegarLoop]: Abstraction has 624 states and 930 transitions. [2021-12-15 10:49:50,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 10:49:50,985 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 930 transitions. [2021-12-15 10:49:50,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-12-15 10:49:50,986 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:50,987 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:50,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-15 10:49:50,987 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:50,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:50,987 INFO L85 PathProgramCache]: Analyzing trace with hash -257359203, now seen corresponding path program 1 times [2021-12-15 10:49:50,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:49:50,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099609580] [2021-12-15 10:49:50,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:50,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:49:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:51,090 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-15 10:49:51,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:49:51,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099609580] [2021-12-15 10:49:51,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099609580] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:51,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:51,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:49:51,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639059104] [2021-12-15 10:49:51,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:51,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:49:51,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:49:51,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:49:51,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:49:51,092 INFO L87 Difference]: Start difference. First operand 624 states and 930 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 10:49:53,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:55,117 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:55,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:55,279 INFO L93 Difference]: Finished difference Result 1285 states and 1903 transitions. [2021-12-15 10:49:55,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:49:55,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 96 [2021-12-15 10:49:55,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:55,282 INFO L225 Difference]: With dead ends: 1285 [2021-12-15 10:49:55,282 INFO L226 Difference]: Without dead ends: 668 [2021-12-15 10:49:55,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:49:55,283 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 38 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:49:55,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 484 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2021-12-15 10:49:55,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-12-15 10:49:55,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 624. [2021-12-15 10:49:55,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 623 states have (on average 1.4879614767255216) internal successors, (927), 623 states have internal predecessors, (927), 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 10:49:55,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 927 transitions. [2021-12-15 10:49:55,295 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 927 transitions. Word has length 96 [2021-12-15 10:49:55,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:55,296 INFO L470 AbstractCegarLoop]: Abstraction has 624 states and 927 transitions. [2021-12-15 10:49:55,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 10:49:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 927 transitions. [2021-12-15 10:49:55,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-12-15 10:49:55,297 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:55,297 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:55,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 10:49:55,297 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:55,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:55,298 INFO L85 PathProgramCache]: Analyzing trace with hash 349934048, now seen corresponding path program 1 times [2021-12-15 10:49:55,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:49:55,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947425945] [2021-12-15 10:49:55,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:55,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:49:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-15 10:49:55,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:49:55,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947425945] [2021-12-15 10:49:55,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947425945] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:55,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:55,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:49:55,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321789019] [2021-12-15 10:49:55,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:55,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:49:55,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:49:55,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:49:55,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:49:55,395 INFO L87 Difference]: Start difference. First operand 624 states and 927 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 10:49:57,415 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:49:57,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:49:57,640 INFO L93 Difference]: Finished difference Result 1476 states and 2188 transitions. [2021-12-15 10:49:57,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:49:57,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 96 [2021-12-15 10:49:57,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:49:57,643 INFO L225 Difference]: With dead ends: 1476 [2021-12-15 10:49:57,643 INFO L226 Difference]: Without dead ends: 859 [2021-12-15 10:49:57,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:49:57,644 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 110 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:49:57,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 276 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-15 10:49:57,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2021-12-15 10:49:57,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 636. [2021-12-15 10:49:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.478740157480315) internal successors, (939), 635 states have internal predecessors, (939), 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 10:49:57,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 939 transitions. [2021-12-15 10:49:57,677 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 939 transitions. Word has length 96 [2021-12-15 10:49:57,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:49:57,678 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 939 transitions. [2021-12-15 10:49:57,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 10:49:57,678 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 939 transitions. [2021-12-15 10:49:57,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-15 10:49:57,679 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:49:57,679 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:49:57,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-15 10:49:57,679 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:49:57,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:49:57,680 INFO L85 PathProgramCache]: Analyzing trace with hash -531677365, now seen corresponding path program 1 times [2021-12-15 10:49:57,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:49:57,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850378808] [2021-12-15 10:49:57,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:49:57,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:49:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:49:57,774 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-15 10:49:57,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:49:57,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850378808] [2021-12-15 10:49:57,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850378808] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:49:57,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:49:57,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:49:57,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587079935] [2021-12-15 10:49:57,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:49:57,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:49:57,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:49:57,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:49:57,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:49:57,776 INFO L87 Difference]: Start difference. First operand 636 states and 939 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 10:49:59,791 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:50:00,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:50:00,014 INFO L93 Difference]: Finished difference Result 1484 states and 2183 transitions. [2021-12-15 10:50:00,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:50:00,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 97 [2021-12-15 10:50:00,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:50:00,017 INFO L225 Difference]: With dead ends: 1484 [2021-12-15 10:50:00,017 INFO L226 Difference]: Without dead ends: 855 [2021-12-15 10:50:00,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:50:00,018 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 111 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:50:00,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 272 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-15 10:50:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2021-12-15 10:50:00,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 639. [2021-12-15 10:50:00,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 638 states have (on average 1.4623824451410659) internal successors, (933), 638 states have internal predecessors, (933), 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 10:50:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 933 transitions. [2021-12-15 10:50:00,029 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 933 transitions. Word has length 97 [2021-12-15 10:50:00,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:50:00,030 INFO L470 AbstractCegarLoop]: Abstraction has 639 states and 933 transitions. [2021-12-15 10:50:00,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 10:50:00,030 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 933 transitions. [2021-12-15 10:50:00,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-15 10:50:00,031 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:50:00,031 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:50:00,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-15 10:50:00,031 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:50:00,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:50:00,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1844388260, now seen corresponding path program 1 times [2021-12-15 10:50:00,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:50:00,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139908789] [2021-12-15 10:50:00,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:50:00,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:50:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:50:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-15 10:50:00,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:50:00,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139908789] [2021-12-15 10:50:00,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139908789] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:50:00,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:50:00,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 10:50:00,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646714651] [2021-12-15 10:50:00,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:50:00,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 10:50:00,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:50:00,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 10:50:00,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:50:00,122 INFO L87 Difference]: Start difference. First operand 639 states and 933 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 10:50:02,135 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:50:02,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:50:02,170 INFO L93 Difference]: Finished difference Result 1290 states and 1886 transitions. [2021-12-15 10:50:02,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 10:50:02,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 98 [2021-12-15 10:50:02,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:50:02,174 INFO L225 Difference]: With dead ends: 1290 [2021-12-15 10:50:02,174 INFO L226 Difference]: Without dead ends: 847 [2021-12-15 10:50:02,175 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 10:50:02,175 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 128 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:50:02,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 472 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2021-12-15 10:50:02,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2021-12-15 10:50:02,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 845. [2021-12-15 10:50:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.4609004739336493) internal successors, (1233), 844 states have internal predecessors, (1233), 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 10:50:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1233 transitions. [2021-12-15 10:50:02,195 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1233 transitions. Word has length 98 [2021-12-15 10:50:02,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:50:02,196 INFO L470 AbstractCegarLoop]: Abstraction has 845 states and 1233 transitions. [2021-12-15 10:50:02,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 10:50:02,196 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1233 transitions. [2021-12-15 10:50:02,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-15 10:50:02,197 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:50:02,197 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:50:02,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-15 10:50:02,197 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:50:02,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:50:02,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1703839650, now seen corresponding path program 1 times [2021-12-15 10:50:02,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:50:02,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521967543] [2021-12-15 10:50:02,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:50:02,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:50:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:50:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-12-15 10:50:02,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:50:02,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521967543] [2021-12-15 10:50:02,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521967543] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:50:02,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:50:02,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 10:50:02,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334601690] [2021-12-15 10:50:02,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:50:02,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 10:50:02,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:50:02,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 10:50:02,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:50:02,292 INFO L87 Difference]: Start difference. First operand 845 states and 1233 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 10:50:04,304 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:50:04,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:50:04,337 INFO L93 Difference]: Finished difference Result 1473 states and 2149 transitions. [2021-12-15 10:50:04,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 10:50:04,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 98 [2021-12-15 10:50:04,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:50:04,339 INFO L225 Difference]: With dead ends: 1473 [2021-12-15 10:50:04,339 INFO L226 Difference]: Without dead ends: 824 [2021-12-15 10:50:04,340 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 10:50:04,340 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 130 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:50:04,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 472 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2021-12-15 10:50:04,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2021-12-15 10:50:04,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 824. [2021-12-15 10:50:04,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 823 states have (on average 1.454434993924666) internal successors, (1197), 823 states have internal predecessors, (1197), 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 10:50:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1197 transitions. [2021-12-15 10:50:04,352 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1197 transitions. Word has length 98 [2021-12-15 10:50:04,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:50:04,352 INFO L470 AbstractCegarLoop]: Abstraction has 824 states and 1197 transitions. [2021-12-15 10:50:04,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 10:50:04,353 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1197 transitions. [2021-12-15 10:50:04,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-12-15 10:50:04,354 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:50:04,354 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:50:04,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-15 10:50:04,354 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:50:04,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:50:04,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1223162519, now seen corresponding path program 1 times [2021-12-15 10:50:04,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:50:04,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518836272] [2021-12-15 10:50:04,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:50:04,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:50:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:50:04,432 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-15 10:50:04,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:50:04,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518836272] [2021-12-15 10:50:04,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518836272] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:50:04,433 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:50:04,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:50:04,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532627885] [2021-12-15 10:50:04,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:50:04,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:50:04,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:50:04,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:50:04,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:50:04,434 INFO L87 Difference]: Start difference. First operand 824 states and 1197 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 10:50:06,440 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:50:08,464 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:50:08,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:50:08,713 INFO L93 Difference]: Finished difference Result 1729 states and 2495 transitions. [2021-12-15 10:50:08,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:50:08,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 100 [2021-12-15 10:50:08,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:50:08,716 INFO L225 Difference]: With dead ends: 1729 [2021-12-15 10:50:08,716 INFO L226 Difference]: Without dead ends: 912 [2021-12-15 10:50:08,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:50:08,718 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 37 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-12-15 10:50:08,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 491 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 149 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2021-12-15 10:50:08,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2021-12-15 10:50:08,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 839. [2021-12-15 10:50:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 838 states have (on average 1.4606205250596658) internal successors, (1224), 838 states have internal predecessors, (1224), 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 10:50:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1224 transitions. [2021-12-15 10:50:08,735 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1224 transitions. Word has length 100 [2021-12-15 10:50:08,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:50:08,735 INFO L470 AbstractCegarLoop]: Abstraction has 839 states and 1224 transitions. [2021-12-15 10:50:08,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 10:50:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1224 transitions. [2021-12-15 10:50:08,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-15 10:50:08,737 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:50:08,737 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:50:08,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-15 10:50:08,737 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:50:08,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:50:08,738 INFO L85 PathProgramCache]: Analyzing trace with hash -517718612, now seen corresponding path program 1 times [2021-12-15 10:50:08,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:50:08,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83785549] [2021-12-15 10:50:08,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:50:08,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:50:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:50:08,832 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-15 10:50:08,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:50:08,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83785549] [2021-12-15 10:50:08,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83785549] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:50:08,833 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:50:08,833 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:50:08,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019379963] [2021-12-15 10:50:08,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:50:08,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:50:08,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:50:08,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:50:08,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:50:08,835 INFO L87 Difference]: Start difference. First operand 839 states and 1224 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 10:50:10,842 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:50:12,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:50:13,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:50:13,036 INFO L93 Difference]: Finished difference Result 1741 states and 2516 transitions. [2021-12-15 10:50:13,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:50:13,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 115 [2021-12-15 10:50:13,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:50:13,039 INFO L225 Difference]: With dead ends: 1741 [2021-12-15 10:50:13,039 INFO L226 Difference]: Without dead ends: 909 [2021-12-15 10:50:13,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:50:13,040 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 49 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:50:13,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 490 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 145 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2021-12-15 10:50:13,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2021-12-15 10:50:13,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 839. [2021-12-15 10:50:13,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 838 states have (on average 1.4570405727923628) internal successors, (1221), 838 states have internal predecessors, (1221), 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 10:50:13,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1221 transitions. [2021-12-15 10:50:13,053 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1221 transitions. Word has length 115 [2021-12-15 10:50:13,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:50:13,054 INFO L470 AbstractCegarLoop]: Abstraction has 839 states and 1221 transitions. [2021-12-15 10:50:13,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 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 10:50:13,054 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1221 transitions. [2021-12-15 10:50:13,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-12-15 10:50:13,055 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:50:13,055 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:50:13,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-15 10:50:13,055 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:50:13,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:50:13,056 INFO L85 PathProgramCache]: Analyzing trace with hash 182595248, now seen corresponding path program 1 times [2021-12-15 10:50:13,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:50:13,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703093567] [2021-12-15 10:50:13,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:50:13,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:50:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:50:13,145 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-15 10:50:13,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:50:13,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703093567] [2021-12-15 10:50:13,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703093567] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:50:13,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:50:13,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:50:13,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107985900] [2021-12-15 10:50:13,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:50:13,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:50:13,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:50:13,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:50:13,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:50:13,147 INFO L87 Difference]: Start difference. First operand 839 states and 1221 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 10:50:15,154 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-15 10:50:15,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:50:15,389 INFO L93 Difference]: Finished difference Result 1937 states and 2794 transitions. [2021-12-15 10:50:15,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 10:50:15,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 118 [2021-12-15 10:50:15,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:50:15,393 INFO L225 Difference]: With dead ends: 1937 [2021-12-15 10:50:15,393 INFO L226 Difference]: Without dead ends: 1105 [2021-12-15 10:50:15,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 10:50:15,397 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 112 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-15 10:50:15,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 268 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-15 10:50:15,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2021-12-15 10:50:15,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 839. [2021-12-15 10:50:15,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 838 states have (on average 1.4439140811455846) internal successors, (1210), 838 states have internal predecessors, (1210), 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 10:50:15,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1210 transitions. [2021-12-15 10:50:15,412 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1210 transitions. Word has length 118 [2021-12-15 10:50:15,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:50:15,413 INFO L470 AbstractCegarLoop]: Abstraction has 839 states and 1210 transitions. [2021-12-15 10:50:15,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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 10:50:15,413 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1210 transitions. [2021-12-15 10:50:15,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-12-15 10:50:15,414 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:50:15,414 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:50:15,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-15 10:50:15,414 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:50:15,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:50:15,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1820752595, now seen corresponding path program 1 times [2021-12-15 10:50:15,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:50:15,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662715958] [2021-12-15 10:50:15,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:50:15,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:50:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:50:15,649 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2021-12-15 10:50:15,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:50:15,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662715958] [2021-12-15 10:50:15,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662715958] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:50:15,650 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:50:15,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 10:50:15,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487013260] [2021-12-15 10:50:15,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:50:15,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 10:50:15,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:50:15,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 10:50:15,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 10:50:15,652 INFO L87 Difference]: Start difference. First operand 839 states and 1210 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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)