./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.06.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/openssl/s3_srvr.blast.06.i.cil-2.c -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 61a0aa66b71092ec74a73b9f534556f5bbb6f25851e8b5ad307fc7dd7f051667 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:52:05,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:52:05,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:52:05,761 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:52:05,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:52:05,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:52:05,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:52:05,768 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:52:05,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:52:05,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:52:05,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:52:05,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:52:05,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:52:05,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:52:05,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:52:05,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:52:05,780 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:52:05,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:52:05,782 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:52:05,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:52:05,788 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:52:05,788 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:52:05,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:52:05,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:52:05,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:52:05,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:52:05,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:52:05,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:52:05,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:52:05,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:52:05,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:52:05,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:52:05,799 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:52:05,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:52:05,800 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:52:05,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:52:05,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:52:05,801 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:52:05,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:52:05,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:52:05,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:52:05,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:52:05,805 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:52:05,838 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:52:05,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:52:05,839 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:52:05,839 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:52:05,840 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:52:05,840 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:52:05,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:52:05,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:52:05,841 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:52:05,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:52:05,841 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:52:05,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:52:05,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:52:05,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:52:05,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:52:05,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:52:05,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:52:05,842 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:52:05,842 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:52:05,843 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:52:05,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:52:05,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:52:05,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:52:05,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:52:05,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:52:05,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:52:05,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:52:05,844 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:52:05,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:52:05,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:52:05,845 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:52:05,845 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:52:05,845 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:52:05,845 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 -> 61a0aa66b71092ec74a73b9f534556f5bbb6f25851e8b5ad307fc7dd7f051667 [2022-07-11 23:52:06,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:52:06,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:52:06,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:52:06,024 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:52:06,027 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:52:06,027 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.06.i.cil-2.c [2022-07-11 23:52:06,087 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/826e4f89b/fab633319f7c403aa70fa39b3efb8065/FLAGe2a79154f [2022-07-11 23:52:06,521 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:52:06,525 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.06.i.cil-2.c [2022-07-11 23:52:06,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/826e4f89b/fab633319f7c403aa70fa39b3efb8065/FLAGe2a79154f [2022-07-11 23:52:06,551 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/826e4f89b/fab633319f7c403aa70fa39b3efb8065 [2022-07-11 23:52:06,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:52:06,555 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:52:06,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:52:06,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:52:06,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:52:06,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:52:06" (1/1) ... [2022-07-11 23:52:06,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd74c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:52:06, skipping insertion in model container [2022-07-11 23:52:06,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:52:06" (1/1) ... [2022-07-11 23:52:06,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:52:06,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:52:06,896 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/openssl/s3_srvr.blast.06.i.cil-2.c[78808,78821] [2022-07-11 23:52:06,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:52:06,914 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:52:07,011 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/openssl/s3_srvr.blast.06.i.cil-2.c[78808,78821] [2022-07-11 23:52:07,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:52:07,024 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:52:07,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:52:07 WrapperNode [2022-07-11 23:52:07,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:52:07,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:52:07,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:52:07,033 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:52:07,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:52:07" (1/1) ... [2022-07-11 23:52:07,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:52:07" (1/1) ... [2022-07-11 23:52:07,111 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 816 [2022-07-11 23:52:07,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:52:07,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:52:07,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:52:07,113 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:52:07,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:52:07" (1/1) ... [2022-07-11 23:52:07,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:52:07" (1/1) ... [2022-07-11 23:52:07,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:52:07" (1/1) ... [2022-07-11 23:52:07,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:52:07" (1/1) ... [2022-07-11 23:52:07,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:52:07" (1/1) ... [2022-07-11 23:52:07,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:52:07" (1/1) ... [2022-07-11 23:52:07,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:52:07" (1/1) ... [2022-07-11 23:52:07,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:52:07,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:52:07,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:52:07,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:52:07,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:52:07" (1/1) ... [2022-07-11 23:52:07,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:52:07,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:52:07,231 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-11 23:52:07,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-11 23:52:07,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:52:07,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-11 23:52:07,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:52:07,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:52:07,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-11 23:52:07,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:52:07,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:52:07,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:52:07,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:52:07,414 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:52:07,415 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:52:07,438 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:52:09,762 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-11 23:52:09,763 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-11 23:52:09,763 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:52:09,769 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:52:09,770 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:52:09,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:52:09 BoogieIcfgContainer [2022-07-11 23:52:09,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:52:09,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:52:09,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:52:09,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:52:09,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:52:06" (1/3) ... [2022-07-11 23:52:09,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6addbb04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:52:09, skipping insertion in model container [2022-07-11 23:52:09,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:52:07" (2/3) ... [2022-07-11 23:52:09,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6addbb04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:52:09, skipping insertion in model container [2022-07-11 23:52:09,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:52:09" (3/3) ... [2022-07-11 23:52:09,779 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.06.i.cil-2.c [2022-07-11 23:52:09,791 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:52:09,791 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:52:09,855 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:52:09,863 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3c03d17c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5f186240 [2022-07-11 23:52:09,863 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:52:09,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 160 states have (on average 1.7375) internal successors, (278), 161 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:09,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-11 23:52:09,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:09,877 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:09,878 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:09,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:09,881 INFO L85 PathProgramCache]: Analyzing trace with hash 271453869, now seen corresponding path program 1 times [2022-07-11 23:52:09,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:09,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102159956] [2022-07-11 23:52:09,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:09,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:52:10,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:10,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102159956] [2022-07-11 23:52:10,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102159956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:10,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:10,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:10,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285212226] [2022-07-11 23:52:10,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:10,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:10,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:10,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:10,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:10,334 INFO L87 Difference]: Start difference. First operand has 162 states, 160 states have (on average 1.7375) internal successors, (278), 161 states have internal predecessors, (278), 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 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:11,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:11,067 INFO L93 Difference]: Finished difference Result 455 states and 784 transitions. [2022-07-11 23:52:11,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:11,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2022-07-11 23:52:11,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:11,083 INFO L225 Difference]: With dead ends: 455 [2022-07-11 23:52:11,084 INFO L226 Difference]: Without dead ends: 278 [2022-07-11 23:52:11,088 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:11,091 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 176 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:11,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 511 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:52:11,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-07-11 23:52:11,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 189. [2022-07-11 23:52:11,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.6329787234042554) internal successors, (307), 188 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:11,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 307 transitions. [2022-07-11 23:52:11,136 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 307 transitions. Word has length 47 [2022-07-11 23:52:11,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:11,137 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 307 transitions. [2022-07-11 23:52:11,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:11,137 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 307 transitions. [2022-07-11 23:52:11,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-11 23:52:11,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:11,144 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:11,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:52:11,144 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:11,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:11,145 INFO L85 PathProgramCache]: Analyzing trace with hash -72299220, now seen corresponding path program 1 times [2022-07-11 23:52:11,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:11,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125819296] [2022-07-11 23:52:11,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:11,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:11,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:52:11,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:11,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125819296] [2022-07-11 23:52:11,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125819296] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:11,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:11,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:11,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206040960] [2022-07-11 23:52:11,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:11,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:11,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:11,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:11,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:11,319 INFO L87 Difference]: Start difference. First operand 189 states and 307 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:11,912 INFO L93 Difference]: Finished difference Result 396 states and 641 transitions. [2022-07-11 23:52:11,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:11,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-07-11 23:52:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:11,914 INFO L225 Difference]: With dead ends: 396 [2022-07-11 23:52:11,914 INFO L226 Difference]: Without dead ends: 217 [2022-07-11 23:52:11,915 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:11,916 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 22 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:11,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 541 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:52:11,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-07-11 23:52:11,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 200. [2022-07-11 23:52:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.6381909547738693) internal successors, (326), 199 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 326 transitions. [2022-07-11 23:52:11,925 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 326 transitions. Word has length 48 [2022-07-11 23:52:11,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:11,926 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 326 transitions. [2022-07-11 23:52:11,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:11,926 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 326 transitions. [2022-07-11 23:52:11,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-11 23:52:11,938 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:11,938 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:11,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:52:11,939 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:11,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:11,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1865586560, now seen corresponding path program 1 times [2022-07-11 23:52:11,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:11,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263177651] [2022-07-11 23:52:11,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:11,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:12,069 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:52:12,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:12,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263177651] [2022-07-11 23:52:12,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263177651] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:12,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:12,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:12,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019599759] [2022-07-11 23:52:12,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:12,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:12,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:12,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:12,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:12,072 INFO L87 Difference]: Start difference. First operand 200 states and 326 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:12,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:12,894 INFO L93 Difference]: Finished difference Result 546 states and 895 transitions. [2022-07-11 23:52:12,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:12,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2022-07-11 23:52:12,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:12,896 INFO L225 Difference]: With dead ends: 546 [2022-07-11 23:52:12,896 INFO L226 Difference]: Without dead ends: 367 [2022-07-11 23:52:12,897 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:12,897 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 165 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:12,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 730 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:52:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-07-11 23:52:12,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 232. [2022-07-11 23:52:12,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.632034632034632) internal successors, (377), 231 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:12,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 377 transitions. [2022-07-11 23:52:12,917 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 377 transitions. Word has length 61 [2022-07-11 23:52:12,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:12,917 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 377 transitions. [2022-07-11 23:52:12,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:12,918 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 377 transitions. [2022-07-11 23:52:12,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-11 23:52:12,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:12,921 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:12,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:52:12,922 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:12,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:12,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1829403441, now seen corresponding path program 1 times [2022-07-11 23:52:12,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:12,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266624763] [2022-07-11 23:52:12,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:12,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:52:13,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:13,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266624763] [2022-07-11 23:52:13,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266624763] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:13,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:13,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:13,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880293582] [2022-07-11 23:52:13,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:13,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:13,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:13,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:13,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:13,020 INFO L87 Difference]: Start difference. First operand 232 states and 377 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:13,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:13,484 INFO L93 Difference]: Finished difference Result 554 states and 898 transitions. [2022-07-11 23:52:13,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:13,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2022-07-11 23:52:13,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:13,487 INFO L225 Difference]: With dead ends: 554 [2022-07-11 23:52:13,488 INFO L226 Difference]: Without dead ends: 343 [2022-07-11 23:52:13,488 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:13,489 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 170 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:13,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 406 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:52:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-07-11 23:52:13,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 232. [2022-07-11 23:52:13,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.6147186147186148) internal successors, (373), 231 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:13,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 373 transitions. [2022-07-11 23:52:13,497 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 373 transitions. Word has length 62 [2022-07-11 23:52:13,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:13,497 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 373 transitions. [2022-07-11 23:52:13,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:13,497 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 373 transitions. [2022-07-11 23:52:13,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-11 23:52:13,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:13,498 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:13,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:52:13,499 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:13,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1620873285, now seen corresponding path program 1 times [2022-07-11 23:52:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:13,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288747000] [2022-07-11 23:52:13,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:13,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:52:13,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:13,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288747000] [2022-07-11 23:52:13,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288747000] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:13,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:13,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:13,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589035088] [2022-07-11 23:52:13,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:13,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:13,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:13,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:13,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:13,589 INFO L87 Difference]: Start difference. First operand 232 states and 373 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:14,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:14,102 INFO L93 Difference]: Finished difference Result 459 states and 735 transitions. [2022-07-11 23:52:14,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:14,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2022-07-11 23:52:14,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:14,104 INFO L225 Difference]: With dead ends: 459 [2022-07-11 23:52:14,104 INFO L226 Difference]: Without dead ends: 248 [2022-07-11 23:52:14,104 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:14,105 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 26 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:14,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 545 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:52:14,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-11 23:52:14,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 232. [2022-07-11 23:52:14,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.6103896103896105) internal successors, (372), 231 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 372 transitions. [2022-07-11 23:52:14,110 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 372 transitions. Word has length 62 [2022-07-11 23:52:14,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:14,111 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 372 transitions. [2022-07-11 23:52:14,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 372 transitions. [2022-07-11 23:52:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-11 23:52:14,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:14,112 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:14,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:52:14,112 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:14,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:14,112 INFO L85 PathProgramCache]: Analyzing trace with hash 519909764, now seen corresponding path program 1 times [2022-07-11 23:52:14,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:14,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41581991] [2022-07-11 23:52:14,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:14,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:14,202 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:52:14,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:14,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41581991] [2022-07-11 23:52:14,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41581991] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:14,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:14,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:14,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170483089] [2022-07-11 23:52:14,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:14,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:14,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:14,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:14,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:14,204 INFO L87 Difference]: Start difference. First operand 232 states and 372 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:14,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:14,555 INFO L93 Difference]: Finished difference Result 458 states and 733 transitions. [2022-07-11 23:52:14,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:14,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2022-07-11 23:52:14,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:14,556 INFO L225 Difference]: With dead ends: 458 [2022-07-11 23:52:14,556 INFO L226 Difference]: Without dead ends: 247 [2022-07-11 23:52:14,557 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:14,557 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 19 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:14,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 547 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:52:14,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-11 23:52:14,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 232. [2022-07-11 23:52:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.606060606060606) internal successors, (371), 231 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:14,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 371 transitions. [2022-07-11 23:52:14,562 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 371 transitions. Word has length 62 [2022-07-11 23:52:14,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:14,562 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 371 transitions. [2022-07-11 23:52:14,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:14,562 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 371 transitions. [2022-07-11 23:52:14,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-11 23:52:14,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:14,563 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:14,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:52:14,563 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:14,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:14,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1154887876, now seen corresponding path program 1 times [2022-07-11 23:52:14,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:14,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816280158] [2022-07-11 23:52:14,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:14,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:14,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:52:14,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:14,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816280158] [2022-07-11 23:52:14,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816280158] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:14,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:14,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:14,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837048416] [2022-07-11 23:52:14,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:14,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:14,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:14,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:14,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:14,642 INFO L87 Difference]: Start difference. First operand 232 states and 371 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:15,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:15,081 INFO L93 Difference]: Finished difference Result 554 states and 889 transitions. [2022-07-11 23:52:15,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:15,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2022-07-11 23:52:15,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:15,083 INFO L225 Difference]: With dead ends: 554 [2022-07-11 23:52:15,083 INFO L226 Difference]: Without dead ends: 343 [2022-07-11 23:52:15,083 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:15,084 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 163 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:15,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 406 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:52:15,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-07-11 23:52:15,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 233. [2022-07-11 23:52:15,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.5948275862068966) internal successors, (370), 232 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 370 transitions. [2022-07-11 23:52:15,089 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 370 transitions. Word has length 62 [2022-07-11 23:52:15,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:15,089 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 370 transitions. [2022-07-11 23:52:15,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:15,089 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 370 transitions. [2022-07-11 23:52:15,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-11 23:52:15,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:15,090 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:15,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:52:15,091 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:15,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:15,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1662386487, now seen corresponding path program 1 times [2022-07-11 23:52:15,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:15,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390828922] [2022-07-11 23:52:15,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:15,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:15,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:52:15,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:15,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390828922] [2022-07-11 23:52:15,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390828922] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:15,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:15,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:15,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258132065] [2022-07-11 23:52:15,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:15,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:15,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:15,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:15,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:15,154 INFO L87 Difference]: Start difference. First operand 233 states and 370 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:15,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:15,551 INFO L93 Difference]: Finished difference Result 458 states and 729 transitions. [2022-07-11 23:52:15,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:15,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2022-07-11 23:52:15,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:15,552 INFO L225 Difference]: With dead ends: 458 [2022-07-11 23:52:15,553 INFO L226 Difference]: Without dead ends: 246 [2022-07-11 23:52:15,553 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:15,554 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 22 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:15,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 551 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:52:15,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-11 23:52:15,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 233. [2022-07-11 23:52:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.5905172413793103) internal successors, (369), 232 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 369 transitions. [2022-07-11 23:52:15,558 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 369 transitions. Word has length 63 [2022-07-11 23:52:15,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:15,558 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 369 transitions. [2022-07-11 23:52:15,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:15,559 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 369 transitions. [2022-07-11 23:52:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-11 23:52:15,559 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:15,560 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:15,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:52:15,560 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:15,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:15,560 INFO L85 PathProgramCache]: Analyzing trace with hash -838476330, now seen corresponding path program 1 times [2022-07-11 23:52:15,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:15,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720258125] [2022-07-11 23:52:15,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:15,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:52:15,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:15,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720258125] [2022-07-11 23:52:15,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720258125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:15,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:15,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:15,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147270241] [2022-07-11 23:52:15,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:15,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:15,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:15,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:15,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:15,641 INFO L87 Difference]: Start difference. First operand 233 states and 369 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:16,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:16,099 INFO L93 Difference]: Finished difference Result 458 states and 728 transitions. [2022-07-11 23:52:16,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:16,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2022-07-11 23:52:16,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:16,101 INFO L225 Difference]: With dead ends: 458 [2022-07-11 23:52:16,101 INFO L226 Difference]: Without dead ends: 246 [2022-07-11 23:52:16,101 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:16,102 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 20 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:16,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 551 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:52:16,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-11 23:52:16,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 233. [2022-07-11 23:52:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.5862068965517242) internal successors, (368), 232 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:16,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 368 transitions. [2022-07-11 23:52:16,107 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 368 transitions. Word has length 64 [2022-07-11 23:52:16,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:16,107 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 368 transitions. [2022-07-11 23:52:16,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:16,107 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 368 transitions. [2022-07-11 23:52:16,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-11 23:52:16,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:16,108 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:16,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:52:16,108 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:16,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:16,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2036454322, now seen corresponding path program 1 times [2022-07-11 23:52:16,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:16,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280023809] [2022-07-11 23:52:16,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:16,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:16,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:52:16,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:16,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280023809] [2022-07-11 23:52:16,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280023809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:16,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:16,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:16,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990294667] [2022-07-11 23:52:16,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:16,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:16,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:16,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:16,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:16,204 INFO L87 Difference]: Start difference. First operand 233 states and 368 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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) [2022-07-11 23:52:17,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:17,008 INFO L93 Difference]: Finished difference Result 448 states and 714 transitions. [2022-07-11 23:52:17,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:17,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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 65 [2022-07-11 23:52:17,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:17,010 INFO L225 Difference]: With dead ends: 448 [2022-07-11 23:52:17,010 INFO L226 Difference]: Without dead ends: 236 [2022-07-11 23:52:17,010 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:17,010 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 11 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:17,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 565 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:52:17,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-11 23:52:17,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 233. [2022-07-11 23:52:17,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.581896551724138) internal successors, (367), 232 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:17,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 367 transitions. [2022-07-11 23:52:17,015 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 367 transitions. Word has length 65 [2022-07-11 23:52:17,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:17,015 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 367 transitions. [2022-07-11 23:52:17,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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) [2022-07-11 23:52:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 367 transitions. [2022-07-11 23:52:17,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-11 23:52:17,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:17,016 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:17,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-11 23:52:17,016 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:17,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:17,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1556245834, now seen corresponding path program 1 times [2022-07-11 23:52:17,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:17,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290562681] [2022-07-11 23:52:17,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:17,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:17,104 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:52:17,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:17,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290562681] [2022-07-11 23:52:17,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290562681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:17,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:17,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:17,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278387743] [2022-07-11 23:52:17,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:17,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:17,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:17,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:17,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:17,106 INFO L87 Difference]: Start difference. First operand 233 states and 367 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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) [2022-07-11 23:52:18,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:18,164 INFO L93 Difference]: Finished difference Result 485 states and 769 transitions. [2022-07-11 23:52:18,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:18,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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 65 [2022-07-11 23:52:18,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:18,166 INFO L225 Difference]: With dead ends: 485 [2022-07-11 23:52:18,166 INFO L226 Difference]: Without dead ends: 273 [2022-07-11 23:52:18,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:52:18,166 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 31 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:18,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 569 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-11 23:52:18,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-07-11 23:52:18,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 255. [2022-07-11 23:52:18,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.5826771653543308) internal successors, (402), 254 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:18,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 402 transitions. [2022-07-11 23:52:18,171 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 402 transitions. Word has length 65 [2022-07-11 23:52:18,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:18,171 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 402 transitions. [2022-07-11 23:52:18,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 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) [2022-07-11 23:52:18,172 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 402 transitions. [2022-07-11 23:52:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-11 23:52:18,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:18,172 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:18,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-11 23:52:18,173 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:18,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:18,173 INFO L85 PathProgramCache]: Analyzing trace with hash -120356007, now seen corresponding path program 1 times [2022-07-11 23:52:18,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:18,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289657454] [2022-07-11 23:52:18,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:18,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:18,257 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:52:18,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:18,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289657454] [2022-07-11 23:52:18,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289657454] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:18,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:18,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:18,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882335325] [2022-07-11 23:52:18,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:18,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:18,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:18,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:18,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:18,260 INFO L87 Difference]: Start difference. First operand 255 states and 402 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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) [2022-07-11 23:52:18,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:18,994 INFO L93 Difference]: Finished difference Result 599 states and 953 transitions. [2022-07-11 23:52:18,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:18,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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 79 [2022-07-11 23:52:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:18,996 INFO L225 Difference]: With dead ends: 599 [2022-07-11 23:52:18,997 INFO L226 Difference]: Without dead ends: 365 [2022-07-11 23:52:18,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:52:18,998 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 168 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:18,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 406 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:52:18,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-07-11 23:52:19,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 255. [2022-07-11 23:52:19,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.5669291338582678) internal successors, (398), 254 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 398 transitions. [2022-07-11 23:52:19,004 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 398 transitions. Word has length 79 [2022-07-11 23:52:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:19,004 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 398 transitions. [2022-07-11 23:52:19,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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) [2022-07-11 23:52:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 398 transitions. [2022-07-11 23:52:19,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-11 23:52:19,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:19,005 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:19,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-11 23:52:19,005 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:19,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:19,006 INFO L85 PathProgramCache]: Analyzing trace with hash 2020427042, now seen corresponding path program 1 times [2022-07-11 23:52:19,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:19,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907505915] [2022-07-11 23:52:19,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:19,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:52:19,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:19,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907505915] [2022-07-11 23:52:19,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907505915] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:19,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:19,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:19,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907183543] [2022-07-11 23:52:19,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:19,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:19,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:19,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:19,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:19,084 INFO L87 Difference]: Start difference. First operand 255 states and 398 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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) [2022-07-11 23:52:20,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:20,011 INFO L93 Difference]: Finished difference Result 506 states and 794 transitions. [2022-07-11 23:52:20,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:20,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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 79 [2022-07-11 23:52:20,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:20,013 INFO L225 Difference]: With dead ends: 506 [2022-07-11 23:52:20,013 INFO L226 Difference]: Without dead ends: 272 [2022-07-11 23:52:20,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:52:20,014 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 33 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:20,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 571 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-11 23:52:20,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-11 23:52:20,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 255. [2022-07-11 23:52:20,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.562992125984252) internal successors, (397), 254 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:20,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 397 transitions. [2022-07-11 23:52:20,020 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 397 transitions. Word has length 79 [2022-07-11 23:52:20,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:20,020 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 397 transitions. [2022-07-11 23:52:20,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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) [2022-07-11 23:52:20,020 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 397 transitions. [2022-07-11 23:52:20,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-11 23:52:20,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:20,021 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:20,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-11 23:52:20,022 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:20,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:20,022 INFO L85 PathProgramCache]: Analyzing trace with hash 933781849, now seen corresponding path program 1 times [2022-07-11 23:52:20,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:20,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843015598] [2022-07-11 23:52:20,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:20,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:52:20,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:20,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843015598] [2022-07-11 23:52:20,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843015598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:20,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:20,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:20,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019052446] [2022-07-11 23:52:20,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:20,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:20,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:20,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:20,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:20,134 INFO L87 Difference]: Start difference. First operand 255 states and 397 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:21,805 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:52:22,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:22,092 INFO L93 Difference]: Finished difference Result 599 states and 943 transitions. [2022-07-11 23:52:22,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:22,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 80 [2022-07-11 23:52:22,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:22,094 INFO L225 Difference]: With dead ends: 599 [2022-07-11 23:52:22,094 INFO L226 Difference]: Without dead ends: 365 [2022-07-11 23:52:22,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:52:22,095 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 166 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:22,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 406 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-11 23:52:22,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-07-11 23:52:22,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 255. [2022-07-11 23:52:22,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.547244094488189) internal successors, (393), 254 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:22,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 393 transitions. [2022-07-11 23:52:22,100 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 393 transitions. Word has length 80 [2022-07-11 23:52:22,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:22,100 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 393 transitions. [2022-07-11 23:52:22,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:22,101 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 393 transitions. [2022-07-11 23:52:22,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-11 23:52:22,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:22,101 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:22,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-11 23:52:22,102 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:22,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:22,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1950383628, now seen corresponding path program 1 times [2022-07-11 23:52:22,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:22,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037316697] [2022-07-11 23:52:22,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:22,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:52:22,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:22,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037316697] [2022-07-11 23:52:22,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037316697] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:22,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:22,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:22,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897255931] [2022-07-11 23:52:22,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:22,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:22,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:22,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:22,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:22,183 INFO L87 Difference]: Start difference. First operand 255 states and 393 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:24,188 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 [] [2022-07-11 23:52:24,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:24,528 INFO L93 Difference]: Finished difference Result 599 states and 935 transitions. [2022-07-11 23:52:24,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:24,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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 81 [2022-07-11 23:52:24,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:24,533 INFO L225 Difference]: With dead ends: 599 [2022-07-11 23:52:24,533 INFO L226 Difference]: Without dead ends: 365 [2022-07-11 23:52:24,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:52:24,534 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 164 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:24,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 406 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-11 23:52:24,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-07-11 23:52:24,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 255. [2022-07-11 23:52:24,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.531496062992126) internal successors, (389), 254 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:24,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 389 transitions. [2022-07-11 23:52:24,538 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 389 transitions. Word has length 81 [2022-07-11 23:52:24,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:24,539 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 389 transitions. [2022-07-11 23:52:24,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:24,539 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 389 transitions. [2022-07-11 23:52:24,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-11 23:52:24,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:24,540 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:24,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-11 23:52:24,540 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:24,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:24,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1927066452, now seen corresponding path program 1 times [2022-07-11 23:52:24,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:24,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483893302] [2022-07-11 23:52:24,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:24,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:52:24,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:24,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483893302] [2022-07-11 23:52:24,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483893302] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:24,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:24,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:24,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159039895] [2022-07-11 23:52:24,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:24,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:24,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:24,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:24,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:24,624 INFO L87 Difference]: Start difference. First operand 255 states and 389 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) [2022-07-11 23:52:25,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:25,553 INFO L93 Difference]: Finished difference Result 589 states and 914 transitions. [2022-07-11 23:52:25,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:25,554 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 82 [2022-07-11 23:52:25,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:25,555 INFO L225 Difference]: With dead ends: 589 [2022-07-11 23:52:25,555 INFO L226 Difference]: Without dead ends: 355 [2022-07-11 23:52:25,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:52:25,556 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 155 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:25,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 426 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-11 23:52:25,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-07-11 23:52:25,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 255. [2022-07-11 23:52:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 1.515748031496063) internal successors, (385), 254 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:25,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 385 transitions. [2022-07-11 23:52:25,560 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 385 transitions. Word has length 82 [2022-07-11 23:52:25,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:25,560 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 385 transitions. [2022-07-11 23:52:25,560 INFO L496 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) [2022-07-11 23:52:25,560 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 385 transitions. [2022-07-11 23:52:25,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-11 23:52:25,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:25,561 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:25,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-11 23:52:25,561 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:25,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:25,561 INFO L85 PathProgramCache]: Analyzing trace with hash -2120868205, now seen corresponding path program 1 times [2022-07-11 23:52:25,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:25,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096974858] [2022-07-11 23:52:25,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:25,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:52:25,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:25,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096974858] [2022-07-11 23:52:25,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096974858] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:25,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:25,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:25,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943954487] [2022-07-11 23:52:25,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:25,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:25,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:25,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:25,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:25,655 INFO L87 Difference]: Start difference. First operand 255 states and 385 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) [2022-07-11 23:52:26,663 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:52:26,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:26,898 INFO L93 Difference]: Finished difference Result 589 states and 906 transitions. [2022-07-11 23:52:26,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:26,899 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 87 [2022-07-11 23:52:26,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:26,900 INFO L225 Difference]: With dead ends: 589 [2022-07-11 23:52:26,900 INFO L226 Difference]: Without dead ends: 355 [2022-07-11 23:52:26,900 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:26,901 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 129 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:26,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 456 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-11 23:52:26,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-07-11 23:52:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 278. [2022-07-11 23:52:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.552346570397112) internal successors, (430), 277 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 430 transitions. [2022-07-11 23:52:26,905 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 430 transitions. Word has length 87 [2022-07-11 23:52:26,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:26,905 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 430 transitions. [2022-07-11 23:52:26,906 INFO L496 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) [2022-07-11 23:52:26,906 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 430 transitions. [2022-07-11 23:52:26,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-11 23:52:26,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:26,907 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1] [2022-07-11 23:52:26,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-11 23:52:26,907 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:26,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:26,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1055569381, now seen corresponding path program 1 times [2022-07-11 23:52:26,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:26,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838272083] [2022-07-11 23:52:26,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:26,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:26,987 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:52:26,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:26,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838272083] [2022-07-11 23:52:26,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838272083] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:26,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:26,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:26,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211552000] [2022-07-11 23:52:26,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:26,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:26,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:26,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:26,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:26,989 INFO L87 Difference]: Start difference. First operand 278 states and 430 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:28,227 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:52:28,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:28,463 INFO L93 Difference]: Finished difference Result 625 states and 974 transitions. [2022-07-11 23:52:28,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:28,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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 [2022-07-11 23:52:28,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:28,465 INFO L225 Difference]: With dead ends: 625 [2022-07-11 23:52:28,465 INFO L226 Difference]: Without dead ends: 368 [2022-07-11 23:52:28,465 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:28,466 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 90 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:28,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 547 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-11 23:52:28,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-07-11 23:52:28,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 312. [2022-07-11 23:52:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.5530546623794212) internal successors, (483), 311 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:28,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 483 transitions. [2022-07-11 23:52:28,470 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 483 transitions. Word has length 115 [2022-07-11 23:52:28,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:28,471 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 483 transitions. [2022-07-11 23:52:28,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:28,471 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 483 transitions. [2022-07-11 23:52:28,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-11 23:52:28,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:28,472 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1] [2022-07-11 23:52:28,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-11 23:52:28,472 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:28,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:28,473 INFO L85 PathProgramCache]: Analyzing trace with hash -978668583, now seen corresponding path program 1 times [2022-07-11 23:52:28,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:28,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22511898] [2022-07-11 23:52:28,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:28,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:52:28,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:28,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22511898] [2022-07-11 23:52:28,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22511898] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:28,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:28,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:28,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177223077] [2022-07-11 23:52:28,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:28,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:28,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:28,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:28,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:28,584 INFO L87 Difference]: Start difference. First operand 312 states and 483 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:29,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:29,655 INFO L93 Difference]: Finished difference Result 756 states and 1184 transitions. [2022-07-11 23:52:29,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:29,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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 [2022-07-11 23:52:29,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:29,657 INFO L225 Difference]: With dead ends: 756 [2022-07-11 23:52:29,657 INFO L226 Difference]: Without dead ends: 465 [2022-07-11 23:52:29,658 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:29,658 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 135 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:29,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 436 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-11 23:52:29,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-07-11 23:52:29,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 342. [2022-07-11 23:52:29,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 341 states have (on average 1.5601173020527859) internal successors, (532), 341 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:29,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 532 transitions. [2022-07-11 23:52:29,664 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 532 transitions. Word has length 115 [2022-07-11 23:52:29,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:29,665 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 532 transitions. [2022-07-11 23:52:29,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:29,665 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 532 transitions. [2022-07-11 23:52:29,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-11 23:52:29,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:29,666 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-11 23:52:29,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-11 23:52:29,666 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:29,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:29,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1185621468, now seen corresponding path program 1 times [2022-07-11 23:52:29,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:29,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093212769] [2022-07-11 23:52:29,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:29,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:29,778 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:52:29,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:29,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093212769] [2022-07-11 23:52:29,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093212769] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:29,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:29,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:29,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571343343] [2022-07-11 23:52:29,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:29,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:29,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:29,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:29,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:29,780 INFO L87 Difference]: Start difference. First operand 342 states and 532 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:30,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:30,670 INFO L93 Difference]: Finished difference Result 780 states and 1219 transitions. [2022-07-11 23:52:30,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:30,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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 121 [2022-07-11 23:52:30,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:30,671 INFO L225 Difference]: With dead ends: 780 [2022-07-11 23:52:30,671 INFO L226 Difference]: Without dead ends: 459 [2022-07-11 23:52:30,672 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:30,672 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 131 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:30,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 424 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-11 23:52:30,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-07-11 23:52:30,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 379. [2022-07-11 23:52:30,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 1.5634920634920635) internal successors, (591), 378 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:30,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 591 transitions. [2022-07-11 23:52:30,681 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 591 transitions. Word has length 121 [2022-07-11 23:52:30,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:30,681 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 591 transitions. [2022-07-11 23:52:30,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:30,681 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 591 transitions. [2022-07-11 23:52:30,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-11 23:52:30,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:30,682 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-11 23:52:30,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-11 23:52:30,683 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:30,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:30,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1466195913, now seen corresponding path program 1 times [2022-07-11 23:52:30,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:30,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799913875] [2022-07-11 23:52:30,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:30,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:52:30,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:30,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799913875] [2022-07-11 23:52:30,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799913875] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:30,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:30,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:30,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270681677] [2022-07-11 23:52:30,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:30,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:30,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:30,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:30,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:30,782 INFO L87 Difference]: Start difference. First operand 379 states and 591 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:31,962 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:52:32,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:32,185 INFO L93 Difference]: Finished difference Result 824 states and 1290 transitions. [2022-07-11 23:52:32,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:32,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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 122 [2022-07-11 23:52:32,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:32,187 INFO L225 Difference]: With dead ends: 824 [2022-07-11 23:52:32,187 INFO L226 Difference]: Without dead ends: 466 [2022-07-11 23:52:32,187 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:32,188 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 79 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:32,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 549 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-11 23:52:32,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-07-11 23:52:32,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 419. [2022-07-11 23:52:32,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 1.5645933014354068) internal successors, (654), 418 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 654 transitions. [2022-07-11 23:52:32,195 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 654 transitions. Word has length 122 [2022-07-11 23:52:32,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:32,195 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 654 transitions. [2022-07-11 23:52:32,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:32,195 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 654 transitions. [2022-07-11 23:52:32,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-11 23:52:32,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:32,196 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-11 23:52:32,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-11 23:52:32,196 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:32,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:32,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1225956167, now seen corresponding path program 1 times [2022-07-11 23:52:32,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:32,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092830222] [2022-07-11 23:52:32,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:32,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:32,289 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-11 23:52:32,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:32,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092830222] [2022-07-11 23:52:32,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092830222] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:32,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:32,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:32,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741495033] [2022-07-11 23:52:32,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:32,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:32,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:32,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:32,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:32,291 INFO L87 Difference]: Start difference. First operand 419 states and 654 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:33,447 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:52:33,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:33,616 INFO L93 Difference]: Finished difference Result 854 states and 1337 transitions. [2022-07-11 23:52:33,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:33,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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 122 [2022-07-11 23:52:33,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:33,618 INFO L225 Difference]: With dead ends: 854 [2022-07-11 23:52:33,618 INFO L226 Difference]: Without dead ends: 456 [2022-07-11 23:52:33,619 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:33,620 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 28 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:33,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 649 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-11 23:52:33,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2022-07-11 23:52:33,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 443. [2022-07-11 23:52:33,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.5588235294117647) internal successors, (689), 442 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:33,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 689 transitions. [2022-07-11 23:52:33,626 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 689 transitions. Word has length 122 [2022-07-11 23:52:33,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:33,626 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 689 transitions. [2022-07-11 23:52:33,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 689 transitions. [2022-07-11 23:52:33,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-11 23:52:33,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:33,628 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2022-07-11 23:52:33,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-11 23:52:33,628 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:33,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:33,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1414034971, now seen corresponding path program 1 times [2022-07-11 23:52:33,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:33,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905316747] [2022-07-11 23:52:33,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:33,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:52:33,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:33,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905316747] [2022-07-11 23:52:33,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905316747] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:33,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:33,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:33,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715308170] [2022-07-11 23:52:33,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:33,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:33,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:33,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:33,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:33,713 INFO L87 Difference]: Start difference. First operand 443 states and 689 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:35,719 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 [] [2022-07-11 23:52:35,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:35,942 INFO L93 Difference]: Finished difference Result 903 states and 1407 transitions. [2022-07-11 23:52:35,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:35,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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 129 [2022-07-11 23:52:35,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:35,944 INFO L225 Difference]: With dead ends: 903 [2022-07-11 23:52:35,944 INFO L226 Difference]: Without dead ends: 481 [2022-07-11 23:52:35,945 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:35,945 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 61 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:35,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 555 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 228 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-11 23:52:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-07-11 23:52:35,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 446. [2022-07-11 23:52:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.5550561797752809) internal successors, (692), 445 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 692 transitions. [2022-07-11 23:52:35,954 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 692 transitions. Word has length 129 [2022-07-11 23:52:35,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:35,955 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 692 transitions. [2022-07-11 23:52:35,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 692 transitions. [2022-07-11 23:52:35,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-11 23:52:35,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:35,956 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2022-07-11 23:52:35,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-11 23:52:35,957 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:35,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:35,957 INFO L85 PathProgramCache]: Analyzing trace with hash 417072415, now seen corresponding path program 1 times [2022-07-11 23:52:35,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:35,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359374657] [2022-07-11 23:52:35,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:35,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-11 23:52:36,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:36,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359374657] [2022-07-11 23:52:36,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359374657] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:36,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:36,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:36,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002461119] [2022-07-11 23:52:36,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:36,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:36,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:36,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:36,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:36,045 INFO L87 Difference]: Start difference. First operand 446 states and 692 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:36,854 INFO L93 Difference]: Finished difference Result 905 states and 1408 transitions. [2022-07-11 23:52:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:36,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2022-07-11 23:52:36,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:36,856 INFO L225 Difference]: With dead ends: 905 [2022-07-11 23:52:36,856 INFO L226 Difference]: Without dead ends: 480 [2022-07-11 23:52:36,856 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:36,857 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 83 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:36,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 557 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:52:36,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-07-11 23:52:36,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 446. [2022-07-11 23:52:36,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.552808988764045) internal successors, (691), 445 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:36,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 691 transitions. [2022-07-11 23:52:36,864 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 691 transitions. Word has length 136 [2022-07-11 23:52:36,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:36,864 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 691 transitions. [2022-07-11 23:52:36,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:36,867 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 691 transitions. [2022-07-11 23:52:36,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-11 23:52:36,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:36,868 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2022-07-11 23:52:36,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-11 23:52:36,869 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:36,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:36,869 INFO L85 PathProgramCache]: Analyzing trace with hash -466436575, now seen corresponding path program 1 times [2022-07-11 23:52:36,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:36,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444851128] [2022-07-11 23:52:36,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:36,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:36,939 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-11 23:52:36,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:36,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444851128] [2022-07-11 23:52:36,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444851128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:36,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:36,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:36,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175057462] [2022-07-11 23:52:36,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:36,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:36,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:36,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:36,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:36,941 INFO L87 Difference]: Start difference. First operand 446 states and 691 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:37,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:37,591 INFO L93 Difference]: Finished difference Result 883 states and 1374 transitions. [2022-07-11 23:52:37,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:37,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2022-07-11 23:52:37,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:37,593 INFO L225 Difference]: With dead ends: 883 [2022-07-11 23:52:37,593 INFO L226 Difference]: Without dead ends: 458 [2022-07-11 23:52:37,593 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:37,594 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 33 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:37,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 649 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:52:37,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2022-07-11 23:52:37,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 446. [2022-07-11 23:52:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.550561797752809) internal successors, (690), 445 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:37,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 690 transitions. [2022-07-11 23:52:37,608 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 690 transitions. Word has length 136 [2022-07-11 23:52:37,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:37,608 INFO L495 AbstractCegarLoop]: Abstraction has 446 states and 690 transitions. [2022-07-11 23:52:37,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:37,609 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 690 transitions. [2022-07-11 23:52:37,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-11 23:52:37,609 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:37,609 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:37,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-11 23:52:37,610 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:37,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:37,610 INFO L85 PathProgramCache]: Analyzing trace with hash 204789508, now seen corresponding path program 1 times [2022-07-11 23:52:37,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:37,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891105769] [2022-07-11 23:52:37,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:37,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-11 23:52:37,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:37,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891105769] [2022-07-11 23:52:37,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891105769] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:37,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:37,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:37,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952298512] [2022-07-11 23:52:37,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:37,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:37,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:37,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:37,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:37,701 INFO L87 Difference]: Start difference. First operand 446 states and 690 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:38,818 INFO L93 Difference]: Finished difference Result 988 states and 1534 transitions. [2022-07-11 23:52:38,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:38,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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 142 [2022-07-11 23:52:38,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:38,821 INFO L225 Difference]: With dead ends: 988 [2022-07-11 23:52:38,821 INFO L226 Difference]: Without dead ends: 563 [2022-07-11 23:52:38,822 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:38,822 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 138 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:38,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 456 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-11 23:52:38,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-07-11 23:52:38,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 476. [2022-07-11 23:52:38,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 1.5410526315789475) internal successors, (732), 475 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) [2022-07-11 23:52:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 732 transitions. [2022-07-11 23:52:38,832 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 732 transitions. Word has length 142 [2022-07-11 23:52:38,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:38,832 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 732 transitions. [2022-07-11 23:52:38,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:38,833 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 732 transitions. [2022-07-11 23:52:38,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-11 23:52:38,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:38,834 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-11 23:52:38,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-11 23:52:38,834 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:38,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:38,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1261572010, now seen corresponding path program 1 times [2022-07-11 23:52:38,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:38,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720088817] [2022-07-11 23:52:38,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:38,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-11 23:52:38,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:38,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720088817] [2022-07-11 23:52:38,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720088817] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:38,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:38,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:38,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432391052] [2022-07-11 23:52:38,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:38,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:38,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:38,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:38,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:38,934 INFO L87 Difference]: Start difference. First operand 476 states and 732 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:39,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:39,568 INFO L93 Difference]: Finished difference Result 1008 states and 1554 transitions. [2022-07-11 23:52:39,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:39,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 143 [2022-07-11 23:52:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:39,570 INFO L225 Difference]: With dead ends: 1008 [2022-07-11 23:52:39,570 INFO L226 Difference]: Without dead ends: 553 [2022-07-11 23:52:39,571 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:39,571 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 137 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:39,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 424 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:52:39,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-07-11 23:52:39,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 476. [2022-07-11 23:52:39,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 1.528421052631579) internal successors, (726), 475 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 726 transitions. [2022-07-11 23:52:39,580 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 726 transitions. Word has length 143 [2022-07-11 23:52:39,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:39,581 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 726 transitions. [2022-07-11 23:52:39,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 726 transitions. [2022-07-11 23:52:39,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-11 23:52:39,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:39,582 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2022-07-11 23:52:39,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-11 23:52:39,583 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:39,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:39,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1455297220, now seen corresponding path program 1 times [2022-07-11 23:52:39,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:39,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845916419] [2022-07-11 23:52:39,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:39,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-11 23:52:39,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:39,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845916419] [2022-07-11 23:52:39,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845916419] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:39,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:39,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:39,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790004709] [2022-07-11 23:52:39,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:39,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:39,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:39,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:39,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:39,680 INFO L87 Difference]: Start difference. First operand 476 states and 726 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:40,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:40,474 INFO L93 Difference]: Finished difference Result 963 states and 1474 transitions. [2022-07-11 23:52:40,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:40,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2022-07-11 23:52:40,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:40,475 INFO L225 Difference]: With dead ends: 963 [2022-07-11 23:52:40,475 INFO L226 Difference]: Without dead ends: 508 [2022-07-11 23:52:40,480 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:40,480 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 73 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:40,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 575 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:52:40,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-07-11 23:52:40,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 476. [2022-07-11 23:52:40,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 1.5263157894736843) internal successors, (725), 475 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 725 transitions. [2022-07-11 23:52:40,487 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 725 transitions. Word has length 144 [2022-07-11 23:52:40,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:40,487 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 725 transitions. [2022-07-11 23:52:40,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:40,487 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 725 transitions. [2022-07-11 23:52:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-11 23:52:40,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:40,488 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2022-07-11 23:52:40,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-11 23:52:40,489 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:40,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:40,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1532527678, now seen corresponding path program 1 times [2022-07-11 23:52:40,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:40,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946110296] [2022-07-11 23:52:40,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:40,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:40,580 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-11 23:52:40,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:40,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946110296] [2022-07-11 23:52:40,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946110296] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:40,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:40,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:52:40,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818570034] [2022-07-11 23:52:40,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:40,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:52:40,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:40,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:52:40,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:52:40,582 INFO L87 Difference]: Start difference. First operand 476 states and 725 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:40,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:40,645 INFO L93 Difference]: Finished difference Result 1383 states and 2123 transitions. [2022-07-11 23:52:40,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:52:40,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 144 [2022-07-11 23:52:40,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:40,647 INFO L225 Difference]: With dead ends: 1383 [2022-07-11 23:52:40,647 INFO L226 Difference]: Without dead ends: 928 [2022-07-11 23:52:40,648 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:40,648 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 154 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:40,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 446 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:52:40,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2022-07-11 23:52:40,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 928. [2022-07-11 23:52:40,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 927 states have (on average 1.5113268608414239) internal successors, (1401), 927 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:40,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1401 transitions. [2022-07-11 23:52:40,660 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1401 transitions. Word has length 144 [2022-07-11 23:52:40,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:40,660 INFO L495 AbstractCegarLoop]: Abstraction has 928 states and 1401 transitions. [2022-07-11 23:52:40,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:40,661 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1401 transitions. [2022-07-11 23:52:40,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-11 23:52:40,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:40,662 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2022-07-11 23:52:40,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-11 23:52:40,662 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:40,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:40,663 INFO L85 PathProgramCache]: Analyzing trace with hash -500866368, now seen corresponding path program 1 times [2022-07-11 23:52:40,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:40,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111710668] [2022-07-11 23:52:40,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:40,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:40,730 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-11 23:52:40,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:40,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111710668] [2022-07-11 23:52:40,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111710668] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:40,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:40,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:52:40,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304414291] [2022-07-11 23:52:40,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:40,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:52:40,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:40,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:52:40,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:52:40,732 INFO L87 Difference]: Start difference. First operand 928 states and 1401 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:40,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:40,770 INFO L93 Difference]: Finished difference Result 1862 states and 2814 transitions. [2022-07-11 23:52:40,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:52:40,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2022-07-11 23:52:40,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:40,773 INFO L225 Difference]: With dead ends: 1862 [2022-07-11 23:52:40,773 INFO L226 Difference]: Without dead ends: 955 [2022-07-11 23:52:40,774 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:40,783 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 15 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:40,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 434 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:52:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2022-07-11 23:52:40,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 955. [2022-07-11 23:52:40,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 954 states have (on average 1.5052410901467506) internal successors, (1436), 954 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1436 transitions. [2022-07-11 23:52:40,796 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1436 transitions. Word has length 144 [2022-07-11 23:52:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:40,796 INFO L495 AbstractCegarLoop]: Abstraction has 955 states and 1436 transitions. [2022-07-11 23:52:40,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:40,798 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1436 transitions. [2022-07-11 23:52:40,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-11 23:52:40,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:40,799 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2022-07-11 23:52:40,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-11 23:52:40,800 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:40,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:40,800 INFO L85 PathProgramCache]: Analyzing trace with hash 360967234, now seen corresponding path program 1 times [2022-07-11 23:52:40,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:40,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720622298] [2022-07-11 23:52:40,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:40,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:40,891 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-07-11 23:52:40,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:40,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720622298] [2022-07-11 23:52:40,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720622298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:40,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:40,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:52:40,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615048767] [2022-07-11 23:52:40,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:40,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:52:40,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:40,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:52:40,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:52:40,893 INFO L87 Difference]: Start difference. First operand 955 states and 1436 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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) [2022-07-11 23:52:40,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:40,927 INFO L93 Difference]: Finished difference Result 1891 states and 2850 transitions. [2022-07-11 23:52:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:52:40,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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 144 [2022-07-11 23:52:40,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:40,929 INFO L225 Difference]: With dead ends: 1891 [2022-07-11 23:52:40,929 INFO L226 Difference]: Without dead ends: 957 [2022-07-11 23:52:40,930 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:40,931 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:40,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 413 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:52:40,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2022-07-11 23:52:40,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 957. [2022-07-11 23:52:40,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 956 states have (on average 1.50418410041841) internal successors, (1438), 956 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:40,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1438 transitions. [2022-07-11 23:52:40,944 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1438 transitions. Word has length 144 [2022-07-11 23:52:40,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:40,944 INFO L495 AbstractCegarLoop]: Abstraction has 957 states and 1438 transitions. [2022-07-11 23:52:40,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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) [2022-07-11 23:52:40,944 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1438 transitions. [2022-07-11 23:52:40,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-11 23:52:40,946 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:40,946 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2022-07-11 23:52:40,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-11 23:52:40,946 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:40,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:40,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1469229848, now seen corresponding path program 1 times [2022-07-11 23:52:40,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:40,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409230106] [2022-07-11 23:52:40,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:40,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-11 23:52:41,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:41,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409230106] [2022-07-11 23:52:41,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409230106] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:41,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:41,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:52:41,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667593120] [2022-07-11 23:52:41,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:41,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:52:41,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:41,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:52:41,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:52:41,025 INFO L87 Difference]: Start difference. First operand 957 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:41,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:41,093 INFO L93 Difference]: Finished difference Result 2343 states and 3547 transitions. [2022-07-11 23:52:41,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:52:41,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2022-07-11 23:52:41,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:41,098 INFO L225 Difference]: With dead ends: 2343 [2022-07-11 23:52:41,098 INFO L226 Difference]: Without dead ends: 1409 [2022-07-11 23:52:41,099 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:41,100 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 159 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:41,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 594 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:52:41,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2022-07-11 23:52:41,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1409. [2022-07-11 23:52:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1408 states have (on average 1.5014204545454546) internal successors, (2114), 1408 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:41,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 2114 transitions. [2022-07-11 23:52:41,118 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 2114 transitions. Word has length 146 [2022-07-11 23:52:41,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:41,118 INFO L495 AbstractCegarLoop]: Abstraction has 1409 states and 2114 transitions. [2022-07-11 23:52:41,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 2114 transitions. [2022-07-11 23:52:41,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-11 23:52:41,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:41,121 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:41,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-11 23:52:41,121 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:41,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:41,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1434763751, now seen corresponding path program 1 times [2022-07-11 23:52:41,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:41,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124010437] [2022-07-11 23:52:41,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:41,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:41,213 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-11 23:52:41,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:41,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124010437] [2022-07-11 23:52:41,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124010437] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:41,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:41,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:41,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450523113] [2022-07-11 23:52:41,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:41,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:41,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:41,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:41,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:41,215 INFO L87 Difference]: Start difference. First operand 1409 states and 2114 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:42,368 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:52:42,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:42,597 INFO L93 Difference]: Finished difference Result 2948 states and 4429 transitions. [2022-07-11 23:52:42,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:42,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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 175 [2022-07-11 23:52:42,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:42,601 INFO L225 Difference]: With dead ends: 2948 [2022-07-11 23:52:42,602 INFO L226 Difference]: Without dead ends: 1562 [2022-07-11 23:52:42,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:52:42,603 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 42 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:42,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 665 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-11 23:52:42,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2022-07-11 23:52:42,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1493. [2022-07-11 23:52:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1492 states have (on average 1.5033512064343164) internal successors, (2243), 1492 states have internal predecessors, (2243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:42,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 2243 transitions. [2022-07-11 23:52:42,620 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 2243 transitions. Word has length 175 [2022-07-11 23:52:42,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:42,621 INFO L495 AbstractCegarLoop]: Abstraction has 1493 states and 2243 transitions. [2022-07-11 23:52:42,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 2243 transitions. [2022-07-11 23:52:42,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-11 23:52:42,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:42,623 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:42,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-11 23:52:42,624 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:42,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:42,624 INFO L85 PathProgramCache]: Analyzing trace with hash -866603135, now seen corresponding path program 1 times [2022-07-11 23:52:42,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:42,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951063737] [2022-07-11 23:52:42,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:42,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-07-11 23:52:42,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:42,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951063737] [2022-07-11 23:52:42,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951063737] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:42,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:42,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:42,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396714087] [2022-07-11 23:52:42,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:42,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:42,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:42,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:42,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:42,744 INFO L87 Difference]: Start difference. First operand 1493 states and 2243 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:43,212 INFO L93 Difference]: Finished difference Result 3186 states and 4762 transitions. [2022-07-11 23:52:43,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:43,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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 189 [2022-07-11 23:52:43,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:43,216 INFO L225 Difference]: With dead ends: 3186 [2022-07-11 23:52:43,216 INFO L226 Difference]: Without dead ends: 1716 [2022-07-11 23:52:43,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:52:43,217 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 149 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:43,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 426 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:52:43,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2022-07-11 23:52:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1493. [2022-07-11 23:52:43,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1492 states have (on average 1.4892761394101877) internal successors, (2222), 1492 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 2222 transitions. [2022-07-11 23:52:43,239 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 2222 transitions. Word has length 189 [2022-07-11 23:52:43,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:43,239 INFO L495 AbstractCegarLoop]: Abstraction has 1493 states and 2222 transitions. [2022-07-11 23:52:43,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:43,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 2222 transitions. [2022-07-11 23:52:43,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-07-11 23:52:43,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:43,242 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:43,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-11 23:52:43,243 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:43,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:43,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1420236190, now seen corresponding path program 1 times [2022-07-11 23:52:43,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:43,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548792653] [2022-07-11 23:52:43,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:43,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 252 proven. 38 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-11 23:52:43,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:43,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548792653] [2022-07-11 23:52:43,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548792653] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:52:43,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101034330] [2022-07-11 23:52:43,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:43,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:52:43,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:52:43,351 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:52:43,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-11 23:52:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:43,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 1186 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:52:43,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:52:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-11 23:52:44,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:52:44,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101034330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:44,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:52:44,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-11 23:52:44,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459009216] [2022-07-11 23:52:44,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:44,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:52:44,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:44,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:52:44,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:52:44,101 INFO L87 Difference]: Start difference. First operand 1493 states and 2222 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:44,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:44,178 INFO L93 Difference]: Finished difference Result 3444 states and 5152 transitions. [2022-07-11 23:52:44,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:52:44,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 197 [2022-07-11 23:52:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:44,183 INFO L225 Difference]: With dead ends: 3444 [2022-07-11 23:52:44,183 INFO L226 Difference]: Without dead ends: 1974 [2022-07-11 23:52:44,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:52:44,185 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 166 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:44,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 387 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:52:44,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2022-07-11 23:52:44,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1974. [2022-07-11 23:52:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1974 states, 1973 states have (on average 1.490116573745565) internal successors, (2940), 1973 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:44,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1974 states to 1974 states and 2940 transitions. [2022-07-11 23:52:44,212 INFO L78 Accepts]: Start accepts. Automaton has 1974 states and 2940 transitions. Word has length 197 [2022-07-11 23:52:44,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:44,212 INFO L495 AbstractCegarLoop]: Abstraction has 1974 states and 2940 transitions. [2022-07-11 23:52:44,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:44,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1974 states and 2940 transitions. [2022-07-11 23:52:44,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-11 23:52:44,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:44,215 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:44,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:52:44,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-11 23:52:44,437 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:44,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:44,438 INFO L85 PathProgramCache]: Analyzing trace with hash 2107016587, now seen corresponding path program 1 times [2022-07-11 23:52:44,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:44,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940117968] [2022-07-11 23:52:44,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:44,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:44,560 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-11 23:52:44,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:44,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940117968] [2022-07-11 23:52:44,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940117968] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:44,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:44,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:52:44,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94125569] [2022-07-11 23:52:44,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:44,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:52:44,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:44,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:52:44,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:52:44,562 INFO L87 Difference]: Start difference. First operand 1974 states and 2940 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:44,638 INFO L93 Difference]: Finished difference Result 4406 states and 6588 transitions. [2022-07-11 23:52:44,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:52:44,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2022-07-11 23:52:44,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:44,644 INFO L225 Difference]: With dead ends: 4406 [2022-07-11 23:52:44,644 INFO L226 Difference]: Without dead ends: 2455 [2022-07-11 23:52:44,646 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:44,646 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 163 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:44,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 386 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:52:44,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2022-07-11 23:52:44,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 2455. [2022-07-11 23:52:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2455 states, 2454 states have (on average 1.4910350448247758) internal successors, (3659), 2454 states have internal predecessors, (3659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:44,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2455 states to 2455 states and 3659 transitions. [2022-07-11 23:52:44,677 INFO L78 Accepts]: Start accepts. Automaton has 2455 states and 3659 transitions. Word has length 199 [2022-07-11 23:52:44,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:44,677 INFO L495 AbstractCegarLoop]: Abstraction has 2455 states and 3659 transitions. [2022-07-11 23:52:44,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:44,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2455 states and 3659 transitions. [2022-07-11 23:52:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-07-11 23:52:44,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:44,681 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:44,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-11 23:52:44,681 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:44,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:44,681 INFO L85 PathProgramCache]: Analyzing trace with hash 447893990, now seen corresponding path program 1 times [2022-07-11 23:52:44,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:44,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794946666] [2022-07-11 23:52:44,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:44,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:44,806 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-07-11 23:52:44,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:44,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794946666] [2022-07-11 23:52:44,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794946666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:44,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:44,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:52:44,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769823813] [2022-07-11 23:52:44,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:44,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:52:44,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:44,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:52:44,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:52:44,810 INFO L87 Difference]: Start difference. First operand 2455 states and 3659 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:44,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:44,893 INFO L93 Difference]: Finished difference Result 5368 states and 8026 transitions. [2022-07-11 23:52:44,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:52:44,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2022-07-11 23:52:44,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:44,901 INFO L225 Difference]: With dead ends: 5368 [2022-07-11 23:52:44,901 INFO L226 Difference]: Without dead ends: 2936 [2022-07-11 23:52:44,903 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:44,903 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 170 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:44,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 385 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:52:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2022-07-11 23:52:44,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 2936. [2022-07-11 23:52:44,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2936 states, 2935 states have (on average 1.4919931856899489) internal successors, (4379), 2935 states have internal predecessors, (4379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:44,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 4379 transitions. [2022-07-11 23:52:44,941 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 4379 transitions. Word has length 238 [2022-07-11 23:52:44,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:44,941 INFO L495 AbstractCegarLoop]: Abstraction has 2936 states and 4379 transitions. [2022-07-11 23:52:44,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:44,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 4379 transitions. [2022-07-11 23:52:44,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-07-11 23:52:44,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:44,945 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:44,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-11 23:52:44,945 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:44,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:44,947 INFO L85 PathProgramCache]: Analyzing trace with hash 230867452, now seen corresponding path program 1 times [2022-07-11 23:52:44,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:44,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319543273] [2022-07-11 23:52:44,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:44,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-07-11 23:52:45,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:45,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319543273] [2022-07-11 23:52:45,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319543273] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:45,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:45,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:52:45,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449740085] [2022-07-11 23:52:45,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:45,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:52:45,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:45,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:52:45,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:52:45,069 INFO L87 Difference]: Start difference. First operand 2936 states and 4379 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:45,155 INFO L93 Difference]: Finished difference Result 6330 states and 9466 transitions. [2022-07-11 23:52:45,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:52:45,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 240 [2022-07-11 23:52:45,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:45,173 INFO L225 Difference]: With dead ends: 6330 [2022-07-11 23:52:45,173 INFO L226 Difference]: Without dead ends: 3417 [2022-07-11 23:52:45,176 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:45,176 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 171 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:45,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 384 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:52:45,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3417 states. [2022-07-11 23:52:45,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3417 to 3417. [2022-07-11 23:52:45,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3417 states, 3416 states have (on average 1.4929742388758782) internal successors, (5100), 3416 states have internal predecessors, (5100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:45,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 3417 states and 5100 transitions. [2022-07-11 23:52:45,240 INFO L78 Accepts]: Start accepts. Automaton has 3417 states and 5100 transitions. Word has length 240 [2022-07-11 23:52:45,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:45,241 INFO L495 AbstractCegarLoop]: Abstraction has 3417 states and 5100 transitions. [2022-07-11 23:52:45,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:45,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 5100 transitions. [2022-07-11 23:52:45,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2022-07-11 23:52:45,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:45,246 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:45,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-11 23:52:45,246 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:45,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:45,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1840467843, now seen corresponding path program 1 times [2022-07-11 23:52:45,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:45,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789878379] [2022-07-11 23:52:45,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:45,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:45,369 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2022-07-11 23:52:45,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:45,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789878379] [2022-07-11 23:52:45,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789878379] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:45,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:45,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:52:45,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121991733] [2022-07-11 23:52:45,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:45,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:52:45,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:45,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:52:45,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:52:45,372 INFO L87 Difference]: Start difference. First operand 3417 states and 5100 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:45,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:45,468 INFO L93 Difference]: Finished difference Result 7284 states and 10895 transitions. [2022-07-11 23:52:45,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:52:45,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272 [2022-07-11 23:52:45,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:45,473 INFO L225 Difference]: With dead ends: 7284 [2022-07-11 23:52:45,473 INFO L226 Difference]: Without dead ends: 3890 [2022-07-11 23:52:45,476 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:45,476 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 152 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:45,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 593 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:52:45,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2022-07-11 23:52:45,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 3890. [2022-07-11 23:52:45,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3890 states, 3889 states have (on average 1.4924145024427873) internal successors, (5804), 3889 states have internal predecessors, (5804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:45,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3890 states to 3890 states and 5804 transitions. [2022-07-11 23:52:45,531 INFO L78 Accepts]: Start accepts. Automaton has 3890 states and 5804 transitions. Word has length 272 [2022-07-11 23:52:45,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:45,531 INFO L495 AbstractCegarLoop]: Abstraction has 3890 states and 5804 transitions. [2022-07-11 23:52:45,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:45,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states and 5804 transitions. [2022-07-11 23:52:45,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2022-07-11 23:52:45,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:45,536 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:45,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-11 23:52:45,537 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:45,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:45,537 INFO L85 PathProgramCache]: Analyzing trace with hash 943074565, now seen corresponding path program 1 times [2022-07-11 23:52:45,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:45,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245603644] [2022-07-11 23:52:45,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:45,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:45,659 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-07-11 23:52:45,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:45,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245603644] [2022-07-11 23:52:45,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245603644] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:45,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:45,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:52:45,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515292043] [2022-07-11 23:52:45,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:45,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:52:45,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:45,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:52:45,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:52:45,662 INFO L87 Difference]: Start difference. First operand 3890 states and 5804 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:45,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:45,762 INFO L93 Difference]: Finished difference Result 8205 states and 12267 transitions. [2022-07-11 23:52:45,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:52:45,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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 272 [2022-07-11 23:52:45,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:45,769 INFO L225 Difference]: With dead ends: 8205 [2022-07-11 23:52:45,769 INFO L226 Difference]: Without dead ends: 4338 [2022-07-11 23:52:45,772 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:45,772 INFO L413 NwaCegarLoop]: 407 mSDtfsCounter, 161 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:45,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 596 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:52:45,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4338 states. [2022-07-11 23:52:45,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4338 to 4338. [2022-07-11 23:52:45,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4338 states, 4337 states have (on average 1.4913534701406501) internal successors, (6468), 4337 states have internal predecessors, (6468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4338 states to 4338 states and 6468 transitions. [2022-07-11 23:52:45,827 INFO L78 Accepts]: Start accepts. Automaton has 4338 states and 6468 transitions. Word has length 272 [2022-07-11 23:52:45,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:45,828 INFO L495 AbstractCegarLoop]: Abstraction has 4338 states and 6468 transitions. [2022-07-11 23:52:45,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:45,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4338 states and 6468 transitions. [2022-07-11 23:52:45,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2022-07-11 23:52:45,835 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:45,835 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:45,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-11 23:52:45,836 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:45,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:45,836 INFO L85 PathProgramCache]: Analyzing trace with hash 727620858, now seen corresponding path program 1 times [2022-07-11 23:52:45,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:45,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055002320] [2022-07-11 23:52:45,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:45,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2022-07-11 23:52:45,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:45,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055002320] [2022-07-11 23:52:45,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055002320] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:45,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:45,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:52:45,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349930273] [2022-07-11 23:52:45,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:45,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:52:45,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:45,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:52:45,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:52:45,994 INFO L87 Difference]: Start difference. First operand 4338 states and 6468 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:46,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:46,095 INFO L93 Difference]: Finished difference Result 9134 states and 13644 transitions. [2022-07-11 23:52:46,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:52:46,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 347 [2022-07-11 23:52:46,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:46,102 INFO L225 Difference]: With dead ends: 9134 [2022-07-11 23:52:46,102 INFO L226 Difference]: Without dead ends: 4819 [2022-07-11 23:52:46,105 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:46,106 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 160 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:46,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 381 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:52:46,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4819 states. [2022-07-11 23:52:46,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4819 to 4819. [2022-07-11 23:52:46,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4819 states, 4818 states have (on average 1.4927355749273556) internal successors, (7192), 4818 states have internal predecessors, (7192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4819 states to 4819 states and 7192 transitions. [2022-07-11 23:52:46,194 INFO L78 Accepts]: Start accepts. Automaton has 4819 states and 7192 transitions. Word has length 347 [2022-07-11 23:52:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:46,194 INFO L495 AbstractCegarLoop]: Abstraction has 4819 states and 7192 transitions. [2022-07-11 23:52:46,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:46,195 INFO L276 IsEmpty]: Start isEmpty. Operand 4819 states and 7192 transitions. [2022-07-11 23:52:46,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2022-07-11 23:52:46,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:46,201 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:46,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-11 23:52:46,201 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:46,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:46,201 INFO L85 PathProgramCache]: Analyzing trace with hash 54456075, now seen corresponding path program 1 times [2022-07-11 23:52:46,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:46,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15170038] [2022-07-11 23:52:46,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:46,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:46,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1443 backedges. 501 proven. 0 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2022-07-11 23:52:46,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:46,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15170038] [2022-07-11 23:52:46,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15170038] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:46,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:46,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:52:46,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349257881] [2022-07-11 23:52:46,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:46,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:52:46,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:46,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:52:46,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:52:46,372 INFO L87 Difference]: Start difference. First operand 4819 states and 7192 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:46,481 INFO L93 Difference]: Finished difference Result 10096 states and 15092 transitions. [2022-07-11 23:52:46,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:52:46,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 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 388 [2022-07-11 23:52:46,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:46,489 INFO L225 Difference]: With dead ends: 10096 [2022-07-11 23:52:46,489 INFO L226 Difference]: Without dead ends: 5300 [2022-07-11 23:52:46,495 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:46,500 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 161 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:46,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 380 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:52:46,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5300 states. [2022-07-11 23:52:46,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5300 to 5300. [2022-07-11 23:52:46,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5300 states, 5299 states have (on average 1.4940554821664465) internal successors, (7917), 5299 states have internal predecessors, (7917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:46,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5300 states to 5300 states and 7917 transitions. [2022-07-11 23:52:46,581 INFO L78 Accepts]: Start accepts. Automaton has 5300 states and 7917 transitions. Word has length 388 [2022-07-11 23:52:46,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:46,582 INFO L495 AbstractCegarLoop]: Abstraction has 5300 states and 7917 transitions. [2022-07-11 23:52:46,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:46,582 INFO L276 IsEmpty]: Start isEmpty. Operand 5300 states and 7917 transitions. [2022-07-11 23:52:46,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2022-07-11 23:52:46,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:46,591 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:46,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-11 23:52:46,591 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:46,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:46,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1652971603, now seen corresponding path program 1 times [2022-07-11 23:52:46,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:46,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962207789] [2022-07-11 23:52:46,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:46,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2022-07-11 23:52:46,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:46,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962207789] [2022-07-11 23:52:46,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962207789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:46,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:46,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:52:46,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364185992] [2022-07-11 23:52:46,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:46,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:52:46,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:46,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:52:46,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:52:46,773 INFO L87 Difference]: Start difference. First operand 5300 states and 7917 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:46,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:46,869 INFO L93 Difference]: Finished difference Result 11051 states and 16531 transitions. [2022-07-11 23:52:46,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:52:46,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 395 [2022-07-11 23:52:46,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:46,879 INFO L225 Difference]: With dead ends: 11051 [2022-07-11 23:52:46,879 INFO L226 Difference]: Without dead ends: 5774 [2022-07-11 23:52:46,885 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:46,885 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 150 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:46,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 593 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:52:46,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5774 states. [2022-07-11 23:52:46,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5774 to 5774. [2022-07-11 23:52:46,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5774 states, 5773 states have (on average 1.4935042438939892) internal successors, (8622), 5773 states have internal predecessors, (8622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5774 states to 5774 states and 8622 transitions. [2022-07-11 23:52:46,963 INFO L78 Accepts]: Start accepts. Automaton has 5774 states and 8622 transitions. Word has length 395 [2022-07-11 23:52:46,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:46,964 INFO L495 AbstractCegarLoop]: Abstraction has 5774 states and 8622 transitions. [2022-07-11 23:52:46,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 5774 states and 8622 transitions. [2022-07-11 23:52:46,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2022-07-11 23:52:46,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:46,972 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:46,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-11 23:52:46,972 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:46,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:46,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1960737092, now seen corresponding path program 1 times [2022-07-11 23:52:46,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:46,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323132573] [2022-07-11 23:52:46,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:46,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2119 backedges. 641 proven. 0 refuted. 0 times theorem prover too weak. 1478 trivial. 0 not checked. [2022-07-11 23:52:47,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:47,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323132573] [2022-07-11 23:52:47,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323132573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:47,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:47,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:52:47,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089640943] [2022-07-11 23:52:47,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:47,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:52:47,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:47,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:52:47,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:52:47,157 INFO L87 Difference]: Start difference. First operand 5774 states and 8622 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:47,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:47,279 INFO L93 Difference]: Finished difference Result 12006 states and 17952 transitions. [2022-07-11 23:52:47,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:52:47,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 471 [2022-07-11 23:52:47,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:47,288 INFO L225 Difference]: With dead ends: 12006 [2022-07-11 23:52:47,289 INFO L226 Difference]: Without dead ends: 6255 [2022-07-11 23:52:47,293 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:47,295 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 160 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:47,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 378 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:52:47,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6255 states. [2022-07-11 23:52:47,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6255 to 6255. [2022-07-11 23:52:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6255 states, 6254 states have (on average 1.4948832747041894) internal successors, (9349), 6254 states have internal predecessors, (9349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:47,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 9349 transitions. [2022-07-11 23:52:47,409 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 9349 transitions. Word has length 471 [2022-07-11 23:52:47,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:47,410 INFO L495 AbstractCegarLoop]: Abstraction has 6255 states and 9349 transitions. [2022-07-11 23:52:47,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:47,410 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 9349 transitions. [2022-07-11 23:52:47,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2022-07-11 23:52:47,419 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:47,419 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 6, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:47,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-11 23:52:47,420 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:47,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:47,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1847595616, now seen corresponding path program 1 times [2022-07-11 23:52:47,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:47,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987439335] [2022-07-11 23:52:47,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:47,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 744 proven. 7 refuted. 0 times theorem prover too weak. 1761 trivial. 0 not checked. [2022-07-11 23:52:47,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:47,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987439335] [2022-07-11 23:52:47,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987439335] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:52:47,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197315984] [2022-07-11 23:52:47,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:47,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:52:47,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:52:47,668 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:52:47,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-11 23:52:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:48,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 2355 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-11 23:52:48,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:52:48,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 707 proven. 0 refuted. 0 times theorem prover too weak. 1805 trivial. 0 not checked. [2022-07-11 23:52:48,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:52:48,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197315984] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:48,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:52:48,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-11 23:52:48,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463843607] [2022-07-11 23:52:48,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:48,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:52:48,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:48,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:52:48,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:52:48,725 INFO L87 Difference]: Start difference. First operand 6255 states and 9349 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:48,869 INFO L93 Difference]: Finished difference Result 12968 states and 19406 transitions. [2022-07-11 23:52:48,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:52:48,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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 513 [2022-07-11 23:52:48,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:48,879 INFO L225 Difference]: With dead ends: 12968 [2022-07-11 23:52:48,879 INFO L226 Difference]: Without dead ends: 6736 [2022-07-11 23:52:48,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:52:48,886 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 161 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:48,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 377 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:52:48,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6736 states. [2022-07-11 23:52:48,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6736 to 6736. [2022-07-11 23:52:48,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6736 states, 6735 states have (on average 1.4962138084632517) internal successors, (10077), 6735 states have internal predecessors, (10077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:49,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6736 states to 6736 states and 10077 transitions. [2022-07-11 23:52:49,003 INFO L78 Accepts]: Start accepts. Automaton has 6736 states and 10077 transitions. Word has length 513 [2022-07-11 23:52:49,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:49,004 INFO L495 AbstractCegarLoop]: Abstraction has 6736 states and 10077 transitions. [2022-07-11 23:52:49,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:49,004 INFO L276 IsEmpty]: Start isEmpty. Operand 6736 states and 10077 transitions. [2022-07-11 23:52:49,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2022-07-11 23:52:49,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:49,049 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:49,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-11 23:52:49,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-07-11 23:52:49,251 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:49,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:49,251 INFO L85 PathProgramCache]: Analyzing trace with hash -138901474, now seen corresponding path program 1 times [2022-07-11 23:52:49,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:49,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849191896] [2022-07-11 23:52:49,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:49,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1473 proven. 0 refuted. 0 times theorem prover too weak. 1055 trivial. 0 not checked. [2022-07-11 23:52:49,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:49,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849191896] [2022-07-11 23:52:49,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849191896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:49,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:49,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:52:49,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679183774] [2022-07-11 23:52:49,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:49,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:52:49,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:49,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:52:49,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:52:49,422 INFO L87 Difference]: Start difference. First operand 6736 states and 10077 transitions. Second operand has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:51,427 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 [] [2022-07-11 23:52:51,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:51,739 INFO L93 Difference]: Finished difference Result 14638 states and 21839 transitions. [2022-07-11 23:52:51,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:52:51,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 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 521 [2022-07-11 23:52:51,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:51,748 INFO L225 Difference]: With dead ends: 14638 [2022-07-11 23:52:51,748 INFO L226 Difference]: Without dead ends: 7925 [2022-07-11 23:52:51,754 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:51,754 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 75 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:51,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 725 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 245 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-11 23:52:51,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7925 states. [2022-07-11 23:52:51,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7925 to 7310. [2022-07-11 23:52:51,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7310 states, 7309 states have (on average 1.49746887399097) internal successors, (10945), 7309 states have internal predecessors, (10945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7310 states to 7310 states and 10945 transitions. [2022-07-11 23:52:51,867 INFO L78 Accepts]: Start accepts. Automaton has 7310 states and 10945 transitions. Word has length 521 [2022-07-11 23:52:51,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:51,868 INFO L495 AbstractCegarLoop]: Abstraction has 7310 states and 10945 transitions. [2022-07-11 23:52:51,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 7310 states and 10945 transitions. [2022-07-11 23:52:51,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2022-07-11 23:52:51,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:51,877 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:51,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-07-11 23:52:51,877 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:51,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:51,878 INFO L85 PathProgramCache]: Analyzing trace with hash -930711262, now seen corresponding path program 1 times [2022-07-11 23:52:51,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:51,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299675053] [2022-07-11 23:52:51,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:51,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 2135 trivial. 0 not checked. [2022-07-11 23:52:52,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:52,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299675053] [2022-07-11 23:52:52,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299675053] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:52,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:52,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:52:52,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325756987] [2022-07-11 23:52:52,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:52,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:52:52,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:52,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:52:52,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:52:52,105 INFO L87 Difference]: Start difference. First operand 7310 states and 10945 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:52,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:52,227 INFO L93 Difference]: Finished difference Result 15113 states and 22651 transitions. [2022-07-11 23:52:52,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:52:52,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 521 [2022-07-11 23:52:52,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:52,240 INFO L225 Difference]: With dead ends: 15113 [2022-07-11 23:52:52,240 INFO L226 Difference]: Without dead ends: 7826 [2022-07-11 23:52:52,245 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:52,246 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 150 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:52,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 593 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:52:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7826 states. [2022-07-11 23:52:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7826 to 7826. [2022-07-11 23:52:52,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7826 states, 7825 states have (on average 1.4968690095846646) internal successors, (11713), 7825 states have internal predecessors, (11713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7826 states to 7826 states and 11713 transitions. [2022-07-11 23:52:52,370 INFO L78 Accepts]: Start accepts. Automaton has 7826 states and 11713 transitions. Word has length 521 [2022-07-11 23:52:52,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:52,370 INFO L495 AbstractCegarLoop]: Abstraction has 7826 states and 11713 transitions. [2022-07-11 23:52:52,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 7826 states and 11713 transitions. [2022-07-11 23:52:52,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2022-07-11 23:52:52,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:52,380 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 8, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:52,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-07-11 23:52:52,380 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:52,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:52,381 INFO L85 PathProgramCache]: Analyzing trace with hash -296644096, now seen corresponding path program 1 times [2022-07-11 23:52:52,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:52,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529901554] [2022-07-11 23:52:52,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:52,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:52,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3410 backedges. 849 proven. 0 refuted. 0 times theorem prover too weak. 2561 trivial. 0 not checked. [2022-07-11 23:52:52,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:52,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529901554] [2022-07-11 23:52:52,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529901554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:52,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:52,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:52:52,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167166174] [2022-07-11 23:52:52,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:52,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:52:52,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:52,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:52:52,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:52:52,651 INFO L87 Difference]: Start difference. First operand 7826 states and 11713 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:52,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:52,779 INFO L93 Difference]: Finished difference Result 16151 states and 24196 transitions. [2022-07-11 23:52:52,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:52:52,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 598 [2022-07-11 23:52:52,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:52,789 INFO L225 Difference]: With dead ends: 16151 [2022-07-11 23:52:52,789 INFO L226 Difference]: Without dead ends: 8348 [2022-07-11 23:52:52,796 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:52,796 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 160 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:52,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 375 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:52:52,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8348 states. [2022-07-11 23:52:52,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8348 to 8348. [2022-07-11 23:52:52,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8348 states, 8347 states have (on average 1.498143045405535) internal successors, (12505), 8347 states have internal predecessors, (12505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8348 states to 8348 states and 12505 transitions. [2022-07-11 23:52:52,913 INFO L78 Accepts]: Start accepts. Automaton has 8348 states and 12505 transitions. Word has length 598 [2022-07-11 23:52:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:52,914 INFO L495 AbstractCegarLoop]: Abstraction has 8348 states and 12505 transitions. [2022-07-11 23:52:52,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:52,914 INFO L276 IsEmpty]: Start isEmpty. Operand 8348 states and 12505 transitions. [2022-07-11 23:52:52,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2022-07-11 23:52:52,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:52,926 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 9, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:52,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-07-11 23:52:52,926 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:52,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:52,926 INFO L85 PathProgramCache]: Analyzing trace with hash -764735426, now seen corresponding path program 1 times [2022-07-11 23:52:52,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:52,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299886094] [2022-07-11 23:52:52,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:52,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3915 backedges. 914 proven. 0 refuted. 0 times theorem prover too weak. 3001 trivial. 0 not checked. [2022-07-11 23:52:53,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:53,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299886094] [2022-07-11 23:52:53,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299886094] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:53,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:53,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:52:53,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746685832] [2022-07-11 23:52:53,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:53,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:52:53,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:53,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:52:53,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:52:53,229 INFO L87 Difference]: Start difference. First operand 8348 states and 12505 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:53,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:53,406 INFO L93 Difference]: Finished difference Result 17195 states and 25780 transitions. [2022-07-11 23:52:53,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:52:53,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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 641 [2022-07-11 23:52:53,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:53,427 INFO L225 Difference]: With dead ends: 17195 [2022-07-11 23:52:53,427 INFO L226 Difference]: Without dead ends: 8870 [2022-07-11 23:52:53,434 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:53,435 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 161 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:53,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 374 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:52:53,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8870 states. [2022-07-11 23:52:53,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8870 to 8870. [2022-07-11 23:52:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8870 states, 8869 states have (on average 1.4993798624422146) internal successors, (13298), 8869 states have internal predecessors, (13298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:53,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8870 states to 8870 states and 13298 transitions. [2022-07-11 23:52:53,615 INFO L78 Accepts]: Start accepts. Automaton has 8870 states and 13298 transitions. Word has length 641 [2022-07-11 23:52:53,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:53,616 INFO L495 AbstractCegarLoop]: Abstraction has 8870 states and 13298 transitions. [2022-07-11 23:52:53,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:53,616 INFO L276 IsEmpty]: Start isEmpty. Operand 8870 states and 13298 transitions. [2022-07-11 23:52:53,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2022-07-11 23:52:53,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:53,629 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:53,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-07-11 23:52:53,629 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:53,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:53,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1181033531, now seen corresponding path program 1 times [2022-07-11 23:52:53,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:53,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585820877] [2022-07-11 23:52:53,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:53,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:53,946 INFO L134 CoverageAnalysis]: Checked inductivity of 3946 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2022-07-11 23:52:53,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:53,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585820877] [2022-07-11 23:52:53,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585820877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:53,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:53,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:52:53,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123756419] [2022-07-11 23:52:53,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:53,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:52:53,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:53,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:52:53,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:52:53,949 INFO L87 Difference]: Start difference. First operand 8870 states and 13298 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:54,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:54,154 INFO L93 Difference]: Finished difference Result 18234 states and 27359 transitions. [2022-07-11 23:52:54,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:52:54,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 650 [2022-07-11 23:52:54,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:54,166 INFO L225 Difference]: With dead ends: 18234 [2022-07-11 23:52:54,167 INFO L226 Difference]: Without dead ends: 9387 [2022-07-11 23:52:54,176 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:54,176 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 150 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:54,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 593 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:52:54,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9387 states. [2022-07-11 23:52:54,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9387 to 9387. [2022-07-11 23:52:54,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9387 states, 9386 states have (on average 1.4987215001065417) internal successors, (14067), 9386 states have internal predecessors, (14067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:54,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9387 states to 9387 states and 14067 transitions. [2022-07-11 23:52:54,355 INFO L78 Accepts]: Start accepts. Automaton has 9387 states and 14067 transitions. Word has length 650 [2022-07-11 23:52:54,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:54,356 INFO L495 AbstractCegarLoop]: Abstraction has 9387 states and 14067 transitions. [2022-07-11 23:52:54,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:54,356 INFO L276 IsEmpty]: Start isEmpty. Operand 9387 states and 14067 transitions. [2022-07-11 23:52:54,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2022-07-11 23:52:54,407 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:54,407 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 18, 18, 17, 17, 16, 16, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 11, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:54,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-07-11 23:52:54,407 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:54,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:54,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1426739437, now seen corresponding path program 1 times [2022-07-11 23:52:54,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:54,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386237499] [2022-07-11 23:52:54,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:54,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:54,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5037 backedges. 1058 proven. 0 refuted. 0 times theorem prover too weak. 3979 trivial. 0 not checked. [2022-07-11 23:52:54,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:54,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386237499] [2022-07-11 23:52:54,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386237499] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:54,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:54,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:52:54,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567989748] [2022-07-11 23:52:54,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:54,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:52:54,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:54,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:52:54,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:52:54,709 INFO L87 Difference]: Start difference. First operand 9387 states and 14067 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:54,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:54,900 INFO L93 Difference]: Finished difference Result 19273 states and 28904 transitions. [2022-07-11 23:52:54,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:52:54,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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 728 [2022-07-11 23:52:54,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:54,911 INFO L225 Difference]: With dead ends: 19273 [2022-07-11 23:52:54,911 INFO L226 Difference]: Without dead ends: 9909 [2022-07-11 23:52:54,917 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:54,917 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 160 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:54,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 372 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:52:54,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9909 states. [2022-07-11 23:52:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9909 to 9909. [2022-07-11 23:52:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9909 states, 9908 states have (on average 1.5) internal successors, (14862), 9908 states have internal predecessors, (14862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9909 states to 9909 states and 14862 transitions. [2022-07-11 23:52:55,054 INFO L78 Accepts]: Start accepts. Automaton has 9909 states and 14862 transitions. Word has length 728 [2022-07-11 23:52:55,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:55,054 INFO L495 AbstractCegarLoop]: Abstraction has 9909 states and 14862 transitions. [2022-07-11 23:52:55,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 9909 states and 14862 transitions. [2022-07-11 23:52:55,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2022-07-11 23:52:55,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:55,066 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 12, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:55,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-07-11 23:52:55,067 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:55,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:55,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1609533332, now seen corresponding path program 1 times [2022-07-11 23:52:55,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:55,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13794729] [2022-07-11 23:52:55,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:55,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 5655 backedges. 1122 proven. 0 refuted. 0 times theorem prover too weak. 4533 trivial. 0 not checked. [2022-07-11 23:52:55,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:55,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13794729] [2022-07-11 23:52:55,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13794729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:52:55,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:52:55,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:52:55,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859047692] [2022-07-11 23:52:55,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:52:55,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:52:55,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:52:55,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:52:55,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:52:55,321 INFO L87 Difference]: Start difference. First operand 9909 states and 14862 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:55,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:52:55,465 INFO L93 Difference]: Finished difference Result 10433 states and 15660 transitions. [2022-07-11 23:52:55,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:52:55,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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 772 [2022-07-11 23:52:55,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:52:55,477 INFO L225 Difference]: With dead ends: 10433 [2022-07-11 23:52:55,477 INFO L226 Difference]: Without dead ends: 10431 [2022-07-11 23:52:55,480 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:52:55,480 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 161 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:52:55,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 371 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:52:55,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10431 states. [2022-07-11 23:52:55,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10431 to 10431. [2022-07-11 23:52:55,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10431 states, 10430 states have (on average 1.5012464046021092) internal successors, (15658), 10430 states have internal predecessors, (15658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10431 states to 10431 states and 15658 transitions. [2022-07-11 23:52:55,656 INFO L78 Accepts]: Start accepts. Automaton has 10431 states and 15658 transitions. Word has length 772 [2022-07-11 23:52:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:52:55,656 INFO L495 AbstractCegarLoop]: Abstraction has 10431 states and 15658 transitions. [2022-07-11 23:52:55,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:52:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 10431 states and 15658 transitions. [2022-07-11 23:52:55,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 783 [2022-07-11 23:52:55,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:52:55,668 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:52:55,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-07-11 23:52:55,668 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:52:55,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:52:55,668 INFO L85 PathProgramCache]: Analyzing trace with hash -903556745, now seen corresponding path program 1 times [2022-07-11 23:52:55,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:52:55,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564667485] [2022-07-11 23:52:55,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:55,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:52:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:56,404 INFO L134 CoverageAnalysis]: Checked inductivity of 5702 backedges. 3657 proven. 480 refuted. 0 times theorem prover too weak. 1565 trivial. 0 not checked. [2022-07-11 23:52:56,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:52:56,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564667485] [2022-07-11 23:52:56,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564667485] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:52:56,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769321072] [2022-07-11 23:52:56,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:52:56,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:52:56,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:52:56,408 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:52:56,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-11 23:52:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:52:57,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 3304 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-11 23:52:57,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:52:57,695 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:52:57,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-11 23:52:57,779 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-11 23:52:57,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 10 [2022-07-11 23:52:57,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-11 23:52:57,841 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:52:57,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-11 23:52:57,903 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-11 23:52:57,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-07-11 23:52:57,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-11 23:52:57,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-11 23:52:57,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-11 23:52:57,970 INFO L356 Elim1Store]: treesize reduction 60, result has 39.4 percent of original size [2022-07-11 23:52:57,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 55 [2022-07-11 23:52:58,020 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-11 23:52:58,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36 [2022-07-11 23:52:58,181 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-11 23:52:58,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 11 [2022-07-11 23:52:58,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5702 backedges. 2342 proven. 586 refuted. 0 times theorem prover too weak. 2774 trivial. 0 not checked. [2022-07-11 23:52:58,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:52:58,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2022-07-11 23:52:58,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2022-07-11 23:53:02,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 88 [2022-07-11 23:53:02,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5702 backedges. 2152 proven. 0 refuted. 0 times theorem prover too weak. 3550 trivial. 0 not checked. [2022-07-11 23:53:02,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769321072] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-11 23:53:02,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:53:02,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12, 13] total 25 [2022-07-11 23:53:02,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345702075] [2022-07-11 23:53:02,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:02,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 23:53:02,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:02,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 23:53:02,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=519, Unknown=1, NotChecked=0, Total=600 [2022-07-11 23:53:02,135 INFO L87 Difference]: Start difference. First operand 10431 states and 15658 transitions. Second operand has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:04,148 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:53:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:13,783 INFO L93 Difference]: Finished difference Result 30466 states and 45757 transitions. [2022-07-11 23:53:13,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:53:13,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 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 782 [2022-07-11 23:53:13,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:13,804 INFO L225 Difference]: With dead ends: 30466 [2022-07-11 23:53:13,804 INFO L226 Difference]: Without dead ends: 20058 [2022-07-11 23:53:13,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1583 GetRequests, 1556 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=109, Invalid=700, Unknown=3, NotChecked=0, Total=812 [2022-07-11 23:53:13,815 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 447 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 263 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:13,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1035 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 528 Invalid, 0 Unknown, 263 Unchecked, 3.3s Time] [2022-07-11 23:53:13,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20058 states. [2022-07-11 23:53:14,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20058 to 17355. [2022-07-11 23:53:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17355 states, 17354 states have (on average 1.5145211478621643) internal successors, (26283), 17354 states have internal predecessors, (26283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17355 states to 17355 states and 26283 transitions. [2022-07-11 23:53:14,094 INFO L78 Accepts]: Start accepts. Automaton has 17355 states and 26283 transitions. Word has length 782 [2022-07-11 23:53:14,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:14,095 INFO L495 AbstractCegarLoop]: Abstraction has 17355 states and 26283 transitions. [2022-07-11 23:53:14,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:14,095 INFO L276 IsEmpty]: Start isEmpty. Operand 17355 states and 26283 transitions. [2022-07-11 23:53:14,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 786 [2022-07-11 23:53:14,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:14,113 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 8, 8, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:14,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:53:14,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:53:14,314 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:14,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:14,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1153034768, now seen corresponding path program 1 times [2022-07-11 23:53:14,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:14,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944750781] [2022-07-11 23:53:14,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:14,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:14,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5717 backedges. 3231 proven. 0 refuted. 0 times theorem prover too weak. 2486 trivial. 0 not checked. [2022-07-11 23:53:14,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:14,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944750781] [2022-07-11 23:53:14,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944750781] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:14,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:14,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:14,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84936003] [2022-07-11 23:53:14,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:14,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:14,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:14,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:14,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:14,564 INFO L87 Difference]: Start difference. First operand 17355 states and 26283 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:16,514 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:53:17,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:17,080 INFO L93 Difference]: Finished difference Result 36123 states and 54530 transitions. [2022-07-11 23:53:17,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:17,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 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 785 [2022-07-11 23:53:17,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:17,101 INFO L225 Difference]: With dead ends: 36123 [2022-07-11 23:53:17,101 INFO L226 Difference]: Without dead ends: 18791 [2022-07-11 23:53:17,114 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:53:17,115 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 73 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:17,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 723 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-11 23:53:17,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18791 states. [2022-07-11 23:53:17,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18791 to 17375. [2022-07-11 23:53:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17375 states, 17374 states have (on average 1.513928859214919) internal successors, (26303), 17374 states have internal predecessors, (26303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:17,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17375 states to 17375 states and 26303 transitions. [2022-07-11 23:53:17,487 INFO L78 Accepts]: Start accepts. Automaton has 17375 states and 26303 transitions. Word has length 785 [2022-07-11 23:53:17,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:17,488 INFO L495 AbstractCegarLoop]: Abstraction has 17375 states and 26303 transitions. [2022-07-11 23:53:17,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:17,488 INFO L276 IsEmpty]: Start isEmpty. Operand 17375 states and 26303 transitions. [2022-07-11 23:53:17,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 849 [2022-07-11 23:53:17,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:17,508 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:17,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-07-11 23:53:17,509 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:17,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:17,509 INFO L85 PathProgramCache]: Analyzing trace with hash 855496686, now seen corresponding path program 1 times [2022-07-11 23:53:17,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:17,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222236777] [2022-07-11 23:53:17,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:17,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:17,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6836 backedges. 3731 proven. 187 refuted. 0 times theorem prover too weak. 2918 trivial. 0 not checked. [2022-07-11 23:53:17,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:17,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222236777] [2022-07-11 23:53:17,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222236777] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:53:17,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617526836] [2022-07-11 23:53:17,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:17,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:53:17,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:53:17,848 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:53:17,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-11 23:53:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:19,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 3547 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-11 23:53:19,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:53:19,219 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:53:19,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-11 23:53:19,246 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-11 23:53:19,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-07-11 23:53:19,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-11 23:53:19,275 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:53:19,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:53:19,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-11 23:53:19,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6836 backedges. 2143 proven. 304 refuted. 0 times theorem prover too weak. 4389 trivial. 0 not checked. [2022-07-11 23:53:19,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:53:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6836 backedges. 2148 proven. 0 refuted. 0 times theorem prover too weak. 4688 trivial. 0 not checked. [2022-07-11 23:53:19,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617526836] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-11 23:53:19,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:53:19,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 9 [2022-07-11 23:53:19,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295034573] [2022-07-11 23:53:19,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:19,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:19,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:19,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:19,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:53:19,343 INFO L87 Difference]: Start difference. First operand 17375 states and 26303 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:20,528 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:53:21,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:21,025 INFO L93 Difference]: Finished difference Result 37176 states and 56015 transitions. [2022-07-11 23:53:21,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:21,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 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 848 [2022-07-11 23:53:21,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:21,049 INFO L225 Difference]: With dead ends: 37176 [2022-07-11 23:53:21,049 INFO L226 Difference]: Without dead ends: 19824 [2022-07-11 23:53:21,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1703 GetRequests, 1695 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:53:21,064 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 144 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:21,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 473 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-11 23:53:21,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19824 states. [2022-07-11 23:53:21,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19824 to 17375. [2022-07-11 23:53:21,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17375 states, 17374 states have (on average 1.4947047312075514) internal successors, (25969), 17374 states have internal predecessors, (25969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:21,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17375 states to 17375 states and 25969 transitions. [2022-07-11 23:53:21,423 INFO L78 Accepts]: Start accepts. Automaton has 17375 states and 25969 transitions. Word has length 848 [2022-07-11 23:53:21,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:21,424 INFO L495 AbstractCegarLoop]: Abstraction has 17375 states and 25969 transitions. [2022-07-11 23:53:21,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:21,424 INFO L276 IsEmpty]: Start isEmpty. Operand 17375 states and 25969 transitions. [2022-07-11 23:53:21,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 849 [2022-07-11 23:53:21,443 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:21,444 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 22, 22, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:21,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-11 23:53:21,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:53:21,645 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:21,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:21,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1255240550, now seen corresponding path program 1 times [2022-07-11 23:53:21,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:21,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328464255] [2022-07-11 23:53:21,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:21,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6944 backedges. 3949 proven. 46 refuted. 0 times theorem prover too weak. 2949 trivial. 0 not checked. [2022-07-11 23:53:22,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:22,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328464255] [2022-07-11 23:53:22,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328464255] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:53:22,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720944046] [2022-07-11 23:53:22,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:22,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:53:22,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:53:22,036 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:53:22,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-11 23:53:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:23,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 3571 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-11 23:53:23,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:53:23,700 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:53:23,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-11 23:53:23,742 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-11 23:53:23,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-07-11 23:53:23,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-11 23:53:23,783 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:53:23,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-11 23:53:23,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-11 23:53:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6944 backedges. 3944 proven. 238 refuted. 0 times theorem prover too weak. 2762 trivial. 0 not checked. [2022-07-11 23:53:23,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:53:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6944 backedges. 3917 proven. 0 refuted. 0 times theorem prover too weak. 3027 trivial. 0 not checked. [2022-07-11 23:53:23,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720944046] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-11 23:53:23,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:53:23,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 8] total 10 [2022-07-11 23:53:23,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912261083] [2022-07-11 23:53:23,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:23,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:23,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:23,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:23,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:53:23,929 INFO L87 Difference]: Start difference. First operand 17375 states and 25969 transitions. Second operand has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:25,935 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 [] [2022-07-11 23:53:26,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:26,623 INFO L93 Difference]: Finished difference Result 37176 states and 55347 transitions. [2022-07-11 23:53:26,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:26,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 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 848 [2022-07-11 23:53:26,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:26,653 INFO L225 Difference]: With dead ends: 37176 [2022-07-11 23:53:26,653 INFO L226 Difference]: Without dead ends: 19824 [2022-07-11 23:53:26,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1703 GetRequests, 1694 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:53:26,671 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 125 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:26,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 583 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 248 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-11 23:53:26,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19824 states. [2022-07-11 23:53:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19824 to 17395. [2022-07-11 23:53:27,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17395 states, 17394 states have (on average 1.4941359089341153) internal successors, (25989), 17394 states have internal predecessors, (25989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:27,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17395 states to 17395 states and 25989 transitions. [2022-07-11 23:53:27,179 INFO L78 Accepts]: Start accepts. Automaton has 17395 states and 25989 transitions. Word has length 848 [2022-07-11 23:53:27,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:27,180 INFO L495 AbstractCegarLoop]: Abstraction has 17395 states and 25989 transitions. [2022-07-11 23:53:27,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.5) internal successors, (230), 4 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:27,180 INFO L276 IsEmpty]: Start isEmpty. Operand 17395 states and 25989 transitions. [2022-07-11 23:53:27,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2022-07-11 23:53:27,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:27,202 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 22, 19, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:27,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-11 23:53:27,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-07-11 23:53:27,403 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:27,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:27,405 INFO L85 PathProgramCache]: Analyzing trace with hash -653887438, now seen corresponding path program 1 times [2022-07-11 23:53:27,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:27,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147762178] [2022-07-11 23:53:27,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:27,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6896 backedges. 3778 proven. 0 refuted. 0 times theorem prover too weak. 3118 trivial. 0 not checked. [2022-07-11 23:53:27,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:27,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147762178] [2022-07-11 23:53:27,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147762178] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:27,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:27,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:27,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188473986] [2022-07-11 23:53:27,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:27,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:27,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:27,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:27,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:27,746 INFO L87 Difference]: Start difference. First operand 17395 states and 25989 transitions. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:29,760 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 [] [2022-07-11 23:53:30,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:30,222 INFO L93 Difference]: Finished difference Result 36035 states and 53691 transitions. [2022-07-11 23:53:30,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:30,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 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 851 [2022-07-11 23:53:30,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:30,243 INFO L225 Difference]: With dead ends: 36035 [2022-07-11 23:53:30,243 INFO L226 Difference]: Without dead ends: 18663 [2022-07-11 23:53:30,256 INFO L412 NwaCegarLoop]: 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 [2022-07-11 23:53:30,259 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 86 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:30,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 713 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 234 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-11 23:53:30,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18663 states. [2022-07-11 23:53:30,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18663 to 17395. [2022-07-11 23:53:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17395 states, 17394 states have (on average 1.4920087386455099) internal successors, (25952), 17394 states have internal predecessors, (25952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17395 states to 17395 states and 25952 transitions. [2022-07-11 23:53:30,566 INFO L78 Accepts]: Start accepts. Automaton has 17395 states and 25952 transitions. Word has length 851 [2022-07-11 23:53:30,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:30,567 INFO L495 AbstractCegarLoop]: Abstraction has 17395 states and 25952 transitions. [2022-07-11 23:53:30,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 17395 states and 25952 transitions. [2022-07-11 23:53:30,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 852 [2022-07-11 23:53:30,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:30,586 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 22, 22, 18, 18, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 8, 8, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:30,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-07-11 23:53:30,587 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:30,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:30,587 INFO L85 PathProgramCache]: Analyzing trace with hash -570468491, now seen corresponding path program 1 times [2022-07-11 23:53:30,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:30,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677213540] [2022-07-11 23:53:30,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:30,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6959 backedges. 3806 proven. 0 refuted. 0 times theorem prover too weak. 3153 trivial. 0 not checked. [2022-07-11 23:53:30,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:30,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677213540] [2022-07-11 23:53:30,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677213540] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:30,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:30,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:30,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66020849] [2022-07-11 23:53:30,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:30,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:30,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:30,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:30,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:30,875 INFO L87 Difference]: Start difference. First operand 17395 states and 25952 transitions. Second operand has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:31,774 INFO L93 Difference]: Finished difference Result 36247 states and 53990 transitions. [2022-07-11 23:53:31,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:31,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 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 851 [2022-07-11 23:53:31,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:31,794 INFO L225 Difference]: With dead ends: 36247 [2022-07-11 23:53:31,794 INFO L226 Difference]: Without dead ends: 18875 [2022-07-11 23:53:31,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:53:31,804 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 29 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:31,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 647 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:53:31,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18875 states. [2022-07-11 23:53:32,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18875 to 18357. [2022-07-11 23:53:32,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18357 states, 18356 states have (on average 1.4883961647417738) internal successors, (27321), 18356 states have internal predecessors, (27321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:32,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18357 states to 18357 states and 27321 transitions. [2022-07-11 23:53:32,118 INFO L78 Accepts]: Start accepts. Automaton has 18357 states and 27321 transitions. Word has length 851 [2022-07-11 23:53:32,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:32,118 INFO L495 AbstractCegarLoop]: Abstraction has 18357 states and 27321 transitions. [2022-07-11 23:53:32,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:32,119 INFO L276 IsEmpty]: Start isEmpty. Operand 18357 states and 27321 transitions. [2022-07-11 23:53:32,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 861 [2022-07-11 23:53:32,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:32,139 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 20, 20, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 8, 8, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:32,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-07-11 23:53:32,139 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:32,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:32,139 INFO L85 PathProgramCache]: Analyzing trace with hash 407021035, now seen corresponding path program 1 times [2022-07-11 23:53:32,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:32,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303536130] [2022-07-11 23:53:32,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:32,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:32,425 INFO L134 CoverageAnalysis]: Checked inductivity of 7175 backedges. 3954 proven. 0 refuted. 0 times theorem prover too weak. 3221 trivial. 0 not checked. [2022-07-11 23:53:32,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:32,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303536130] [2022-07-11 23:53:32,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303536130] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:32,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:32,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:32,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18270478] [2022-07-11 23:53:32,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:32,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:32,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:32,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:32,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:32,427 INFO L87 Difference]: Start difference. First operand 18357 states and 27321 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:33,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:33,462 INFO L93 Difference]: Finished difference Result 37171 states and 55294 transitions. [2022-07-11 23:53:33,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:33,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 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 860 [2022-07-11 23:53:33,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:33,483 INFO L225 Difference]: With dead ends: 37171 [2022-07-11 23:53:33,483 INFO L226 Difference]: Without dead ends: 18837 [2022-07-11 23:53:33,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:53:33,496 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 43 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:33,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 662 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:53:33,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18837 states. [2022-07-11 23:53:33,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18837 to 18357. [2022-07-11 23:53:33,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18357 states, 18356 states have (on average 1.4873066027456963) internal successors, (27301), 18356 states have internal predecessors, (27301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18357 states to 18357 states and 27301 transitions. [2022-07-11 23:53:33,909 INFO L78 Accepts]: Start accepts. Automaton has 18357 states and 27301 transitions. Word has length 860 [2022-07-11 23:53:33,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:33,910 INFO L495 AbstractCegarLoop]: Abstraction has 18357 states and 27301 transitions. [2022-07-11 23:53:33,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 4 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:33,910 INFO L276 IsEmpty]: Start isEmpty. Operand 18357 states and 27301 transitions. [2022-07-11 23:53:33,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2022-07-11 23:53:33,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:33,930 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 20, 20, 19, 19, 19, 19, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:53:33,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-07-11 23:53:33,930 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:33,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:33,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1326089202, now seen corresponding path program 1 times [2022-07-11 23:53:33,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:33,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836111739] [2022-07-11 23:53:33,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:33,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7358 backedges. 1932 proven. 5072 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2022-07-11 23:53:37,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:37,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836111739] [2022-07-11 23:53:37,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836111739] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:53:37,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042782607] [2022-07-11 23:53:37,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:37,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:53:37,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:53:37,095 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:53:37,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-11 23:53:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:38,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 3583 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-11 23:53:38,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:53:38,752 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:53:38,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-11 23:53:38,867 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-11 23:53:38,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 10 [2022-07-11 23:53:38,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-11 23:53:38,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-11 23:53:39,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:39,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2022-07-11 23:53:39,027 INFO L356 Elim1Store]: treesize reduction 72, result has 40.0 percent of original size [2022-07-11 23:53:39,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 60 [2022-07-11 23:53:39,052 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:53:39,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2022-07-11 23:53:39,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:39,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2022-07-11 23:53:39,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:39,480 INFO L356 Elim1Store]: treesize reduction 127, result has 14.2 percent of original size [2022-07-11 23:53:39,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 49 [2022-07-11 23:53:39,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:39,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-07-11 23:53:39,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:39,552 INFO L356 Elim1Store]: treesize reduction 77, result has 35.8 percent of original size [2022-07-11 23:53:39,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 68 [2022-07-11 23:53:39,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:39,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 67 [2022-07-11 23:53:39,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:39,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 67 [2022-07-11 23:53:40,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:40,065 INFO L356 Elim1Store]: treesize reduction 60, result has 45.9 percent of original size [2022-07-11 23:53:40,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 160 treesize of output 155 [2022-07-11 23:53:40,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:40,105 INFO L356 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2022-07-11 23:53:40,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 137 treesize of output 132 [2022-07-11 23:53:40,155 INFO L356 Elim1Store]: treesize reduction 45, result has 52.6 percent of original size [2022-07-11 23:53:40,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 73 [2022-07-11 23:53:41,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:41,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:41,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:41,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:41,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:41,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:41,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 367 treesize of output 295 [2022-07-11 23:53:41,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:41,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:41,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:41,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:41,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:41,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:41,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 367 treesize of output 295 [2022-07-11 23:53:41,106 INFO L356 Elim1Store]: treesize reduction 231, result has 26.4 percent of original size [2022-07-11 23:53:41,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 367 treesize of output 386 [2022-07-11 23:53:49,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:49,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:49,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:49,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 362 treesize of output 286 [2022-07-11 23:53:49,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:49,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:49,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:49,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 362 treesize of output 286 [2022-07-11 23:53:49,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:49,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:49,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:49,958 INFO L356 Elim1Store]: treesize reduction 105, result has 29.1 percent of original size [2022-07-11 23:53:49,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 371 treesize of output 368 [2022-07-11 23:53:50,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:50,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 97 [2022-07-11 23:53:50,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:50,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 61 [2022-07-11 23:53:50,320 INFO L356 Elim1Store]: treesize reduction 151, result has 29.4 percent of original size [2022-07-11 23:53:50,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 89 treesize of output 123 [2022-07-11 23:53:50,410 INFO L356 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-07-11 23:53:50,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 35 [2022-07-11 23:53:50,496 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-11 23:53:50,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 11 [2022-07-11 23:53:50,526 INFO L134 CoverageAnalysis]: Checked inductivity of 7358 backedges. 2322 proven. 666 refuted. 0 times theorem prover too weak. 4370 trivial. 0 not checked. [2022-07-11 23:53:50,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:53:54,405 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:53:54,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:53:54,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 714 treesize of output 552 [2022-07-11 23:53:54,415 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:53:54,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:53:54,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 924 treesize of output 768 [2022-07-11 23:53:58,779 INFO L134 CoverageAnalysis]: Checked inductivity of 7358 backedges. 2453 proven. 141 refuted. 0 times theorem prover too weak. 4764 trivial. 0 not checked. [2022-07-11 23:53:58,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042782607] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:53:58,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:53:58,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 20, 13] total 52 [2022-07-11 23:53:58,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241397275] [2022-07-11 23:53:58,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:53:58,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-11 23:53:58,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:58,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-11 23:53:58,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=2365, Unknown=2, NotChecked=0, Total=2652 [2022-07-11 23:53:58,784 INFO L87 Difference]: Start difference. First operand 18357 states and 27301 transitions. Second operand has 52 states, 52 states have (on average 19.53846153846154) internal successors, (1016), 52 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:54:00,796 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 [] [2022-07-11 23:54:02,822 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:54:05,926 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 [] [2022-07-11 23:54:07,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:54:09,666 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:55:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:28,470 INFO L93 Difference]: Finished difference Result 297571 states and 433321 transitions. [2022-07-11 23:55:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 483 states. [2022-07-11 23:55:28,471 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 19.53846153846154) internal successors, (1016), 52 states have internal predecessors, (1016), 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 869 [2022-07-11 23:55:28,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:28,910 INFO L225 Difference]: With dead ends: 297571 [2022-07-11 23:55:28,910 INFO L226 Difference]: Without dead ends: 279237 [2022-07-11 23:55:29,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2755 GetRequests, 2134 SyntacticMatches, 104 SemanticMatches, 517 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 143853 ImplicationChecksByTransitivity, 50.9s TimeCoverageRelationStatistics Valid=23041, Invalid=245799, Unknown=2, NotChecked=0, Total=268842 [2022-07-11 23:55:29,183 INFO L413 NwaCegarLoop]: 1410 mSDtfsCounter, 11906 mSDsluCounter, 27649 mSDsCounter, 0 mSdLazyCounter, 19948 mSolverCounterSat, 2059 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11906 SdHoareTripleChecker+Valid, 29059 SdHoareTripleChecker+Invalid, 26347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2059 IncrementalHoareTripleChecker+Valid, 19948 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 4337 IncrementalHoareTripleChecker+Unchecked, 34.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:29,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11906 Valid, 29059 Invalid, 26347 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2059 Valid, 19948 Invalid, 3 Unknown, 4337 Unchecked, 34.5s Time] [2022-07-11 23:55:29,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279237 states. [2022-07-11 23:55:36,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279237 to 174646. [2022-07-11 23:55:36,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174646 states, 174645 states have (on average 1.4717512668556214) internal successors, (257034), 174645 states have internal predecessors, (257034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174646 states to 174646 states and 257034 transitions. [2022-07-11 23:55:36,764 INFO L78 Accepts]: Start accepts. Automaton has 174646 states and 257034 transitions. Word has length 869 [2022-07-11 23:55:36,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:36,764 INFO L495 AbstractCegarLoop]: Abstraction has 174646 states and 257034 transitions. [2022-07-11 23:55:36,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 19.53846153846154) internal successors, (1016), 52 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:36,765 INFO L276 IsEmpty]: Start isEmpty. Operand 174646 states and 257034 transitions. [2022-07-11 23:55:37,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 871 [2022-07-11 23:55:37,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:37,244 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 20, 20, 19, 19, 19, 19, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:37,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-11 23:55:37,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-07-11 23:55:37,445 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:37,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:37,446 INFO L85 PathProgramCache]: Analyzing trace with hash 774626993, now seen corresponding path program 1 times [2022-07-11 23:55:37,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:55:37,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475480224] [2022-07-11 23:55:37,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:37,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:55:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:37,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7358 backedges. 1361 proven. 0 refuted. 0 times theorem prover too weak. 5997 trivial. 0 not checked. [2022-07-11 23:55:37,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:55:37,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475480224] [2022-07-11 23:55:37,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475480224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:55:37,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:55:37,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:55:37,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149961484] [2022-07-11 23:55:37,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:37,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:55:37,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:55:37,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:55:37,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:55:37,827 INFO L87 Difference]: Start difference. First operand 174646 states and 257034 transitions. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:39,012 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:55:44,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:55:44,459 INFO L93 Difference]: Finished difference Result 363651 states and 534289 transitions. [2022-07-11 23:55:44,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:55:44,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 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 870 [2022-07-11 23:55:44,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:55:44,854 INFO L225 Difference]: With dead ends: 363651 [2022-07-11 23:55:44,854 INFO L226 Difference]: Without dead ends: 189028 [2022-07-11 23:55:44,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:55:44,926 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 70 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:55:44,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 712 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-11 23:55:45,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189028 states. [2022-07-11 23:55:50,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189028 to 182911. [2022-07-11 23:55:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182911 states, 182910 states have (on average 1.471860477830627) internal successors, (269218), 182910 states have internal predecessors, (269218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:50,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182911 states to 182911 states and 269218 transitions. [2022-07-11 23:55:50,726 INFO L78 Accepts]: Start accepts. Automaton has 182911 states and 269218 transitions. Word has length 870 [2022-07-11 23:55:50,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:55:50,727 INFO L495 AbstractCegarLoop]: Abstraction has 182911 states and 269218 transitions. [2022-07-11 23:55:50,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:55:50,727 INFO L276 IsEmpty]: Start isEmpty. Operand 182911 states and 269218 transitions. [2022-07-11 23:55:51,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 873 [2022-07-11 23:55:51,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:55:51,160 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 22, 22, 22, 21, 21, 20, 20, 19, 19, 19, 19, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:55:51,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-07-11 23:55:51,161 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:55:51,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:55:51,161 INFO L85 PathProgramCache]: Analyzing trace with hash 252028231, now seen corresponding path program 1 times [2022-07-11 23:55:51,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:55:51,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271805969] [2022-07-11 23:55:51,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:51,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:55:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 7358 backedges. 2716 proven. 388 refuted. 0 times theorem prover too weak. 4254 trivial. 0 not checked. [2022-07-11 23:55:51,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:55:51,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271805969] [2022-07-11 23:55:51,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271805969] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:55:51,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220976269] [2022-07-11 23:55:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:55:51,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:55:51,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:55:51,792 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:55:51,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-11 23:55:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:55:53,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 3591 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-11 23:55:53,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:55:53,550 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-11 23:55:53,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-07-11 23:55:53,570 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:55:53,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-11 23:55:53,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:55:53,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:55:53,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-11 23:55:53,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-07-11 23:55:53,693 INFO L356 Elim1Store]: treesize reduction 60, result has 39.4 percent of original size [2022-07-11 23:55:53,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 55 [2022-07-11 23:55:55,798 INFO L356 Elim1Store]: treesize reduction 80, result has 35.0 percent of original size [2022-07-11 23:55:55,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 77 [2022-07-11 23:55:55,866 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-11 23:55:55,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-07-11 23:55:55,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-07-11 23:55:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7358 backedges. 3388 proven. 80 refuted. 0 times theorem prover too weak. 3890 trivial. 0 not checked. [2022-07-11 23:55:55,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:55:56,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-07-11 23:55:56,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-07-11 23:55:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 7358 backedges. 2922 proven. 0 refuted. 0 times theorem prover too weak. 4436 trivial. 0 not checked. [2022-07-11 23:55:58,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220976269] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-11 23:55:58,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:55:58,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14, 9] total 22 [2022-07-11 23:55:58,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087539704] [2022-07-11 23:55:58,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:55:58,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:55:58,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:55:58,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:55:58,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=405, Unknown=1, NotChecked=0, Total=462 [2022-07-11 23:55:58,623 INFO L87 Difference]: Start difference. First operand 182911 states and 269218 transitions. Second operand has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:56:04,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:56:04,053 INFO L93 Difference]: Finished difference Result 386426 states and 570155 transitions. [2022-07-11 23:56:04,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:56:04,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 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 872 [2022-07-11 23:56:04,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:56:04,344 INFO L225 Difference]: With dead ends: 386426 [2022-07-11 23:56:04,344 INFO L226 Difference]: Without dead ends: 203538