./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/openssl/s3_srvr.blast.09.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.09.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 8da39e66c08628aa90e95213e006a92eb0d5a63143d71cc4cdb2dcfa95ff1896 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:53:11,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:53:11,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:53:11,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:53:11,807 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:53:11,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:53:11,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:53:11,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:53:11,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:53:11,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:53:11,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:53:11,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:53:11,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:53:11,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:53:11,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:53:11,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:53:11,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:53:11,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:53:11,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:53:11,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:53:11,843 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:53:11,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:53:11,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:53:11,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:53:11,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:53:11,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:53:11,851 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:53:11,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:53:11,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:53:11,853 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:53:11,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:53:11,854 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:53:11,855 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:53:11,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:53:11,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:53:11,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:53:11,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:53:11,858 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:53:11,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:53:11,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:53:11,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:53:11,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:53:11,863 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:53:11,896 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:53:11,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:53:11,899 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:53:11,899 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:53:11,901 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:53:11,901 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:53:11,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:53:11,902 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:53:11,902 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:53:11,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:53:11,903 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:53:11,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:53:11,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:53:11,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:53:11,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:53:11,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:53:11,904 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:53:11,904 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:53:11,905 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:53:11,905 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:53:11,905 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:53:11,905 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:53:11,906 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:53:11,906 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:53:11,906 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:53:11,906 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:53:11,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:53:11,907 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:53:11,907 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:53:11,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:53:11,908 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:53:11,908 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:53:11,908 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:53:11,908 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 -> 8da39e66c08628aa90e95213e006a92eb0d5a63143d71cc4cdb2dcfa95ff1896 [2022-07-11 23:53:12,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:53:12,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:53:12,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:53:12,140 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:53:12,141 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:53:12,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-2.c [2022-07-11 23:53:12,198 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/131e44488/7557ca24d3d543c78c370a9768e63639/FLAGb598ebb67 [2022-07-11 23:53:12,692 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:53:12,693 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/openssl/s3_srvr.blast.09.i.cil-2.c [2022-07-11 23:53:12,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/131e44488/7557ca24d3d543c78c370a9768e63639/FLAGb598ebb67 [2022-07-11 23:53:13,003 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/131e44488/7557ca24d3d543c78c370a9768e63639 [2022-07-11 23:53:13,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:53:13,006 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:53:13,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:53:13,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:53:13,009 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:53:13,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:53:13" (1/1) ... [2022-07-11 23:53:13,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd31aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:13, skipping insertion in model container [2022-07-11 23:53:13,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:53:13" (1/1) ... [2022-07-11 23:53:13,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:53:13,053 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:53:13,383 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.09.i.cil-2.c[74369,74382] [2022-07-11 23:53:13,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:53:13,405 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:53:13,495 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.09.i.cil-2.c[74369,74382] [2022-07-11 23:53:13,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:53:13,510 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:53:13,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:13 WrapperNode [2022-07-11 23:53:13,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:53:13,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:53:13,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:53:13,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:53:13,519 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:53:13" (1/1) ... [2022-07-11 23:53:13,544 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:53:13" (1/1) ... [2022-07-11 23:53:13,600 INFO L137 Inliner]: procedures = 31, calls = 223, calls flagged for inlining = 7, calls inlined = 3, statements flattened = 792 [2022-07-11 23:53:13,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:53:13,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:53:13,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:53:13,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:53:13,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:13" (1/1) ... [2022-07-11 23:53:13,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:13" (1/1) ... [2022-07-11 23:53:13,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:13" (1/1) ... [2022-07-11 23:53:13,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:13" (1/1) ... [2022-07-11 23:53:13,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:13" (1/1) ... [2022-07-11 23:53:13,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:13" (1/1) ... [2022-07-11 23:53:13,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:13" (1/1) ... [2022-07-11 23:53:13,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:53:13,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:53:13,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:53:13,686 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:53:13,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:13" (1/1) ... [2022-07-11 23:53:13,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:53:13,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:53:13,737 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:53:13,772 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:53:13,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:53:13,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-11 23:53:13,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:53:13,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:53:13,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-11 23:53:13,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:53:13,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:53:13,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:53:13,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:53:13,905 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:53:13,907 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:53:13,920 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:53:15,039 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-07-11 23:53:15,040 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-07-11 23:53:15,040 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:53:15,046 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:53:15,048 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:53:15,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:53:15 BoogieIcfgContainer [2022-07-11 23:53:15,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:53:15,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:53:15,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:53:15,056 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:53:15,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:53:13" (1/3) ... [2022-07-11 23:53:15,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2a2cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:53:15, skipping insertion in model container [2022-07-11 23:53:15,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:53:13" (2/3) ... [2022-07-11 23:53:15,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c2a2cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:53:15, skipping insertion in model container [2022-07-11 23:53:15,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:53:15" (3/3) ... [2022-07-11 23:53:15,059 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-2.c [2022-07-11 23:53:15,073 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:53:15,073 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:53:15,137 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:53:15,154 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@4450b064, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@50152c85 [2022-07-11 23:53:15,155 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:53:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 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:15,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-11 23:53:15,171 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:15,172 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] [2022-07-11 23:53:15,172 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:15,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:15,178 INFO L85 PathProgramCache]: Analyzing trace with hash -442385418, now seen corresponding path program 1 times [2022-07-11 23:53:15,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:15,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441521564] [2022-07-11 23:53:15,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:15,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:15,742 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:53:15,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:15,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441521564] [2022-07-11 23:53:15,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441521564] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:15,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:15,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:15,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181357379] [2022-07-11 23:53:15,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:15,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:15,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:15,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:15,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:15,782 INFO L87 Difference]: Start difference. First operand has 150 states, 148 states have (on average 1.7162162162162162) internal successors, (254), 149 states have internal predecessors, (254), 0 states have call successors, (0), 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 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:16,708 INFO L93 Difference]: Finished difference Result 421 states and 717 transitions. [2022-07-11 23:53:16,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:16,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-07-11 23:53:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:16,720 INFO L225 Difference]: With dead ends: 421 [2022-07-11 23:53:16,721 INFO L226 Difference]: Without dead ends: 256 [2022-07-11 23:53:16,723 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:16,726 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 169 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:16,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 439 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-11 23:53:16,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-07-11 23:53:16,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 165. [2022-07-11 23:53:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.5853658536585367) internal successors, (260), 164 states have internal predecessors, (260), 0 states have call successors, (0), 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,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 260 transitions. [2022-07-11 23:53:16,799 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 260 transitions. Word has length 37 [2022-07-11 23:53:16,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:16,799 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 260 transitions. [2022-07-11 23:53:16,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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,800 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 260 transitions. [2022-07-11 23:53:16,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-11 23:53:16,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:16,804 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] [2022-07-11 23:53:16,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:53:16,805 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:16,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:16,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1559591930, now seen corresponding path program 1 times [2022-07-11 23:53:16,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:16,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665459137] [2022-07-11 23:53:16,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:16,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:16,969 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:53:16,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:16,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665459137] [2022-07-11 23:53:16,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665459137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:16,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:16,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:16,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767579325] [2022-07-11 23:53:16,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:16,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:16,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:16,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:16,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:16,975 INFO L87 Difference]: Start difference. First operand 165 states and 260 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:17,593 INFO L93 Difference]: Finished difference Result 348 states and 547 transitions. [2022-07-11 23:53:17,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:17,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-07-11 23:53:17,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:17,596 INFO L225 Difference]: With dead ends: 348 [2022-07-11 23:53:17,596 INFO L226 Difference]: Without dead ends: 193 [2022-07-11 23:53:17,597 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,598 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 22 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 469 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:53:17,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 469 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:53:17,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-11 23:53:17,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 176. [2022-07-11 23:53:17,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 175 states have (on average 1.5942857142857143) internal successors, (279), 175 states have internal predecessors, (279), 0 states have call successors, (0), 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,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 279 transitions. [2022-07-11 23:53:17,627 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 279 transitions. Word has length 38 [2022-07-11 23:53:17,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:17,628 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 279 transitions. [2022-07-11 23:53:17,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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,629 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 279 transitions. [2022-07-11 23:53:17,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-11 23:53:17,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:17,636 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] [2022-07-11 23:53:17,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:53:17,639 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:17,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:17,642 INFO L85 PathProgramCache]: Analyzing trace with hash 103815440, now seen corresponding path program 1 times [2022-07-11 23:53:17,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:17,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781426206] [2022-07-11 23:53:17,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:17,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:17,788 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:53:17,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:17,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781426206] [2022-07-11 23:53:17,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781426206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:17,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:17,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:17,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513884725] [2022-07-11 23:53:17,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:17,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:17,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:17,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:17,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:17,792 INFO L87 Difference]: Start difference. First operand 176 states and 279 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:18,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:18,858 INFO L93 Difference]: Finished difference Result 478 states and 761 transitions. [2022-07-11 23:53:18,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:18,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-11 23:53:18,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:18,861 INFO L225 Difference]: With dead ends: 478 [2022-07-11 23:53:18,861 INFO L226 Difference]: Without dead ends: 323 [2022-07-11 23:53:18,862 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:18,863 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 147 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:18,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 620 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-11 23:53:18,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-07-11 23:53:18,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 208. [2022-07-11 23:53:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.5942028985507246) internal successors, (330), 207 states have internal predecessors, (330), 0 states have call successors, (0), 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:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 330 transitions. [2022-07-11 23:53:18,878 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 330 transitions. Word has length 51 [2022-07-11 23:53:18,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:18,878 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 330 transitions. [2022-07-11 23:53:18,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:18,879 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 330 transitions. [2022-07-11 23:53:18,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-11 23:53:18,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:18,880 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] [2022-07-11 23:53:18,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:53:18,880 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:18,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:18,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1022264289, now seen corresponding path program 1 times [2022-07-11 23:53:18,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:18,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210740528] [2022-07-11 23:53:18,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:18,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:18,980 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:53:18,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:18,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210740528] [2022-07-11 23:53:18,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210740528] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:18,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:18,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:18,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993839244] [2022-07-11 23:53:18,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:18,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:18,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:18,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:18,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:18,983 INFO L87 Difference]: Start difference. First operand 208 states and 330 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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:19,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:19,974 INFO L93 Difference]: Finished difference Result 497 states and 786 transitions. [2022-07-11 23:53:19,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:19,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-07-11 23:53:19,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:19,976 INFO L225 Difference]: With dead ends: 497 [2022-07-11 23:53:19,976 INFO L226 Difference]: Without dead ends: 310 [2022-07-11 23:53:19,977 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:19,978 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 152 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 332 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.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:19,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-11 23:53:19,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-11 23:53:19,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 208. [2022-07-11 23:53:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.5748792270531402) internal successors, (326), 207 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:53:19,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 326 transitions. [2022-07-11 23:53:19,989 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 326 transitions. Word has length 52 [2022-07-11 23:53:19,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:19,989 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 326 transitions. [2022-07-11 23:53:19,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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:19,990 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 326 transitions. [2022-07-11 23:53:19,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-11 23:53:19,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:19,991 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] [2022-07-11 23:53:19,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:53:19,991 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:19,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:19,992 INFO L85 PathProgramCache]: Analyzing trace with hash 40885771, now seen corresponding path program 1 times [2022-07-11 23:53:19,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:19,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056193602] [2022-07-11 23:53:19,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:19,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:20,092 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:53:20,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:20,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056193602] [2022-07-11 23:53:20,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056193602] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:20,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:20,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:20,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649652344] [2022-07-11 23:53:20,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:20,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:20,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:20,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:20,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:20,095 INFO L87 Difference]: Start difference. First operand 208 states and 326 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:20,880 INFO L93 Difference]: Finished difference Result 411 states and 641 transitions. [2022-07-11 23:53:20,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:20,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-07-11 23:53:20,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:20,889 INFO L225 Difference]: With dead ends: 411 [2022-07-11 23:53:20,889 INFO L226 Difference]: Without dead ends: 224 [2022-07-11 23:53:20,890 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:20,895 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 26 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 473 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.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:20,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 473 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:53:20,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-11 23:53:20,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 208. [2022-07-11 23:53:20,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.570048309178744) internal successors, (325), 207 states have internal predecessors, (325), 0 states have call successors, (0), 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,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 325 transitions. [2022-07-11 23:53:20,916 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 325 transitions. Word has length 52 [2022-07-11 23:53:20,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:20,917 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 325 transitions. [2022-07-11 23:53:20,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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,917 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 325 transitions. [2022-07-11 23:53:20,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-11 23:53:20,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:20,922 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] [2022-07-11 23:53:20,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:53:20,923 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:20,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:20,923 INFO L85 PathProgramCache]: Analyzing trace with hash 861050644, now seen corresponding path program 1 times [2022-07-11 23:53:20,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:20,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922093977] [2022-07-11 23:53:20,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:20,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:21,023 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:53:21,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:21,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922093977] [2022-07-11 23:53:21,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922093977] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:21,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:21,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:21,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803336855] [2022-07-11 23:53:21,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:21,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:21,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:21,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:21,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:21,026 INFO L87 Difference]: Start difference. First operand 208 states and 325 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:21,612 INFO L93 Difference]: Finished difference Result 410 states and 639 transitions. [2022-07-11 23:53:21,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:21,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-07-11 23:53:21,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:21,614 INFO L225 Difference]: With dead ends: 410 [2022-07-11 23:53:21,614 INFO L226 Difference]: Without dead ends: 223 [2022-07-11 23:53:21,614 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:21,615 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 19 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 475 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.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:21,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 475 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:53:21,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-11 23:53:21,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 208. [2022-07-11 23:53:21,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.565217391304348) internal successors, (324), 207 states have internal predecessors, (324), 0 states have call successors, (0), 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,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 324 transitions. [2022-07-11 23:53:21,621 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 324 transitions. Word has length 52 [2022-07-11 23:53:21,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:21,621 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 324 transitions. [2022-07-11 23:53:21,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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,621 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 324 transitions. [2022-07-11 23:53:21,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-11 23:53:21,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:21,622 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] [2022-07-11 23:53:21,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:53:21,622 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:21,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:21,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1296410196, now seen corresponding path program 1 times [2022-07-11 23:53:21,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:21,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158132395] [2022-07-11 23:53:21,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:21,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:21,745 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:53:21,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:21,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158132395] [2022-07-11 23:53:21,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158132395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:21,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:21,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:21,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302761907] [2022-07-11 23:53:21,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:21,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:21,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:21,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:21,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:21,747 INFO L87 Difference]: Start difference. First operand 208 states and 324 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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:22,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:22,615 INFO L93 Difference]: Finished difference Result 497 states and 777 transitions. [2022-07-11 23:53:22,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:22,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2022-07-11 23:53:22,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:22,617 INFO L225 Difference]: With dead ends: 497 [2022-07-11 23:53:22,617 INFO L226 Difference]: Without dead ends: 310 [2022-07-11 23:53:22,617 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:22,618 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 145 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 332 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.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:22,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:53:22,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-11 23:53:22,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 209. [2022-07-11 23:53:22,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5528846153846154) internal successors, (323), 208 states have internal predecessors, (323), 0 states have call successors, (0), 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:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 323 transitions. [2022-07-11 23:53:22,625 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 323 transitions. Word has length 52 [2022-07-11 23:53:22,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:22,625 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 323 transitions. [2022-07-11 23:53:22,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 323 transitions. [2022-07-11 23:53:22,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-11 23:53:22,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:22,626 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] [2022-07-11 23:53:22,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:53:22,626 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:22,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:22,627 INFO L85 PathProgramCache]: Analyzing trace with hash 585554567, now seen corresponding path program 1 times [2022-07-11 23:53:22,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:22,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251799851] [2022-07-11 23:53:22,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:22,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:22,713 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:53:22,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:22,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251799851] [2022-07-11 23:53:22,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251799851] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:22,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:22,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:22,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469415622] [2022-07-11 23:53:22,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:22,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:22,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:22,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:22,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:22,716 INFO L87 Difference]: Start difference. First operand 209 states and 323 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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:23,843 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:53:24,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:24,050 INFO L93 Difference]: Finished difference Result 410 states and 635 transitions. [2022-07-11 23:53:24,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:24,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2022-07-11 23:53:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:24,052 INFO L225 Difference]: With dead ends: 410 [2022-07-11 23:53:24,052 INFO L226 Difference]: Without dead ends: 222 [2022-07-11 23:53:24,052 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:24,053 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 22 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:24,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 479 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-11 23:53:24,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-11 23:53:24,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 209. [2022-07-11 23:53:24,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5480769230769231) internal successors, (322), 208 states have internal predecessors, (322), 0 states have call successors, (0), 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:24,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 322 transitions. [2022-07-11 23:53:24,058 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 322 transitions. Word has length 53 [2022-07-11 23:53:24,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:24,058 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 322 transitions. [2022-07-11 23:53:24,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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:24,059 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 322 transitions. [2022-07-11 23:53:24,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-11 23:53:24,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:24,059 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] [2022-07-11 23:53:24,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:53:24,059 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:24,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:24,060 INFO L85 PathProgramCache]: Analyzing trace with hash -991616538, now seen corresponding path program 1 times [2022-07-11 23:53:24,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:24,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580839334] [2022-07-11 23:53:24,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:24,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:24,155 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:53:24,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:24,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580839334] [2022-07-11 23:53:24,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580839334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:24,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:24,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:24,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126498725] [2022-07-11 23:53:24,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:24,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:24,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:24,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:24,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:24,158 INFO L87 Difference]: Start difference. First operand 209 states and 322 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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:24,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:24,717 INFO L93 Difference]: Finished difference Result 498 states and 773 transitions. [2022-07-11 23:53:24,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:24,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2022-07-11 23:53:24,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:24,719 INFO L225 Difference]: With dead ends: 498 [2022-07-11 23:53:24,719 INFO L226 Difference]: Without dead ends: 310 [2022-07-11 23:53:24,720 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:24,720 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 147 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 332 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.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:24,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:53:24,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-11 23:53:24,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 209. [2022-07-11 23:53:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5288461538461537) internal successors, (318), 208 states have internal predecessors, (318), 0 states have call successors, (0), 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:24,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 318 transitions. [2022-07-11 23:53:24,727 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 318 transitions. Word has length 54 [2022-07-11 23:53:24,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:24,727 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 318 transitions. [2022-07-11 23:53:24,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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:24,728 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 318 transitions. [2022-07-11 23:53:24,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-11 23:53:24,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:24,728 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] [2022-07-11 23:53:24,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:53:24,729 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:24,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:24,729 INFO L85 PathProgramCache]: Analyzing trace with hash 373652162, now seen corresponding path program 1 times [2022-07-11 23:53:24,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:24,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309091492] [2022-07-11 23:53:24,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:24,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:24,828 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:53:24,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:24,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309091492] [2022-07-11 23:53:24,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309091492] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:24,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:24,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:24,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813442360] [2022-07-11 23:53:24,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:24,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:24,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:24,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:24,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:24,831 INFO L87 Difference]: Start difference. First operand 209 states and 318 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:25,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:25,272 INFO L93 Difference]: Finished difference Result 400 states and 614 transitions. [2022-07-11 23:53:25,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:25,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-07-11 23:53:25,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:25,274 INFO L225 Difference]: With dead ends: 400 [2022-07-11 23:53:25,274 INFO L226 Difference]: Without dead ends: 212 [2022-07-11 23:53:25,275 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:25,275 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 11 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 493 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.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:25,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 493 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:53:25,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-11 23:53:25,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 209. [2022-07-11 23:53:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.5240384615384615) internal successors, (317), 208 states have internal predecessors, (317), 0 states have call successors, (0), 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,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 317 transitions. [2022-07-11 23:53:25,280 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 317 transitions. Word has length 55 [2022-07-11 23:53:25,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:25,280 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 317 transitions. [2022-07-11 23:53:25,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 317 transitions. [2022-07-11 23:53:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-11 23:53:25,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:25,281 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] [2022-07-11 23:53:25,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-11 23:53:25,281 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:25,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:25,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1312076378, now seen corresponding path program 1 times [2022-07-11 23:53:25,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:25,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547550336] [2022-07-11 23:53:25,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:25,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:25,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:25,376 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:53:25,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:25,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547550336] [2022-07-11 23:53:25,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547550336] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:25,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:25,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:25,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934002873] [2022-07-11 23:53:25,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:25,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:25,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:25,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:25,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:25,379 INFO L87 Difference]: Start difference. First operand 209 states and 317 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:26,314 INFO L93 Difference]: Finished difference Result 437 states and 668 transitions. [2022-07-11 23:53:26,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:26,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-07-11 23:53:26,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:26,316 INFO L225 Difference]: With dead ends: 437 [2022-07-11 23:53:26,316 INFO L226 Difference]: Without dead ends: 249 [2022-07-11 23:53:26,316 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:26,317 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 30 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:26,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 497 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-11 23:53:26,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-07-11 23:53:26,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 231. [2022-07-11 23:53:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.5260869565217392) internal successors, (351), 230 states have internal predecessors, (351), 0 states have call successors, (0), 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:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 351 transitions. [2022-07-11 23:53:26,323 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 351 transitions. Word has length 55 [2022-07-11 23:53:26,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:26,326 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 351 transitions. [2022-07-11 23:53:26,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:26,327 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 351 transitions. [2022-07-11 23:53:26,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-11 23:53:26,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:26,329 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] [2022-07-11 23:53:26,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-11 23:53:26,329 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:26,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:26,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1411411051, now seen corresponding path program 1 times [2022-07-11 23:53:26,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:26,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354894680] [2022-07-11 23:53:26,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:26,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:26,443 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:53:26,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:26,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354894680] [2022-07-11 23:53:26,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354894680] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:26,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:26,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:26,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280013696] [2022-07-11 23:53:26,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:26,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:26,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:26,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:26,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:26,446 INFO L87 Difference]: Start difference. First operand 231 states and 351 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:27,322 INFO L93 Difference]: Finished difference Result 542 states and 833 transitions. [2022-07-11 23:53:27,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:27,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-07-11 23:53:27,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:27,324 INFO L225 Difference]: With dead ends: 542 [2022-07-11 23:53:27,324 INFO L226 Difference]: Without dead ends: 332 [2022-07-11 23:53:27,324 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:27,325 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 149 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 332 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.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:27,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 332 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-11 23:53:27,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-07-11 23:53:27,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 231. [2022-07-11 23:53:27,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.508695652173913) internal successors, (347), 230 states have internal predecessors, (347), 0 states have call successors, (0), 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,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 347 transitions. [2022-07-11 23:53:27,331 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 347 transitions. Word has length 69 [2022-07-11 23:53:27,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:27,332 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 347 transitions. [2022-07-11 23:53:27,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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,332 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 347 transitions. [2022-07-11 23:53:27,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-11 23:53:27,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:27,333 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] [2022-07-11 23:53:27,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-11 23:53:27,333 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:27,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:27,334 INFO L85 PathProgramCache]: Analyzing trace with hash -2063391372, now seen corresponding path program 1 times [2022-07-11 23:53:27,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:27,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253722316] [2022-07-11 23:53:27,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:27,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:27,440 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:53:27,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:27,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253722316] [2022-07-11 23:53:27,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253722316] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:27,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:27,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:27,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960503868] [2022-07-11 23:53:27,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:27,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:27,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:27,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:27,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:27,442 INFO L87 Difference]: Start difference. First operand 231 states and 347 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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:28,500 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:53:28,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:28,820 INFO L93 Difference]: Finished difference Result 541 states and 824 transitions. [2022-07-11 23:53:28,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:28,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2022-07-11 23:53:28,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:28,823 INFO L225 Difference]: With dead ends: 541 [2022-07-11 23:53:28,823 INFO L226 Difference]: Without dead ends: 331 [2022-07-11 23:53:28,823 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:28,824 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 142 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:28,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 334 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-11 23:53:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-11 23:53:28,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 232. [2022-07-11 23:53:28,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.4978354978354977) internal successors, (346), 231 states have internal predecessors, (346), 0 states have call successors, (0), 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:28,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 346 transitions. [2022-07-11 23:53:28,830 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 346 transitions. Word has length 69 [2022-07-11 23:53:28,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:28,830 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 346 transitions. [2022-07-11 23:53:28,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 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:28,830 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 346 transitions. [2022-07-11 23:53:28,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-11 23:53:28,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:28,831 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] [2022-07-11 23:53:28,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-11 23:53:28,832 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:28,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:28,832 INFO L85 PathProgramCache]: Analyzing trace with hash 122165287, now seen corresponding path program 1 times [2022-07-11 23:53:28,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:28,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440769520] [2022-07-11 23:53:28,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:28,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:28,951 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:53:28,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:28,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440769520] [2022-07-11 23:53:28,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440769520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:28,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:28,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:28,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821699750] [2022-07-11 23:53:28,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:28,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:28,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:28,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:28,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:28,954 INFO L87 Difference]: Start difference. First operand 232 states and 346 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:29,817 INFO L93 Difference]: Finished difference Result 542 states and 820 transitions. [2022-07-11 23:53:29,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:29,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-07-11 23:53:29,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:29,819 INFO L225 Difference]: With dead ends: 542 [2022-07-11 23:53:29,819 INFO L226 Difference]: Without dead ends: 331 [2022-07-11 23:53:29,819 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:29,820 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 146 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:29,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 334 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:53:29,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-11 23:53:29,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 232. [2022-07-11 23:53:29,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.4805194805194806) internal successors, (342), 231 states have internal predecessors, (342), 0 states have call successors, (0), 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,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 342 transitions. [2022-07-11 23:53:29,825 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 342 transitions. Word has length 70 [2022-07-11 23:53:29,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:29,825 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 342 transitions. [2022-07-11 23:53:29,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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,825 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 342 transitions. [2022-07-11 23:53:29,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-11 23:53:29,826 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:29,826 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] [2022-07-11 23:53:29,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-11 23:53:29,826 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:29,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:29,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1733152866, now seen corresponding path program 1 times [2022-07-11 23:53:29,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:29,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401348957] [2022-07-11 23:53:29,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:29,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:29,929 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:53:29,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:29,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401348957] [2022-07-11 23:53:29,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401348957] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:29,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:29,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:29,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433191970] [2022-07-11 23:53:29,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:29,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:29,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:29,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:29,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:29,932 INFO L87 Difference]: Start difference. First operand 232 states and 342 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:30,513 INFO L93 Difference]: Finished difference Result 450 states and 669 transitions. [2022-07-11 23:53:30,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:30,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-07-11 23:53:30,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:30,515 INFO L225 Difference]: With dead ends: 450 [2022-07-11 23:53:30,515 INFO L226 Difference]: Without dead ends: 239 [2022-07-11 23:53:30,515 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:30,516 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 26 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:30,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 513 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:53:30,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-11 23:53:30,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 232. [2022-07-11 23:53:30,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 1.4761904761904763) internal successors, (341), 231 states have internal predecessors, (341), 0 states have call successors, (0), 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,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 341 transitions. [2022-07-11 23:53:30,521 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 341 transitions. Word has length 72 [2022-07-11 23:53:30,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:30,522 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 341 transitions. [2022-07-11 23:53:30,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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,522 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 341 transitions. [2022-07-11 23:53:30,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-11 23:53:30,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:30,522 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] [2022-07-11 23:53:30,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-11 23:53:30,523 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:30,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:30,523 INFO L85 PathProgramCache]: Analyzing trace with hash 293504549, now seen corresponding path program 1 times [2022-07-11 23:53:30,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:30,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508825119] [2022-07-11 23:53:30,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:30,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:30,636 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:53:30,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:30,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508825119] [2022-07-11 23:53:30,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508825119] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:30,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:30,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:30,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064810350] [2022-07-11 23:53:30,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:30,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:30,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:30,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:30,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:30,639 INFO L87 Difference]: Start difference. First operand 232 states and 341 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:31,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:53:32,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:32,191 INFO L93 Difference]: Finished difference Result 538 states and 797 transitions. [2022-07-11 23:53:32,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:32,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-07-11 23:53:32,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:32,193 INFO L225 Difference]: With dead ends: 538 [2022-07-11 23:53:32,193 INFO L226 Difference]: Without dead ends: 327 [2022-07-11 23:53:32,193 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:32,194 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 88 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:32,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 471 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-11 23:53:32,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-07-11 23:53:32,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 263. [2022-07-11 23:53:32,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 262 states have (on average 1.4770992366412214) internal successors, (387), 262 states have internal predecessors, (387), 0 states have call successors, (0), 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,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 387 transitions. [2022-07-11 23:53:32,204 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 387 transitions. Word has length 77 [2022-07-11 23:53:32,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:32,205 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 387 transitions. [2022-07-11 23:53:32,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:32,205 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 387 transitions. [2022-07-11 23:53:32,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-11 23:53:32,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:32,206 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] [2022-07-11 23:53:32,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-11 23:53:32,206 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:32,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:32,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1950478749, now seen corresponding path program 1 times [2022-07-11 23:53:32,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:32,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200230717] [2022-07-11 23:53:32,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:32,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:32,326 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:53:32,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:32,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200230717] [2022-07-11 23:53:32,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200230717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:32,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:32,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:32,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977045249] [2022-07-11 23:53:32,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:32,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:32,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:32,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:32,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:32,329 INFO L87 Difference]: Start difference. First operand 263 states and 387 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:32,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:32,736 INFO L93 Difference]: Finished difference Result 551 states and 815 transitions. [2022-07-11 23:53:32,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:32,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-07-11 23:53:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:32,738 INFO L225 Difference]: With dead ends: 551 [2022-07-11 23:53:32,738 INFO L226 Difference]: Without dead ends: 309 [2022-07-11 23:53:32,739 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:32,739 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 35 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:32,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 589 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:53:32,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-07-11 23:53:32,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 287. [2022-07-11 23:53:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.4755244755244756) internal successors, (422), 286 states have internal predecessors, (422), 0 states have call successors, (0), 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,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 422 transitions. [2022-07-11 23:53:32,746 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 422 transitions. Word has length 77 [2022-07-11 23:53:32,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:32,746 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 422 transitions. [2022-07-11 23:53:32,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:32,747 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 422 transitions. [2022-07-11 23:53:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-11 23:53:32,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:32,748 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] [2022-07-11 23:53:32,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-11 23:53:32,748 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:32,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:32,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2009733770, now seen corresponding path program 1 times [2022-07-11 23:53:32,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:32,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547939895] [2022-07-11 23:53:32,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:32,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:32,858 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:53:32,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:32,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547939895] [2022-07-11 23:53:32,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547939895] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:32,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:32,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:32,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532447843] [2022-07-11 23:53:32,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:32,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:32,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:32,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:32,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:32,860 INFO L87 Difference]: Start difference. First operand 287 states and 422 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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:34,713 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:53:34,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:34,995 INFO L93 Difference]: Finished difference Result 617 states and 912 transitions. [2022-07-11 23:53:34,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:34,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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:53:34,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:34,997 INFO L225 Difference]: With dead ends: 617 [2022-07-11 23:53:34,998 INFO L226 Difference]: Without dead ends: 351 [2022-07-11 23:53:34,998 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:34,999 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 77 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:34,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 469 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-11 23:53:34,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-07-11 23:53:35,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 297. [2022-07-11 23:53:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.489864864864865) internal successors, (441), 296 states have internal predecessors, (441), 0 states have call successors, (0), 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:35,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 441 transitions. [2022-07-11 23:53:35,006 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 441 transitions. Word has length 82 [2022-07-11 23:53:35,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:35,006 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 441 transitions. [2022-07-11 23:53:35,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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:35,007 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 441 transitions. [2022-07-11 23:53:35,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-11 23:53:35,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:35,008 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] [2022-07-11 23:53:35,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-11 23:53:35,008 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:35,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:35,008 INFO L85 PathProgramCache]: Analyzing trace with hash -2129799745, now seen corresponding path program 1 times [2022-07-11 23:53:35,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:35,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345290143] [2022-07-11 23:53:35,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:35,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:35,135 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:53:35,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:35,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345290143] [2022-07-11 23:53:35,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345290143] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:35,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:35,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:35,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69467263] [2022-07-11 23:53:35,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:35,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:35,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:35,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:35,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:35,139 INFO L87 Difference]: Start difference. First operand 297 states and 441 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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:36,873 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:53:37,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:37,144 INFO L93 Difference]: Finished difference Result 621 states and 923 transitions. [2022-07-11 23:53:37,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:37,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 83 [2022-07-11 23:53:37,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:37,146 INFO L225 Difference]: With dead ends: 621 [2022-07-11 23:53:37,146 INFO L226 Difference]: Without dead ends: 345 [2022-07-11 23:53:37,147 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:37,147 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 70 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:37,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 475 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-11 23:53:37,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-07-11 23:53:37,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 298. [2022-07-11 23:53:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.4882154882154883) internal successors, (442), 297 states have internal predecessors, (442), 0 states have call successors, (0), 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:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 442 transitions. [2022-07-11 23:53:37,154 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 442 transitions. Word has length 83 [2022-07-11 23:53:37,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:37,154 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 442 transitions. [2022-07-11 23:53:37,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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:37,155 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 442 transitions. [2022-07-11 23:53:37,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-11 23:53:37,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:37,156 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-11 23:53:37,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-11 23:53:37,157 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:37,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:37,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1674400777, now seen corresponding path program 1 times [2022-07-11 23:53:37,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:37,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376614392] [2022-07-11 23:53:37,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:37,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-11 23:53:37,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:37,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376614392] [2022-07-11 23:53:37,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376614392] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:37,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:37,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:53:37,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108281771] [2022-07-11 23:53:37,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:37,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:53:37,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:37,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:53:37,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:53:37,290 INFO L87 Difference]: Start difference. First operand 298 states and 442 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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:53:38,297 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:53:38,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:38,949 INFO L93 Difference]: Finished difference Result 585 states and 872 transitions. [2022-07-11 23:53:38,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:53:38,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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 94 [2022-07-11 23:53:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:38,951 INFO L225 Difference]: With dead ends: 585 [2022-07-11 23:53:38,951 INFO L226 Difference]: Without dead ends: 308 [2022-07-11 23:53:38,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:53:38,952 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 149 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:38,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 354 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-11 23:53:38,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-11 23:53:38,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 307. [2022-07-11 23:53:38,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.4803921568627452) internal successors, (453), 306 states have internal predecessors, (453), 0 states have call successors, (0), 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:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 453 transitions. [2022-07-11 23:53:38,959 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 453 transitions. Word has length 94 [2022-07-11 23:53:38,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:38,959 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 453 transitions. [2022-07-11 23:53:38,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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:53:38,959 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 453 transitions. [2022-07-11 23:53:38,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-11 23:53:38,960 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:38,960 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-11 23:53:38,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-11 23:53:38,961 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:38,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:38,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1278038072, now seen corresponding path program 1 times [2022-07-11 23:53:38,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:38,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389068265] [2022-07-11 23:53:38,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:38,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:39,081 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:53:39,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:39,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389068265] [2022-07-11 23:53:39,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389068265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:39,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:39,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:39,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387198630] [2022-07-11 23:53:39,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:39,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:39,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:39,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:39,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:39,085 INFO L87 Difference]: Start difference. First operand 307 states and 453 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:39,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:39,653 INFO L93 Difference]: Finished difference Result 682 states and 1021 transitions. [2022-07-11 23:53:39,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:39,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-07-11 23:53:39,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:39,655 INFO L225 Difference]: With dead ends: 682 [2022-07-11 23:53:39,655 INFO L226 Difference]: Without dead ends: 396 [2022-07-11 23:53:39,656 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:39,656 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 136 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:39,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 354 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:53:39,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-07-11 23:53:39,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 307. [2022-07-11 23:53:39,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.4640522875816993) internal successors, (448), 306 states have internal predecessors, (448), 0 states have call successors, (0), 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:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 448 transitions. [2022-07-11 23:53:39,666 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 448 transitions. Word has length 95 [2022-07-11 23:53:39,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:39,666 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 448 transitions. [2022-07-11 23:53:39,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 448 transitions. [2022-07-11 23:53:39,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-11 23:53:39,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:39,668 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-11 23:53:39,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-11 23:53:39,668 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:39,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:39,668 INFO L85 PathProgramCache]: Analyzing trace with hash 868200130, now seen corresponding path program 1 times [2022-07-11 23:53:39,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:39,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992971289] [2022-07-11 23:53:39,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:39,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-11 23:53:39,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:39,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992971289] [2022-07-11 23:53:39,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992971289] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:39,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:39,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:53:39,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615259187] [2022-07-11 23:53:39,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:39,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:53:39,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:39,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:53:39,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:53:39,776 INFO L87 Difference]: Start difference. First operand 307 states and 448 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:40,479 INFO L93 Difference]: Finished difference Result 630 states and 922 transitions. [2022-07-11 23:53:40,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:53:40,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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 99 [2022-07-11 23:53:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:40,481 INFO L225 Difference]: With dead ends: 630 [2022-07-11 23:53:40,481 INFO L226 Difference]: Without dead ends: 344 [2022-07-11 23:53:40,481 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:40,482 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 77 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:40,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 503 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:53:40,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-07-11 23:53:40,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 307. [2022-07-11 23:53:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.4607843137254901) internal successors, (447), 306 states have internal predecessors, (447), 0 states have call successors, (0), 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:40,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 447 transitions. [2022-07-11 23:53:40,490 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 447 transitions. Word has length 99 [2022-07-11 23:53:40,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:40,490 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 447 transitions. [2022-07-11 23:53:40,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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:40,490 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 447 transitions. [2022-07-11 23:53:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-11 23:53:40,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:40,491 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-11 23:53:40,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-11 23:53:40,492 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:40,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:40,492 INFO L85 PathProgramCache]: Analyzing trace with hash 908874880, now seen corresponding path program 1 times [2022-07-11 23:53:40,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:40,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689552942] [2022-07-11 23:53:40,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:40,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:40,587 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-11 23:53:40,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:40,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689552942] [2022-07-11 23:53:40,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689552942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:40,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:40,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:53:40,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805935136] [2022-07-11 23:53:40,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:40,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:53:40,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:40,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:53:40,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:53:40,589 INFO L87 Difference]: Start difference. First operand 307 states and 447 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:40,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:40,641 INFO L93 Difference]: Finished difference Result 874 states and 1287 transitions. [2022-07-11 23:53:40,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:53:40,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-07-11 23:53:40,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:40,644 INFO L225 Difference]: With dead ends: 874 [2022-07-11 23:53:40,644 INFO L226 Difference]: Without dead ends: 588 [2022-07-11 23:53:40,645 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:53:40,647 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 143 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:40,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 428 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:53:40,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2022-07-11 23:53:40,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 588. [2022-07-11 23:53:40,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 587 states have (on average 1.4565587734241907) internal successors, (855), 587 states have internal predecessors, (855), 0 states have call successors, (0), 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:40,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 855 transitions. [2022-07-11 23:53:40,662 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 855 transitions. Word has length 99 [2022-07-11 23:53:40,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:40,663 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 855 transitions. [2022-07-11 23:53:40,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:40,663 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 855 transitions. [2022-07-11 23:53:40,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-11 23:53:40,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:40,665 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-11 23:53:40,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-11 23:53:40,665 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:40,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:40,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1342603966, now seen corresponding path program 1 times [2022-07-11 23:53:40,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:40,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340644721] [2022-07-11 23:53:40,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:40,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-11 23:53:40,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:40,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340644721] [2022-07-11 23:53:40,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340644721] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:40,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:40,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:53:40,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133247824] [2022-07-11 23:53:40,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:40,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:53:40,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:40,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:53:40,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:53:40,750 INFO L87 Difference]: Start difference. First operand 588 states and 855 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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:53:40,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:40,782 INFO L93 Difference]: Finished difference Result 1182 states and 1722 transitions. [2022-07-11 23:53:40,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:53:40,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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 99 [2022-07-11 23:53:40,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:40,785 INFO L225 Difference]: With dead ends: 1182 [2022-07-11 23:53:40,785 INFO L226 Difference]: Without dead ends: 615 [2022-07-11 23:53:40,786 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:53:40,786 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 15 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:40,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 410 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:53:40,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-07-11 23:53:40,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2022-07-11 23:53:40,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 614 states have (on average 1.4495114006514658) internal successors, (890), 614 states have internal predecessors, (890), 0 states have call successors, (0), 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:40,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 890 transitions. [2022-07-11 23:53:40,801 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 890 transitions. Word has length 99 [2022-07-11 23:53:40,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:40,801 INFO L495 AbstractCegarLoop]: Abstraction has 615 states and 890 transitions. [2022-07-11 23:53:40,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 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:53:40,801 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 890 transitions. [2022-07-11 23:53:40,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-11 23:53:40,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:40,803 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-11 23:53:40,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-11 23:53:40,803 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:40,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:40,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2113329668, now seen corresponding path program 1 times [2022-07-11 23:53:40,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:40,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385380147] [2022-07-11 23:53:40,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:40,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-11 23:53:40,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:40,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385380147] [2022-07-11 23:53:40,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385380147] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:40,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:40,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:53:40,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534175206] [2022-07-11 23:53:40,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:40,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:53:40,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:40,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:53:40,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:53:40,899 INFO L87 Difference]: Start difference. First operand 615 states and 890 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:40,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:40,923 INFO L93 Difference]: Finished difference Result 1211 states and 1758 transitions. [2022-07-11 23:53:40,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:53:40,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-07-11 23:53:40,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:40,926 INFO L225 Difference]: With dead ends: 1211 [2022-07-11 23:53:40,926 INFO L226 Difference]: Without dead ends: 617 [2022-07-11 23:53:40,927 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:53:40,928 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:40,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 389 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:53:40,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-07-11 23:53:40,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2022-07-11 23:53:40,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 616 states have (on average 1.448051948051948) internal successors, (892), 616 states have internal predecessors, (892), 0 states have call successors, (0), 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:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 892 transitions. [2022-07-11 23:53:40,942 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 892 transitions. Word has length 99 [2022-07-11 23:53:40,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:40,942 INFO L495 AbstractCegarLoop]: Abstraction has 617 states and 892 transitions. [2022-07-11 23:53:40,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:40,942 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 892 transitions. [2022-07-11 23:53:40,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-11 23:53:40,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:40,944 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-11 23:53:40,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-11 23:53:40,944 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:40,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:40,945 INFO L85 PathProgramCache]: Analyzing trace with hash -254845290, now seen corresponding path program 1 times [2022-07-11 23:53:40,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:40,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431284087] [2022-07-11 23:53:40,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:40,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:41,052 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-11 23:53:41,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:41,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431284087] [2022-07-11 23:53:41,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431284087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:41,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:41,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:53:41,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568953720] [2022-07-11 23:53:41,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:41,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:53:41,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:41,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:53:41,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:53:41,056 INFO L87 Difference]: Start difference. First operand 617 states and 892 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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:41,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:41,103 INFO L93 Difference]: Finished difference Result 1497 states and 2179 transitions. [2022-07-11 23:53:41,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:53:41,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 101 [2022-07-11 23:53:41,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:41,106 INFO L225 Difference]: With dead ends: 1497 [2022-07-11 23:53:41,107 INFO L226 Difference]: Without dead ends: 903 [2022-07-11 23:53:41,108 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:53:41,109 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 164 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:41,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 372 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:53:41,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2022-07-11 23:53:41,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 901. [2022-07-11 23:53:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.4566666666666668) internal successors, (1311), 900 states have internal predecessors, (1311), 0 states have call successors, (0), 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:41,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1311 transitions. [2022-07-11 23:53:41,135 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1311 transitions. Word has length 101 [2022-07-11 23:53:41,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:41,135 INFO L495 AbstractCegarLoop]: Abstraction has 901 states and 1311 transitions. [2022-07-11 23:53:41,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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:41,135 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1311 transitions. [2022-07-11 23:53:41,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-11 23:53:41,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:41,137 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2022-07-11 23:53:41,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-11 23:53:41,137 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:41,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:41,138 INFO L85 PathProgramCache]: Analyzing trace with hash 34857145, now seen corresponding path program 1 times [2022-07-11 23:53:41,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:41,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850492349] [2022-07-11 23:53:41,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:41,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-11 23:53:41,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:41,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850492349] [2022-07-11 23:53:41,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850492349] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:41,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:41,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:53:41,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448700672] [2022-07-11 23:53:41,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:41,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:53:41,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:41,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:53:41,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:53:41,253 INFO L87 Difference]: Start difference. First operand 901 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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:53:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:41,306 INFO L93 Difference]: Finished difference Result 2065 states and 3015 transitions. [2022-07-11 23:53:41,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:53:41,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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 106 [2022-07-11 23:53:41,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:41,311 INFO L225 Difference]: With dead ends: 2065 [2022-07-11 23:53:41,311 INFO L226 Difference]: Without dead ends: 1187 [2022-07-11 23:53:41,312 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:53:41,313 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 150 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:41,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 569 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:53:41,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2022-07-11 23:53:41,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1185. [2022-07-11 23:53:41,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1184 states have (on average 1.4493243243243243) internal successors, (1716), 1184 states have internal predecessors, (1716), 0 states have call successors, (0), 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:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1716 transitions. [2022-07-11 23:53:41,344 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1716 transitions. Word has length 106 [2022-07-11 23:53:41,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:41,345 INFO L495 AbstractCegarLoop]: Abstraction has 1185 states and 1716 transitions. [2022-07-11 23:53:41,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 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:53:41,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1716 transitions. [2022-07-11 23:53:41,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-11 23:53:41,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:41,347 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] [2022-07-11 23:53:41,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-11 23:53:41,347 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:41,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:41,348 INFO L85 PathProgramCache]: Analyzing trace with hash -285519407, now seen corresponding path program 1 times [2022-07-11 23:53:41,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:41,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221227132] [2022-07-11 23:53:41,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:41,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-11 23:53:41,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:41,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221227132] [2022-07-11 23:53:41,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221227132] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:41,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:41,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:53:41,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423840741] [2022-07-11 23:53:41,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:41,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:53:41,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:41,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:53:41,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:53:41,496 INFO L87 Difference]: Start difference. First operand 1185 states and 1716 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:41,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:41,554 INFO L93 Difference]: Finished difference Result 2626 states and 3817 transitions. [2022-07-11 23:53:41,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:53:41,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2022-07-11 23:53:41,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:41,560 INFO L225 Difference]: With dead ends: 2626 [2022-07-11 23:53:41,560 INFO L226 Difference]: Without dead ends: 1464 [2022-07-11 23:53:41,562 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:53:41,563 INFO L413 NwaCegarLoop]: 378 mSDtfsCounter, 141 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:41,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 567 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:53:41,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2022-07-11 23:53:41,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1464. [2022-07-11 23:53:41,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 1463 states have (on average 1.4497607655502391) internal successors, (2121), 1463 states have internal predecessors, (2121), 0 states have call successors, (0), 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:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2121 transitions. [2022-07-11 23:53:41,601 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2121 transitions. Word has length 123 [2022-07-11 23:53:41,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:41,601 INFO L495 AbstractCegarLoop]: Abstraction has 1464 states and 2121 transitions. [2022-07-11 23:53:41,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2121 transitions. [2022-07-11 23:53:41,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-11 23:53:41,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:41,604 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-11 23:53:41,604 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:41,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:41,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1271906027, now seen corresponding path program 1 times [2022-07-11 23:53:41,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:41,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465562727] [2022-07-11 23:53:41,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:41,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:41,761 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-11 23:53:41,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:41,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465562727] [2022-07-11 23:53:41,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465562727] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:41,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:41,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:53:41,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62742605] [2022-07-11 23:53:41,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:41,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:53:41,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:41,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:53:41,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:53:41,764 INFO L87 Difference]: Start difference. First operand 1464 states and 2121 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:41,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:41,822 INFO L93 Difference]: Finished difference Result 1752 states and 2537 transitions. [2022-07-11 23:53:41,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:53:41,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2022-07-11 23:53:41,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:41,829 INFO L225 Difference]: With dead ends: 1752 [2022-07-11 23:53:41,829 INFO L226 Difference]: Without dead ends: 1750 [2022-07-11 23:53:41,830 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:53:41,833 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 165 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:41,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 371 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:53:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2022-07-11 23:53:41,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1748. [2022-07-11 23:53:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1747 states have (on average 1.450486548368632) internal successors, (2534), 1747 states have internal predecessors, (2534), 0 states have call successors, (0), 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:41,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2534 transitions. [2022-07-11 23:53:41,893 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2534 transitions. Word has length 129 [2022-07-11 23:53:41,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:41,893 INFO L495 AbstractCegarLoop]: Abstraction has 1748 states and 2534 transitions. [2022-07-11 23:53:41,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:53:41,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2534 transitions. [2022-07-11 23:53:41,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-11 23:53:41,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:41,897 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, 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] [2022-07-11 23:53:41,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-11 23:53:41,897 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:41,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:41,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1650407178, now seen corresponding path program 1 times [2022-07-11 23:53:41,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:41,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820360746] [2022-07-11 23:53:41,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:41,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:42,163 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2022-07-11 23:53:42,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:42,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820360746] [2022-07-11 23:53:42,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820360746] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:53:42,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:53:42,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:53:42,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176574744] [2022-07-11 23:53:42,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:53:42,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:53:42,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:53:42,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:53:42,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:53:42,166 INFO L87 Difference]: Start difference. First operand 1748 states and 2534 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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:43,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:53:43,263 INFO L93 Difference]: Finished difference Result 3493 states and 5064 transitions. [2022-07-11 23:53:43,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:53:43,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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 166 [2022-07-11 23:53:43,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:53:43,282 INFO L225 Difference]: With dead ends: 3493 [2022-07-11 23:53:43,283 INFO L226 Difference]: Without dead ends: 1748 [2022-07-11 23:53:43,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:53:43,285 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 7 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:53:43,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 671 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-11 23:53:43,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2022-07-11 23:53:43,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1748. [2022-07-11 23:53:43,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1747 states have (on average 1.4499141385231826) internal successors, (2533), 1747 states have internal predecessors, (2533), 0 states have call successors, (0), 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:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2533 transitions. [2022-07-11 23:53:43,329 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2533 transitions. Word has length 166 [2022-07-11 23:53:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:53:43,329 INFO L495 AbstractCegarLoop]: Abstraction has 1748 states and 2533 transitions. [2022-07-11 23:53:43,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 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:43,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2533 transitions. [2022-07-11 23:53:43,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-11 23:53:43,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:53:43,333 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, 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] [2022-07-11 23:53:43,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-11 23:53:43,333 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:53:43,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:53:43,334 INFO L85 PathProgramCache]: Analyzing trace with hash -74201144, now seen corresponding path program 1 times [2022-07-11 23:53:43,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:53:43,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416923670] [2022-07-11 23:53:43,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:43,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:53:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-11 23:53:44,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:53:44,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416923670] [2022-07-11 23:53:44,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416923670] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:53:44,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1370169061] [2022-07-11 23:53:44,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:53:44,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:53:44,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:53:44,135 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:53:44,141 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:53:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:53:44,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 239 conjunts are in the unsatisfiable core [2022-07-11 23:53:44,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:53:45,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28153 treesize of output 23896 [2022-07-11 23:53:45,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:53:45,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 18 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10709 treesize of output 1662