./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/ntdrivers/kbfiltr.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 791fd4c1f54f973c646b3f11f7eb2f654eca269cacf7e504443ee0d13fbe9694 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 11:33:05,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 11:33:05,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 11:33:05,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 11:33:05,757 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 11:33:05,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 11:33:05,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 11:33:05,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 11:33:05,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 11:33:05,768 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 11:33:05,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 11:33:05,771 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 11:33:05,771 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 11:33:05,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 11:33:05,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 11:33:05,775 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 11:33:05,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 11:33:05,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 11:33:05,778 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 11:33:05,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 11:33:05,783 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 11:33:05,784 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 11:33:05,785 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 11:33:05,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 11:33:05,786 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 11:33:05,791 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 11:33:05,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 11:33:05,792 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 11:33:05,793 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 11:33:05,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 11:33:05,794 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 11:33:05,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 11:33:05,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 11:33:05,796 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 11:33:05,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 11:33:05,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 11:33:05,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 11:33:05,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 11:33:05,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 11:33:05,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 11:33:05,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 11:33:05,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 11:33:05,801 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 11:33:05,825 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 11:33:05,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 11:33:05,825 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 11:33:05,826 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 11:33:05,826 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 11:33:05,826 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 11:33:05,827 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 11:33:05,827 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 11:33:05,827 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 11:33:05,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 11:33:05,827 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 11:33:05,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 11:33:05,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 11:33:05,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 11:33:05,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 11:33:05,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 11:33:05,828 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 11:33:05,828 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 11:33:05,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 11:33:05,829 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 11:33:05,829 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 11:33:05,829 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 11:33:05,829 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 11:33:05,829 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 11:33:05,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:33:05,830 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 11:33:05,830 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 11:33:05,830 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 11:33:05,830 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 11:33:05,830 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 11:33:05,830 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 11:33:05,831 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 11:33:05,831 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 11:33:05,831 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 -> 791fd4c1f54f973c646b3f11f7eb2f654eca269cacf7e504443ee0d13fbe9694 [2022-07-13 11:33:06,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 11:33:06,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 11:33:06,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 11:33:06,070 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 11:33:06,070 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 11:33:06,071 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c [2022-07-13 11:33:06,114 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d260a6f6/974908e8ec134a0b99a5ab572d27cd6b/FLAG5c5b44946 [2022-07-13 11:33:06,606 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 11:33:06,606 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c [2022-07-13 11:33:06,627 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d260a6f6/974908e8ec134a0b99a5ab572d27cd6b/FLAG5c5b44946 [2022-07-13 11:33:06,641 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d260a6f6/974908e8ec134a0b99a5ab572d27cd6b [2022-07-13 11:33:06,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 11:33:06,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 11:33:06,645 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 11:33:06,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 11:33:06,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 11:33:06,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:33:06" (1/1) ... [2022-07-13 11:33:06,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d45574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:06, skipping insertion in model container [2022-07-13 11:33:06,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:33:06" (1/1) ... [2022-07-13 11:33:06,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 11:33:06,713 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 11:33:06,999 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/ntdrivers/kbfiltr.i.cil-2.c[62209,62222] [2022-07-13 11:33:07,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:33:07,135 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 11:33:07,228 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/ntdrivers/kbfiltr.i.cil-2.c[62209,62222] [2022-07-13 11:33:07,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 11:33:07,306 INFO L208 MainTranslator]: Completed translation [2022-07-13 11:33:07,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:07 WrapperNode [2022-07-13 11:33:07,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 11:33:07,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 11:33:07,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 11:33:07,308 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 11:33:07,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:07" (1/1) ... [2022-07-13 11:33:07,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:07" (1/1) ... [2022-07-13 11:33:07,402 INFO L137 Inliner]: procedures = 109, calls = 328, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 1084 [2022-07-13 11:33:07,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 11:33:07,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 11:33:07,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 11:33:07,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 11:33:07,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:07" (1/1) ... [2022-07-13 11:33:07,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:07" (1/1) ... [2022-07-13 11:33:07,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:07" (1/1) ... [2022-07-13 11:33:07,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:07" (1/1) ... [2022-07-13 11:33:07,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:07" (1/1) ... [2022-07-13 11:33:07,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:07" (1/1) ... [2022-07-13 11:33:07,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:07" (1/1) ... [2022-07-13 11:33:07,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 11:33:07,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 11:33:07,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 11:33:07,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 11:33:07,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:07" (1/1) ... [2022-07-13 11:33:07,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 11:33:07,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:33:07,552 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-13 11:33:07,570 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-13 11:33:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-07-13 11:33:07,585 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-07-13 11:33:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-13 11:33:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-13 11:33:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-13 11:33:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 11:33:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-13 11:33:07,586 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-13 11:33:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 11:33:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-13 11:33:07,587 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-13 11:33:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-13 11:33:07,587 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-13 11:33:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 11:33:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 11:33:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 11:33:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 11:33:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-13 11:33:07,588 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-13 11:33:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-07-13 11:33:07,588 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-07-13 11:33:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 11:33:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 11:33:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 11:33:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-13 11:33:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 11:33:07,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 11:33:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-07-13 11:33:07,589 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-07-13 11:33:07,825 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 11:33:07,826 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 11:33:07,895 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:33:07,935 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-07-13 11:33:07,936 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-07-13 11:33:07,997 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:33:07,998 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:33:07,999 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:33:08,002 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:33:08,003 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:33:08,006 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:33:08,007 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 11:33:10,132 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##83: assume false; [2022-07-13 11:33:10,132 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume !false; [2022-07-13 11:33:10,132 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##36: assume !false; [2022-07-13 11:33:10,132 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume false; [2022-07-13 11:33:10,133 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##139: assume false; [2022-07-13 11:33:10,133 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume !false; [2022-07-13 11:33:10,133 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2022-07-13 11:33:10,133 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2022-07-13 11:33:10,133 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2022-07-13 11:33:10,133 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume !false; [2022-07-13 11:33:10,133 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2022-07-13 11:33:10,133 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##156: assume false; [2022-07-13 11:33:10,134 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##114: assume !false; [2022-07-13 11:33:10,134 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume false; [2022-07-13 11:33:10,146 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 11:33:10,152 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 11:33:10,152 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 11:33:10,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:33:10 BoogieIcfgContainer [2022-07-13 11:33:10,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 11:33:10,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 11:33:10,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 11:33:10,158 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 11:33:10,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:33:06" (1/3) ... [2022-07-13 11:33:10,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ef272e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:33:10, skipping insertion in model container [2022-07-13 11:33:10,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:33:07" (2/3) ... [2022-07-13 11:33:10,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ef272e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:33:10, skipping insertion in model container [2022-07-13 11:33:10,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:33:10" (3/3) ... [2022-07-13 11:33:10,160 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr.i.cil-2.c [2022-07-13 11:33:10,170 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 11:33:10,170 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 11:33:10,204 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 11:33:10,208 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@cfb4bc8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5ca52590 [2022-07-13 11:33:10,209 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 11:33:10,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 239 states, 201 states have (on average 1.572139303482587) internal successors, (316), 219 states have internal predecessors, (316), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) [2022-07-13 11:33:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 11:33:10,217 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:10,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:10,218 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:10,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:10,222 INFO L85 PathProgramCache]: Analyzing trace with hash -660511979, now seen corresponding path program 1 times [2022-07-13 11:33:10,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:10,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591694182] [2022-07-13 11:33:10,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:10,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:10,539 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-13 11:33:10,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:10,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591694182] [2022-07-13 11:33:10,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591694182] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:10,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:10,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 11:33:10,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884357892] [2022-07-13 11:33:10,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:10,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 11:33:10,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:10,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 11:33:10,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:33:10,579 INFO L87 Difference]: Start difference. First operand has 239 states, 201 states have (on average 1.572139303482587) internal successors, (316), 219 states have internal predecessors, (316), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 27 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:10,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:10,624 INFO L93 Difference]: Finished difference Result 472 states and 755 transitions. [2022-07-13 11:33:10,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 11:33:10,626 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-13 11:33:10,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:10,633 INFO L225 Difference]: With dead ends: 472 [2022-07-13 11:33:10,634 INFO L226 Difference]: Without dead ends: 231 [2022-07-13 11:33:10,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 11:33:10,640 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:10,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:33:10,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-13 11:33:10,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2022-07-13 11:33:10,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 195 states have (on average 1.5128205128205128) internal successors, (295), 211 states have internal predecessors, (295), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-13 11:33:10,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 339 transitions. [2022-07-13 11:33:10,678 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 339 transitions. Word has length 16 [2022-07-13 11:33:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:10,679 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 339 transitions. [2022-07-13 11:33:10,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 339 transitions. [2022-07-13 11:33:10,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 11:33:10,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:10,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:10,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 11:33:10,681 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:10,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:10,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1247317993, now seen corresponding path program 1 times [2022-07-13 11:33:10,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:10,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359882162] [2022-07-13 11:33:10,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:10,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:10,843 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-13 11:33:10,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:10,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359882162] [2022-07-13 11:33:10,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359882162] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:10,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:10,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:33:10,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702375956] [2022-07-13 11:33:10,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:10,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:33:10,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:10,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:33:10,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:33:10,849 INFO L87 Difference]: Start difference. First operand 231 states and 339 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:12,221 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:12,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:12,282 INFO L93 Difference]: Finished difference Result 248 states and 360 transitions. [2022-07-13 11:33:12,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:33:12,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-13 11:33:12,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:12,285 INFO L225 Difference]: With dead ends: 248 [2022-07-13 11:33:12,285 INFO L226 Difference]: Without dead ends: 231 [2022-07-13 11:33:12,285 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-13 11:33:12,286 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 249 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:12,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 737 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-13 11:33:12,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-13 11:33:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2022-07-13 11:33:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 195 states have (on average 1.5076923076923077) internal successors, (294), 211 states have internal predecessors, (294), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-13 11:33:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 338 transitions. [2022-07-13 11:33:12,299 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 338 transitions. Word has length 16 [2022-07-13 11:33:12,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:12,300 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 338 transitions. [2022-07-13 11:33:12,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:12,300 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 338 transitions. [2022-07-13 11:33:12,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 11:33:12,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:12,301 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] [2022-07-13 11:33:12,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 11:33:12,302 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:12,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:12,302 INFO L85 PathProgramCache]: Analyzing trace with hash 8900389, now seen corresponding path program 1 times [2022-07-13 11:33:12,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:12,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025178744] [2022-07-13 11:33:12,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:12,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:12,404 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-13 11:33:12,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:12,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025178744] [2022-07-13 11:33:12,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025178744] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:12,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:12,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:33:12,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118529569] [2022-07-13 11:33:12,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:12,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:33:12,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:12,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:33:12,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:33:12,407 INFO L87 Difference]: Start difference. First operand 231 states and 338 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:12,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:12,710 INFO L93 Difference]: Finished difference Result 603 states and 904 transitions. [2022-07-13 11:33:12,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:33:12,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-13 11:33:12,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:12,713 INFO L225 Difference]: With dead ends: 603 [2022-07-13 11:33:12,713 INFO L226 Difference]: Without dead ends: 392 [2022-07-13 11:33:12,714 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-13 11:33:12,715 INFO L413 NwaCegarLoop]: 553 mSDtfsCounter, 442 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:12,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1254 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 11:33:12,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-07-13 11:33:12,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 233. [2022-07-13 11:33:12,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 197 states have (on average 1.50253807106599) internal successors, (296), 213 states have internal predecessors, (296), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-07-13 11:33:12,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 340 transitions. [2022-07-13 11:33:12,731 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 340 transitions. Word has length 28 [2022-07-13 11:33:12,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:12,732 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 340 transitions. [2022-07-13 11:33:12,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:12,732 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 340 transitions. [2022-07-13 11:33:12,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 11:33:12,733 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:12,733 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] [2022-07-13 11:33:12,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 11:33:12,733 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:12,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:12,734 INFO L85 PathProgramCache]: Analyzing trace with hash 620779237, now seen corresponding path program 1 times [2022-07-13 11:33:12,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:12,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895312299] [2022-07-13 11:33:12,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:12,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:12,837 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-13 11:33:12,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:12,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895312299] [2022-07-13 11:33:12,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895312299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:12,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:12,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:33:12,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499691755] [2022-07-13 11:33:12,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:12,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:33:12,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:12,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:33:12,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:33:12,840 INFO L87 Difference]: Start difference. First operand 233 states and 340 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:13,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:13,780 INFO L93 Difference]: Finished difference Result 354 states and 506 transitions. [2022-07-13 11:33:13,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:33:13,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-13 11:33:13,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:13,783 INFO L225 Difference]: With dead ends: 354 [2022-07-13 11:33:13,783 INFO L226 Difference]: Without dead ends: 299 [2022-07-13 11:33:13,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-13 11:33:13,784 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 244 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:13,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 477 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 11:33:13,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-13 11:33:13,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 283. [2022-07-13 11:33:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 246 states have (on average 1.4308943089430894) internal successors, (352), 249 states have internal predecessors, (352), 26 states have call successors, (26), 11 states have call predecessors, (26), 10 states have return successors, (27), 25 states have call predecessors, (27), 18 states have call successors, (27) [2022-07-13 11:33:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 405 transitions. [2022-07-13 11:33:13,812 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 405 transitions. Word has length 28 [2022-07-13 11:33:13,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:13,812 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 405 transitions. [2022-07-13 11:33:13,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:13,813 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 405 transitions. [2022-07-13 11:33:13,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 11:33:13,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:13,814 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] [2022-07-13 11:33:13,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 11:33:13,814 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:13,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:13,815 INFO L85 PathProgramCache]: Analyzing trace with hash -451775854, now seen corresponding path program 1 times [2022-07-13 11:33:13,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:13,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149977906] [2022-07-13 11:33:13,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:13,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:13,934 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-13 11:33:13,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:13,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149977906] [2022-07-13 11:33:13,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149977906] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:13,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:13,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:33:13,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19031603] [2022-07-13 11:33:13,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:13,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:33:13,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:13,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:33:13,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:33:13,937 INFO L87 Difference]: Start difference. First operand 283 states and 405 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:13,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:13,966 INFO L93 Difference]: Finished difference Result 439 states and 613 transitions. [2022-07-13 11:33:13,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:33:13,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-13 11:33:13,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:13,969 INFO L225 Difference]: With dead ends: 439 [2022-07-13 11:33:13,969 INFO L226 Difference]: Without dead ends: 340 [2022-07-13 11:33:13,969 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-13 11:33:13,970 INFO L413 NwaCegarLoop]: 338 mSDtfsCounter, 281 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:13,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 426 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:33:13,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-07-13 11:33:13,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 317. [2022-07-13 11:33:13,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 282 states have (on average 1.425531914893617) internal successors, (402), 283 states have internal predecessors, (402), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-07-13 11:33:13,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 450 transitions. [2022-07-13 11:33:13,990 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 450 transitions. Word has length 30 [2022-07-13 11:33:13,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:13,990 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 450 transitions. [2022-07-13 11:33:13,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:13,990 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 450 transitions. [2022-07-13 11:33:13,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-13 11:33:13,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:13,995 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] [2022-07-13 11:33:13,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 11:33:13,996 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:13,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:13,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1294247663, now seen corresponding path program 1 times [2022-07-13 11:33:13,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:13,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988737248] [2022-07-13 11:33:13,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:13,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:14,188 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-13 11:33:14,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:14,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988737248] [2022-07-13 11:33:14,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988737248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:14,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:14,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:33:14,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779605504] [2022-07-13 11:33:14,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:14,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:33:14,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:14,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:33:14,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:33:14,191 INFO L87 Difference]: Start difference. First operand 317 states and 450 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:14,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:14,955 INFO L93 Difference]: Finished difference Result 341 states and 477 transitions. [2022-07-13 11:33:14,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:33:14,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-13 11:33:14,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:14,958 INFO L225 Difference]: With dead ends: 341 [2022-07-13 11:33:14,958 INFO L226 Difference]: Without dead ends: 333 [2022-07-13 11:33:14,958 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-13 11:33:14,959 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 526 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:14,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 400 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 11:33:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-07-13 11:33:14,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 322. [2022-07-13 11:33:14,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 287 states have (on average 1.421602787456446) internal successors, (408), 288 states have internal predecessors, (408), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-07-13 11:33:14,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 456 transitions. [2022-07-13 11:33:14,971 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 456 transitions. Word has length 32 [2022-07-13 11:33:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:14,972 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 456 transitions. [2022-07-13 11:33:14,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 456 transitions. [2022-07-13 11:33:14,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-13 11:33:14,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:14,973 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] [2022-07-13 11:33:14,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 11:33:14,973 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:14,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:14,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1059548875, now seen corresponding path program 1 times [2022-07-13 11:33:14,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:14,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337507676] [2022-07-13 11:33:14,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:14,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:15,084 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-13 11:33:15,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:15,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337507676] [2022-07-13 11:33:15,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337507676] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:15,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:15,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:33:15,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670831961] [2022-07-13 11:33:15,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:15,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:33:15,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:15,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:33:15,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:33:15,086 INFO L87 Difference]: Start difference. First operand 322 states and 456 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:17,093 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:17,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:17,243 INFO L93 Difference]: Finished difference Result 341 states and 476 transitions. [2022-07-13 11:33:17,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:33:17,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-13 11:33:17,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:17,245 INFO L225 Difference]: With dead ends: 341 [2022-07-13 11:33:17,246 INFO L226 Difference]: Without dead ends: 333 [2022-07-13 11:33:17,246 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-13 11:33:17,246 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 523 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:17,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 403 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 104 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-13 11:33:17,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-07-13 11:33:17,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 323. [2022-07-13 11:33:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 288 states have (on average 1.4201388888888888) internal successors, (409), 289 states have internal predecessors, (409), 22 states have call successors, (22), 11 states have call predecessors, (22), 12 states have return successors, (26), 23 states have call predecessors, (26), 16 states have call successors, (26) [2022-07-13 11:33:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 457 transitions. [2022-07-13 11:33:17,259 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 457 transitions. Word has length 33 [2022-07-13 11:33:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:17,259 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 457 transitions. [2022-07-13 11:33:17,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:17,259 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 457 transitions. [2022-07-13 11:33:17,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 11:33:17,260 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:17,260 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] [2022-07-13 11:33:17,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 11:33:17,261 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:17,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:17,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1752141914, now seen corresponding path program 1 times [2022-07-13 11:33:17,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:17,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277158934] [2022-07-13 11:33:17,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:17,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:17,353 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-13 11:33:17,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:17,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277158934] [2022-07-13 11:33:17,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277158934] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:17,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:17,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:33:17,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823418039] [2022-07-13 11:33:17,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:17,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:33:17,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:17,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:33:17,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:33:17,355 INFO L87 Difference]: Start difference. First operand 323 states and 457 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:17,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:17,486 INFO L93 Difference]: Finished difference Result 335 states and 468 transitions. [2022-07-13 11:33:17,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:33:17,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-13 11:33:17,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:17,488 INFO L225 Difference]: With dead ends: 335 [2022-07-13 11:33:17,488 INFO L226 Difference]: Without dead ends: 293 [2022-07-13 11:33:17,488 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-13 11:33:17,489 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 513 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:17,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 401 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:33:17,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-07-13 11:33:17,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2022-07-13 11:33:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 258 states have (on average 1.441860465116279) internal successors, (372), 264 states have internal predecessors, (372), 22 states have call successors, (22), 11 states have call predecessors, (22), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-13 11:33:17,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 412 transitions. [2022-07-13 11:33:17,500 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 412 transitions. Word has length 34 [2022-07-13 11:33:17,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:17,500 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 412 transitions. [2022-07-13 11:33:17,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:17,501 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 412 transitions. [2022-07-13 11:33:17,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-13 11:33:17,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:17,501 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] [2022-07-13 11:33:17,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 11:33:17,502 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:17,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:17,502 INFO L85 PathProgramCache]: Analyzing trace with hash 350835753, now seen corresponding path program 1 times [2022-07-13 11:33:17,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:17,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430312289] [2022-07-13 11:33:17,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:17,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:17,579 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-13 11:33:17,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:17,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430312289] [2022-07-13 11:33:17,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430312289] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:17,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:17,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:33:17,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20042336] [2022-07-13 11:33:17,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:17,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:33:17,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:17,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:33:17,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:33:17,581 INFO L87 Difference]: Start difference. First operand 290 states and 412 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:18,769 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:18,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:18,862 INFO L93 Difference]: Finished difference Result 293 states and 414 transitions. [2022-07-13 11:33:18,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:33:18,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-13 11:33:18,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:18,863 INFO L225 Difference]: With dead ends: 293 [2022-07-13 11:33:18,863 INFO L226 Difference]: Without dead ends: 289 [2022-07-13 11:33:18,864 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-13 11:33:18,864 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 26 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:18,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 535 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-13 11:33:18,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-13 11:33:18,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2022-07-13 11:33:18,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 258 states have (on average 1.434108527131783) internal successors, (370), 263 states have internal predecessors, (370), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-13 11:33:18,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 409 transitions. [2022-07-13 11:33:18,887 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 409 transitions. Word has length 34 [2022-07-13 11:33:18,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:18,888 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 409 transitions. [2022-07-13 11:33:18,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:18,888 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 409 transitions. [2022-07-13 11:33:18,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-13 11:33:18,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:18,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:18,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 11:33:18,889 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:18,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:18,890 INFO L85 PathProgramCache]: Analyzing trace with hash 407921745, now seen corresponding path program 1 times [2022-07-13 11:33:18,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:18,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175581950] [2022-07-13 11:33:18,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:18,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:19,032 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-13 11:33:19,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:19,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175581950] [2022-07-13 11:33:19,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175581950] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:19,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:19,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:33:19,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630179965] [2022-07-13 11:33:19,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:19,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:33:19,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:19,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:33:19,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:33:19,035 INFO L87 Difference]: Start difference. First operand 289 states and 409 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:19,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:19,123 INFO L93 Difference]: Finished difference Result 343 states and 476 transitions. [2022-07-13 11:33:19,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:33:19,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-13 11:33:19,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:19,126 INFO L225 Difference]: With dead ends: 343 [2022-07-13 11:33:19,126 INFO L226 Difference]: Without dead ends: 304 [2022-07-13 11:33:19,127 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-13 11:33:19,127 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 325 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:19,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 498 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:33:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-13 11:33:19,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 289. [2022-07-13 11:33:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 258 states have (on average 1.426356589147287) internal successors, (368), 263 states have internal predecessors, (368), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-13 11:33:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 407 transitions. [2022-07-13 11:33:19,140 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 407 transitions. Word has length 43 [2022-07-13 11:33:19,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:19,141 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 407 transitions. [2022-07-13 11:33:19,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:19,141 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 407 transitions. [2022-07-13 11:33:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 11:33:19,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:19,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:19,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 11:33:19,144 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:19,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:19,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1067937794, now seen corresponding path program 1 times [2022-07-13 11:33:19,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:19,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695957425] [2022-07-13 11:33:19,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:19,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:19,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 11:33:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:19,327 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-13 11:33:19,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:19,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695957425] [2022-07-13 11:33:19,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695957425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:19,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:19,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:33:19,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845223876] [2022-07-13 11:33:19,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:19,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:33:19,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:19,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:33:19,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:33:19,329 INFO L87 Difference]: Start difference. First operand 289 states and 407 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:33:21,934 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:22,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:22,096 INFO L93 Difference]: Finished difference Result 316 states and 439 transitions. [2022-07-13 11:33:22,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:33:22,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-07-13 11:33:22,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:22,098 INFO L225 Difference]: With dead ends: 316 [2022-07-13 11:33:22,098 INFO L226 Difference]: Without dead ends: 308 [2022-07-13 11:33:22,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:33:22,099 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 371 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:22,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 727 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-13 11:33:22,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-13 11:33:22,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 300. [2022-07-13 11:33:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 269 states have (on average 1.420074349442379) internal successors, (382), 273 states have internal predecessors, (382), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-13 11:33:22,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 421 transitions. [2022-07-13 11:33:22,136 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 421 transitions. Word has length 44 [2022-07-13 11:33:22,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:22,136 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 421 transitions. [2022-07-13 11:33:22,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:33:22,137 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 421 transitions. [2022-07-13 11:33:22,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:33:22,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:22,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:22,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 11:33:22,138 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:22,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:22,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1661089768, now seen corresponding path program 1 times [2022-07-13 11:33:22,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:22,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002413788] [2022-07-13 11:33:22,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:22,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:22,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 11:33:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:22,310 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-13 11:33:22,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:22,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002413788] [2022-07-13 11:33:22,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002413788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:22,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:22,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:33:22,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684769797] [2022-07-13 11:33:22,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:22,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:33:22,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:22,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:33:22,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:33:22,312 INFO L87 Difference]: Start difference. First operand 300 states and 421 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:33:24,319 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:25,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:25,329 INFO L93 Difference]: Finished difference Result 316 states and 438 transitions. [2022-07-13 11:33:25,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:33:25,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-07-13 11:33:25,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:25,331 INFO L225 Difference]: With dead ends: 316 [2022-07-13 11:33:25,331 INFO L226 Difference]: Without dead ends: 308 [2022-07-13 11:33:25,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:33:25,332 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 367 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:25,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 729 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 136 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-07-13 11:33:25,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-13 11:33:25,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 301. [2022-07-13 11:33:25,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 270 states have (on average 1.4185185185185185) internal successors, (383), 274 states have internal predecessors, (383), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2022-07-13 11:33:25,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 422 transitions. [2022-07-13 11:33:25,344 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 422 transitions. Word has length 45 [2022-07-13 11:33:25,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:25,345 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 422 transitions. [2022-07-13 11:33:25,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:33:25,345 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 422 transitions. [2022-07-13 11:33:25,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:33:25,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:25,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:25,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 11:33:25,346 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:25,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:25,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1877198546, now seen corresponding path program 1 times [2022-07-13 11:33:25,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:25,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763438907] [2022-07-13 11:33:25,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:25,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:25,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 11:33:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:25,448 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-13 11:33:25,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:25,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763438907] [2022-07-13 11:33:25,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763438907] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:25,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:25,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:33:25,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852278894] [2022-07-13 11:33:25,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:25,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:33:25,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:25,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:33:25,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:33:25,451 INFO L87 Difference]: Start difference. First operand 301 states and 422 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:33:26,989 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:28,584 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:28,734 INFO L93 Difference]: Finished difference Result 348 states and 473 transitions. [2022-07-13 11:33:28,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:33:28,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-07-13 11:33:28,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:28,735 INFO L225 Difference]: With dead ends: 348 [2022-07-13 11:33:28,735 INFO L226 Difference]: Without dead ends: 289 [2022-07-13 11:33:28,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-13 11:33:28,736 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 362 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:28,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 844 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-13 11:33:28,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-13 11:33:28,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 271. [2022-07-13 11:33:28,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 242 states have (on average 1.4049586776859504) internal successors, (340), 246 states have internal predecessors, (340), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-07-13 11:33:28,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 374 transitions. [2022-07-13 11:33:28,762 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 374 transitions. Word has length 45 [2022-07-13 11:33:28,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:28,762 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 374 transitions. [2022-07-13 11:33:28,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:33:28,762 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 374 transitions. [2022-07-13 11:33:28,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:33:28,763 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:28,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:28,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 11:33:28,763 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:28,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:28,764 INFO L85 PathProgramCache]: Analyzing trace with hash 859522540, now seen corresponding path program 1 times [2022-07-13 11:33:28,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:28,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104260556] [2022-07-13 11:33:28,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:28,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:28,885 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-13 11:33:28,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:28,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104260556] [2022-07-13 11:33:28,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104260556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:28,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:28,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:33:28,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949702256] [2022-07-13 11:33:28,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:28,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:33:28,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:28,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:33:28,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:33:28,888 INFO L87 Difference]: Start difference. First operand 271 states and 374 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:30,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:30,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:30,235 INFO L93 Difference]: Finished difference Result 310 states and 423 transitions. [2022-07-13 11:33:30,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:33:30,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-13 11:33:30,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:30,236 INFO L225 Difference]: With dead ends: 310 [2022-07-13 11:33:30,236 INFO L226 Difference]: Without dead ends: 269 [2022-07-13 11:33:30,237 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-13 11:33:30,237 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 303 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:30,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 500 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-13 11:33:30,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-13 11:33:30,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2022-07-13 11:33:30,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 240 states have (on average 1.4) internal successors, (336), 244 states have internal predecessors, (336), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-07-13 11:33:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 370 transitions. [2022-07-13 11:33:30,251 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 370 transitions. Word has length 45 [2022-07-13 11:33:30,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:30,251 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 370 transitions. [2022-07-13 11:33:30,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:30,251 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 370 transitions. [2022-07-13 11:33:30,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-13 11:33:30,252 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:30,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:30,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 11:33:30,252 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:30,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:30,252 INFO L85 PathProgramCache]: Analyzing trace with hash 285533420, now seen corresponding path program 1 times [2022-07-13 11:33:30,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:30,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282776764] [2022-07-13 11:33:30,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:30,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:30,332 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-13 11:33:30,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:30,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282776764] [2022-07-13 11:33:30,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282776764] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:30,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:30,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 11:33:30,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146145345] [2022-07-13 11:33:30,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:30,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:33:30,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:30,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:33:30,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 11:33:30,334 INFO L87 Difference]: Start difference. First operand 269 states and 370 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:30,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:30,358 INFO L93 Difference]: Finished difference Result 286 states and 391 transitions. [2022-07-13 11:33:30,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:33:30,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-13 11:33:30,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:30,361 INFO L225 Difference]: With dead ends: 286 [2022-07-13 11:33:30,361 INFO L226 Difference]: Without dead ends: 263 [2022-07-13 11:33:30,362 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-13 11:33:30,364 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 285 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:30,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 291 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:33:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-13 11:33:30,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2022-07-13 11:33:30,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 235 states have (on average 1.3872340425531915) internal successors, (326), 238 states have internal predecessors, (326), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-07-13 11:33:30,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 359 transitions. [2022-07-13 11:33:30,380 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 359 transitions. Word has length 45 [2022-07-13 11:33:30,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:30,380 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 359 transitions. [2022-07-13 11:33:30,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:30,380 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 359 transitions. [2022-07-13 11:33:30,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-13 11:33:30,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:30,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:30,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 11:33:30,381 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:30,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:30,382 INFO L85 PathProgramCache]: Analyzing trace with hash 270131950, now seen corresponding path program 1 times [2022-07-13 11:33:30,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:30,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772656857] [2022-07-13 11:33:30,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:30,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:30,508 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-13 11:33:30,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:30,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772656857] [2022-07-13 11:33:30,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772656857] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:30,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:30,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:33:30,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608066497] [2022-07-13 11:33:30,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:30,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:33:30,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:30,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:33:30,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:33:30,511 INFO L87 Difference]: Start difference. First operand 263 states and 359 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:31,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:31,444 INFO L93 Difference]: Finished difference Result 283 states and 381 transitions. [2022-07-13 11:33:31,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:33:31,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-13 11:33:31,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:31,446 INFO L225 Difference]: With dead ends: 283 [2022-07-13 11:33:31,446 INFO L226 Difference]: Without dead ends: 262 [2022-07-13 11:33:31,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:33:31,447 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 50 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:31,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1444 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 11:33:31,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-13 11:33:31,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-07-13 11:33:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 234 states have (on average 1.3846153846153846) internal successors, (324), 237 states have internal predecessors, (324), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-07-13 11:33:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 357 transitions. [2022-07-13 11:33:31,460 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 357 transitions. Word has length 46 [2022-07-13 11:33:31,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:31,460 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 357 transitions. [2022-07-13 11:33:31,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:31,460 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 357 transitions. [2022-07-13 11:33:31,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-13 11:33:31,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:31,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:31,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 11:33:31,461 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:31,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:31,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1666913919, now seen corresponding path program 1 times [2022-07-13 11:33:31,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:31,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834190496] [2022-07-13 11:33:31,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:31,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:31,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 11:33:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:31,550 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-13 11:33:31,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:31,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834190496] [2022-07-13 11:33:31,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834190496] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:31,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:31,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:33:31,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267140323] [2022-07-13 11:33:31,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:31,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:33:31,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:31,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:33:31,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:33:31,552 INFO L87 Difference]: Start difference. First operand 262 states and 357 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:33:33,558 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:34,688 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:34,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:34,892 INFO L93 Difference]: Finished difference Result 502 states and 687 transitions. [2022-07-13 11:33:34,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:33:34,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-07-13 11:33:34,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:34,894 INFO L225 Difference]: With dead ends: 502 [2022-07-13 11:33:34,894 INFO L226 Difference]: Without dead ends: 262 [2022-07-13 11:33:34,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:33:34,895 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 41 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:34,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1030 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 88 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-07-13 11:33:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-13 11:33:34,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2022-07-13 11:33:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 232 states have (on average 1.3836206896551724) internal successors, (321), 235 states have internal predecessors, (321), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-07-13 11:33:34,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 354 transitions. [2022-07-13 11:33:34,908 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 354 transitions. Word has length 47 [2022-07-13 11:33:34,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:34,908 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 354 transitions. [2022-07-13 11:33:34,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:33:34,908 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 354 transitions. [2022-07-13 11:33:34,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-13 11:33:34,909 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:34,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:34,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 11:33:34,909 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:34,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:34,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1795358223, now seen corresponding path program 1 times [2022-07-13 11:33:34,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:34,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729474549] [2022-07-13 11:33:34,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:34,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:35,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-13 11:33:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:35,028 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-13 11:33:35,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:35,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729474549] [2022-07-13 11:33:35,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729474549] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:35,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:35,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:33:35,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129457666] [2022-07-13 11:33:35,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:35,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:33:35,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:35,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:33:35,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:33:35,043 INFO L87 Difference]: Start difference. First operand 260 states and 354 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:33:36,115 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:37,788 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:37,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:37,920 INFO L93 Difference]: Finished difference Result 312 states and 413 transitions. [2022-07-13 11:33:37,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:33:37,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-07-13 11:33:37,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:37,922 INFO L225 Difference]: With dead ends: 312 [2022-07-13 11:33:37,922 INFO L226 Difference]: Without dead ends: 259 [2022-07-13 11:33:37,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:33:37,922 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 65 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:37,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1292 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-13 11:33:37,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-07-13 11:33:37,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2022-07-13 11:33:37,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 231 states have (on average 1.367965367965368) internal successors, (316), 234 states have internal predecessors, (316), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-07-13 11:33:37,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 349 transitions. [2022-07-13 11:33:37,934 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 349 transitions. Word has length 52 [2022-07-13 11:33:37,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:37,934 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 349 transitions. [2022-07-13 11:33:37,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:33:37,935 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 349 transitions. [2022-07-13 11:33:37,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-13 11:33:37,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:37,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:37,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 11:33:37,936 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:37,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:37,936 INFO L85 PathProgramCache]: Analyzing trace with hash -18191150, now seen corresponding path program 1 times [2022-07-13 11:33:37,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:37,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236684665] [2022-07-13 11:33:37,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:37,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:38,065 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-13 11:33:38,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:38,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236684665] [2022-07-13 11:33:38,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236684665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:38,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:38,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:33:38,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287078880] [2022-07-13 11:33:38,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:38,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:33:38,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:38,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:33:38,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:33:38,067 INFO L87 Difference]: Start difference. First operand 259 states and 349 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:38,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:38,174 INFO L93 Difference]: Finished difference Result 291 states and 389 transitions. [2022-07-13 11:33:38,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:33:38,175 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-07-13 11:33:38,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:38,176 INFO L225 Difference]: With dead ends: 291 [2022-07-13 11:33:38,176 INFO L226 Difference]: Without dead ends: 177 [2022-07-13 11:33:38,176 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-13 11:33:38,177 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 292 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:38,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 509 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 11:33:38,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-13 11:33:38,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 154. [2022-07-13 11:33:38,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 137 states have (on average 1.3211678832116789) internal successors, (181), 140 states have internal predecessors, (181), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-13 11:33:38,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 198 transitions. [2022-07-13 11:33:38,185 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 198 transitions. Word has length 52 [2022-07-13 11:33:38,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:38,186 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 198 transitions. [2022-07-13 11:33:38,186 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 11:33:38,186 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 198 transitions. [2022-07-13 11:33:38,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-13 11:33:38,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:38,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:38,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 11:33:38,187 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:38,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:38,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1854339953, now seen corresponding path program 1 times [2022-07-13 11:33:38,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:38,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096322032] [2022-07-13 11:33:38,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:38,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:38,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-13 11:33:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:38,310 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-13 11:33:38,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:38,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096322032] [2022-07-13 11:33:38,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096322032] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:38,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:38,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 11:33:38,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811198434] [2022-07-13 11:33:38,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:38,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:33:38,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:38,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:33:38,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:33:38,312 INFO L87 Difference]: Start difference. First operand 154 states and 198 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:33:39,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:39,270 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2022-07-13 11:33:39,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:33:39,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-07-13 11:33:39,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:39,271 INFO L225 Difference]: With dead ends: 168 [2022-07-13 11:33:39,271 INFO L226 Difference]: Without dead ends: 124 [2022-07-13 11:33:39,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 11:33:39,272 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 42 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:39,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 371 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 11:33:39,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-13 11:33:39,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-13 11:33:39,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 109 states have (on average 1.3027522935779816) internal successors, (142), 112 states have internal predecessors, (142), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-13 11:33:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 157 transitions. [2022-07-13 11:33:39,279 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 157 transitions. Word has length 53 [2022-07-13 11:33:39,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:39,279 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 157 transitions. [2022-07-13 11:33:39,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 11:33:39,279 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2022-07-13 11:33:39,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 11:33:39,279 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:39,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:39,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 11:33:39,279 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:39,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:39,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1084558305, now seen corresponding path program 1 times [2022-07-13 11:33:39,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:39,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702434465] [2022-07-13 11:33:39,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:39,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:39,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 11:33:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:39,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 11:33:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:39,412 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-13 11:33:39,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:39,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702434465] [2022-07-13 11:33:39,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702434465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:39,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:39,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:33:39,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854766484] [2022-07-13 11:33:39,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:39,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:33:39,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:39,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:33:39,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:33:39,414 INFO L87 Difference]: Start difference. First operand 124 states and 157 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:33:40,952 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:42,966 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:43,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:43,650 INFO L93 Difference]: Finished difference Result 173 states and 219 transitions. [2022-07-13 11:33:43,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:33:43,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2022-07-13 11:33:43,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:43,651 INFO L225 Difference]: With dead ends: 173 [2022-07-13 11:33:43,651 INFO L226 Difference]: Without dead ends: 122 [2022-07-13 11:33:43,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-13 11:33:43,651 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 31 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:43,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 361 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 83 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-07-13 11:33:43,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-13 11:33:43,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-07-13 11:33:43,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 108 states have (on average 1.287037037037037) internal successors, (139), 110 states have internal predecessors, (139), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-13 11:33:43,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2022-07-13 11:33:43,659 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 55 [2022-07-13 11:33:43,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:43,659 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2022-07-13 11:33:43,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:33:43,659 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2022-07-13 11:33:43,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 11:33:43,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:43,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:43,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 11:33:43,660 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:43,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:43,660 INFO L85 PathProgramCache]: Analyzing trace with hash -638228197, now seen corresponding path program 1 times [2022-07-13 11:33:43,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:43,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330056831] [2022-07-13 11:33:43,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:43,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:43,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 11:33:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:43,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:33:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:43,792 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-13 11:33:43,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:43,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330056831] [2022-07-13 11:33:43,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330056831] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:43,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:43,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 11:33:43,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768938827] [2022-07-13 11:33:43,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:43,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 11:33:43,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:43,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 11:33:43,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 11:33:43,796 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:33:44,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:44,509 INFO L93 Difference]: Finished difference Result 211 states and 270 transitions. [2022-07-13 11:33:44,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:33:44,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2022-07-13 11:33:44,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:44,510 INFO L225 Difference]: With dead ends: 211 [2022-07-13 11:33:44,510 INFO L226 Difference]: Without dead ends: 158 [2022-07-13 11:33:44,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:33:44,511 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 46 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:44,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 561 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 11:33:44,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-13 11:33:44,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 138. [2022-07-13 11:33:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 122 states have (on average 1.2622950819672132) internal successors, (154), 124 states have internal predecessors, (154), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-13 11:33:44,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 170 transitions. [2022-07-13 11:33:44,518 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 170 transitions. Word has length 57 [2022-07-13 11:33:44,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:44,518 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 170 transitions. [2022-07-13 11:33:44,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:33:44,518 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 170 transitions. [2022-07-13 11:33:44,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-13 11:33:44,519 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:44,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:44,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 11:33:44,519 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:44,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:44,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1799191219, now seen corresponding path program 1 times [2022-07-13 11:33:44,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:44,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295279792] [2022-07-13 11:33:44,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:44,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:44,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 11:33:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:44,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:33:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:44,629 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-13 11:33:44,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:44,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295279792] [2022-07-13 11:33:44,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295279792] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:44,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:44,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:33:44,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263122466] [2022-07-13 11:33:44,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:44,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:33:44,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:44,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:33:44,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:33:44,630 INFO L87 Difference]: Start difference. First operand 138 states and 170 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:33:46,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:46,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:46,715 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-07-13 11:33:46,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:33:46,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2022-07-13 11:33:46,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:46,716 INFO L225 Difference]: With dead ends: 164 [2022-07-13 11:33:46,716 INFO L226 Difference]: Without dead ends: 161 [2022-07-13 11:33:46,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:33:46,717 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 31 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:46,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 307 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 55 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-13 11:33:46,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-13 11:33:46,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 142. [2022-07-13 11:33:46,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 126 states have (on average 1.2698412698412698) internal successors, (160), 128 states have internal predecessors, (160), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-13 11:33:46,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 176 transitions. [2022-07-13 11:33:46,725 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 176 transitions. Word has length 58 [2022-07-13 11:33:46,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:46,726 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 176 transitions. [2022-07-13 11:33:46,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:33:46,726 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 176 transitions. [2022-07-13 11:33:46,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 11:33:46,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:46,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:46,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 11:33:46,726 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:46,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:46,727 INFO L85 PathProgramCache]: Analyzing trace with hash 297674658, now seen corresponding path program 1 times [2022-07-13 11:33:46,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:46,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175078176] [2022-07-13 11:33:46,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:46,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:46,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 11:33:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:46,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:33:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:46,854 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-13 11:33:46,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:46,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175078176] [2022-07-13 11:33:46,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175078176] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:46,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:46,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:33:46,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879807188] [2022-07-13 11:33:46,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:46,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:33:46,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:46,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:33:46,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:33:46,856 INFO L87 Difference]: Start difference. First operand 142 states and 176 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:33:48,866 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:49,846 INFO L93 Difference]: Finished difference Result 280 states and 346 transitions. [2022-07-13 11:33:49,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 11:33:49,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2022-07-13 11:33:49,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:49,847 INFO L225 Difference]: With dead ends: 280 [2022-07-13 11:33:49,847 INFO L226 Difference]: Without dead ends: 253 [2022-07-13 11:33:49,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-13 11:33:49,848 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 62 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:49,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 379 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-07-13 11:33:49,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-07-13 11:33:49,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2022-07-13 11:33:49,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 223 states have (on average 1.2825112107623318) internal successors, (286), 225 states have internal predecessors, (286), 11 states have call successors, (11), 9 states have call predecessors, (11), 13 states have return successors, (14), 13 states have call predecessors, (14), 8 states have call successors, (14) [2022-07-13 11:33:49,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 311 transitions. [2022-07-13 11:33:49,861 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 311 transitions. Word has length 60 [2022-07-13 11:33:49,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:49,862 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 311 transitions. [2022-07-13 11:33:49,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:33:49,862 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 311 transitions. [2022-07-13 11:33:49,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-13 11:33:49,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:49,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:49,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 11:33:49,863 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:49,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:49,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2072682020, now seen corresponding path program 1 times [2022-07-13 11:33:49,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:49,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819335039] [2022-07-13 11:33:49,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:49,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:50,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 11:33:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:50,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:33:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:50,228 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-13 11:33:50,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:50,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819335039] [2022-07-13 11:33:50,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819335039] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:50,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:50,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 11:33:50,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706650532] [2022-07-13 11:33:50,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:50,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:33:50,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:50,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:33:50,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:33:50,230 INFO L87 Difference]: Start difference. First operand 248 states and 311 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:33:51,416 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:52,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:52,028 INFO L93 Difference]: Finished difference Result 476 states and 599 transitions. [2022-07-13 11:33:52,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:33:52,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2022-07-13 11:33:52,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:52,030 INFO L225 Difference]: With dead ends: 476 [2022-07-13 11:33:52,030 INFO L226 Difference]: Without dead ends: 250 [2022-07-13 11:33:52,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 11:33:52,030 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 7 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:52,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 378 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-13 11:33:52,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-07-13 11:33:52,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2022-07-13 11:33:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 225 states have (on average 1.28) internal successors, (288), 227 states have internal predecessors, (288), 11 states have call successors, (11), 9 states have call predecessors, (11), 13 states have return successors, (14), 13 states have call predecessors, (14), 8 states have call successors, (14) [2022-07-13 11:33:52,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 313 transitions. [2022-07-13 11:33:52,043 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 313 transitions. Word has length 60 [2022-07-13 11:33:52,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:52,043 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 313 transitions. [2022-07-13 11:33:52,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 11:33:52,043 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 313 transitions. [2022-07-13 11:33:52,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-13 11:33:52,044 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:52,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:52,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 11:33:52,044 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:52,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:52,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1685978785, now seen corresponding path program 1 times [2022-07-13 11:33:52,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:52,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709966844] [2022-07-13 11:33:52,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:52,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:52,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 11:33:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:52,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:33:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:52,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:33:52,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:52,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709966844] [2022-07-13 11:33:52,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709966844] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:33:52,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711316339] [2022-07-13 11:33:52,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:52,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:33:52,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:33:52,642 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-13 11:33:52,659 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-13 11:33:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:53,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 1359 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 11:33:53,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:33:53,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:33:53,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:33:53,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711316339] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:53,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:33:53,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-07-13 11:33:53,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585577394] [2022-07-13 11:33:53,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:53,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 11:33:53,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:53,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 11:33:53,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:33:53,382 INFO L87 Difference]: Start difference. First operand 250 states and 313 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:33:53,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:53,437 INFO L93 Difference]: Finished difference Result 336 states and 423 transitions. [2022-07-13 11:33:53,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 11:33:53,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2022-07-13 11:33:53,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:53,438 INFO L225 Difference]: With dead ends: 336 [2022-07-13 11:33:53,438 INFO L226 Difference]: Without dead ends: 236 [2022-07-13 11:33:53,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:33:53,439 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 15 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:53,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 436 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:33:53,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-13 11:33:53,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2022-07-13 11:33:53,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 211 states have (on average 1.2701421800947867) internal successors, (268), 213 states have internal predecessors, (268), 11 states have call successors, (11), 9 states have call predecessors, (11), 13 states have return successors, (14), 13 states have call predecessors, (14), 8 states have call successors, (14) [2022-07-13 11:33:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 293 transitions. [2022-07-13 11:33:53,459 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 293 transitions. Word has length 61 [2022-07-13 11:33:53,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:53,460 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 293 transitions. [2022-07-13 11:33:53,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 11:33:53,460 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 293 transitions. [2022-07-13 11:33:53,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-13 11:33:53,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:53,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:53,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 11:33:53,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-13 11:33:53,675 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:53,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:53,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1919232474, now seen corresponding path program 1 times [2022-07-13 11:33:53,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:53,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757261757] [2022-07-13 11:33:53,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:53,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:53,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 11:33:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:53,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:33:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:53,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:33:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:33:53,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:53,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757261757] [2022-07-13 11:33:53,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757261757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:53,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:53,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 11:33:53,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229723132] [2022-07-13 11:33:53,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:53,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:33:53,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:53,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:33:53,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:33:53,897 INFO L87 Difference]: Start difference. First operand 236 states and 293 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:33:55,912 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:57,599 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:59,609 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:33:59,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:33:59,759 INFO L93 Difference]: Finished difference Result 310 states and 391 transitions. [2022-07-13 11:33:59,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:33:59,760 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-07-13 11:33:59,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:33:59,760 INFO L225 Difference]: With dead ends: 310 [2022-07-13 11:33:59,761 INFO L226 Difference]: Without dead ends: 224 [2022-07-13 11:33:59,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:33:59,761 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 98 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 29 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-13 11:33:59,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 475 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 157 Invalid, 2 Unknown, 0 Unchecked, 5.8s Time] [2022-07-13 11:33:59,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-13 11:33:59,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2022-07-13 11:33:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 201 states have (on average 1.263681592039801) internal successors, (254), 203 states have internal predecessors, (254), 11 states have call successors, (11), 9 states have call predecessors, (11), 11 states have return successors, (12), 11 states have call predecessors, (12), 8 states have call successors, (12) [2022-07-13 11:33:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 277 transitions. [2022-07-13 11:33:59,776 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 277 transitions. Word has length 65 [2022-07-13 11:33:59,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:33:59,776 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 277 transitions. [2022-07-13 11:33:59,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:33:59,777 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 277 transitions. [2022-07-13 11:33:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 11:33:59,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:33:59,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:33:59,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-13 11:33:59,778 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:33:59,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:33:59,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1018080202, now seen corresponding path program 1 times [2022-07-13 11:33:59,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:33:59,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89691299] [2022-07-13 11:33:59,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:33:59,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:33:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:59,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 11:33:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:59,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:33:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:59,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:33:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:33:59,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:33:59,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:33:59,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89691299] [2022-07-13 11:33:59,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89691299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:33:59,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:33:59,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 11:33:59,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690475283] [2022-07-13 11:33:59,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:33:59,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:33:59,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:33:59,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:33:59,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:33:59,952 INFO L87 Difference]: Start difference. First operand 224 states and 277 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:34:01,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:03,134 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:05,014 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:05,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:05,181 INFO L93 Difference]: Finished difference Result 287 states and 351 transitions. [2022-07-13 11:34:05,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:34:05,181 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 67 [2022-07-13 11:34:05,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:05,182 INFO L225 Difference]: With dead ends: 287 [2022-07-13 11:34:05,182 INFO L226 Difference]: Without dead ends: 260 [2022-07-13 11:34:05,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:34:05,183 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 47 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:05,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 830 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-13 11:34:05,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-13 11:34:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 240. [2022-07-13 11:34:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 215 states have (on average 1.255813953488372) internal successors, (270), 217 states have internal predecessors, (270), 11 states have call successors, (11), 9 states have call predecessors, (11), 13 states have return successors, (14), 13 states have call predecessors, (14), 8 states have call successors, (14) [2022-07-13 11:34:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 295 transitions. [2022-07-13 11:34:05,196 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 295 transitions. Word has length 67 [2022-07-13 11:34:05,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:05,196 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 295 transitions. [2022-07-13 11:34:05,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:34:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 295 transitions. [2022-07-13 11:34:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-13 11:34:05,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:05,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:34:05,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-13 11:34:05,197 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:05,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:05,198 INFO L85 PathProgramCache]: Analyzing trace with hash 555821410, now seen corresponding path program 1 times [2022-07-13 11:34:05,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:05,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208669351] [2022-07-13 11:34:05,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:05,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:05,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 11:34:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:05,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:34:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:05,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:34:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:34:05,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:05,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208669351] [2022-07-13 11:34:05,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208669351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:05,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:05,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:34:05,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87819506] [2022-07-13 11:34:05,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:05,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:34:05,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:05,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:34:05,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:34:05,337 INFO L87 Difference]: Start difference. First operand 240 states and 295 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:34:07,345 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:08,606 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:09,882 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-13 11:34:11,894 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:11,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:11,995 INFO L93 Difference]: Finished difference Result 325 states and 391 transitions. [2022-07-13 11:34:11,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 11:34:11,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2022-07-13 11:34:11,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:11,996 INFO L225 Difference]: With dead ends: 325 [2022-07-13 11:34:11,996 INFO L226 Difference]: Without dead ends: 265 [2022-07-13 11:34:11,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:34:11,997 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 56 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 17 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:11,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 418 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 86 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-07-13 11:34:11,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-07-13 11:34:12,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2022-07-13 11:34:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 221 states have (on average 1.2081447963800904) internal successors, (267), 223 states have internal predecessors, (267), 11 states have call successors, (11), 10 states have call predecessors, (11), 14 states have return successors, (15), 13 states have call predecessors, (15), 9 states have call successors, (15) [2022-07-13 11:34:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 293 transitions. [2022-07-13 11:34:12,011 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 293 transitions. Word has length 66 [2022-07-13 11:34:12,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:12,011 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 293 transitions. [2022-07-13 11:34:12,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 3 states have internal predecessors, (59), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 11:34:12,012 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 293 transitions. [2022-07-13 11:34:12,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-13 11:34:12,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:12,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 11:34:12,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-13 11:34:12,013 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:12,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:12,013 INFO L85 PathProgramCache]: Analyzing trace with hash -118230121, now seen corresponding path program 1 times [2022-07-13 11:34:12,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:12,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744066815] [2022-07-13 11:34:12,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:12,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:12,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 11:34:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:12,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:34:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:12,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:34:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:12,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:34:12,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:12,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744066815] [2022-07-13 11:34:12,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744066815] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:12,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:12,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 11:34:12,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161548997] [2022-07-13 11:34:12,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:12,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 11:34:12,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:12,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 11:34:12,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 11:34:12,213 INFO L87 Difference]: Start difference. First operand 247 states and 293 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:34:13,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:15,322 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:16,399 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:16,562 INFO L93 Difference]: Finished difference Result 336 states and 398 transitions. [2022-07-13 11:34:16,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 11:34:16,562 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 68 [2022-07-13 11:34:16,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:16,563 INFO L225 Difference]: With dead ends: 336 [2022-07-13 11:34:16,563 INFO L226 Difference]: Without dead ends: 257 [2022-07-13 11:34:16,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:34:16,564 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 44 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:16,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 815 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 206 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-07-13 11:34:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-07-13 11:34:16,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 237. [2022-07-13 11:34:16,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 213 states have (on average 1.187793427230047) internal successors, (253), 215 states have internal predecessors, (253), 11 states have call successors, (11), 10 states have call predecessors, (11), 12 states have return successors, (13), 11 states have call predecessors, (13), 9 states have call successors, (13) [2022-07-13 11:34:16,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 277 transitions. [2022-07-13 11:34:16,578 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 277 transitions. Word has length 68 [2022-07-13 11:34:16,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:16,578 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 277 transitions. [2022-07-13 11:34:16,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:34:16,579 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 277 transitions. [2022-07-13 11:34:16,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-13 11:34:16,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:16,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:34:16,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-13 11:34:16,580 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:16,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:16,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1748301759, now seen corresponding path program 1 times [2022-07-13 11:34:16,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:16,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588112940] [2022-07-13 11:34:16,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:16,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:16,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 11:34:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:16,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:34:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:16,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:34:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:34:16,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:16,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588112940] [2022-07-13 11:34:16,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588112940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:16,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:16,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 11:34:16,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376192373] [2022-07-13 11:34:16,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:16,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 11:34:16,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:16,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 11:34:16,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:34:16,714 INFO L87 Difference]: Start difference. First operand 237 states and 277 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:34:18,721 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:20,818 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:20,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:20,914 INFO L93 Difference]: Finished difference Result 271 states and 314 transitions. [2022-07-13 11:34:20,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 11:34:20,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 74 [2022-07-13 11:34:20,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:20,915 INFO L225 Difference]: With dead ends: 271 [2022-07-13 11:34:20,915 INFO L226 Difference]: Without dead ends: 216 [2022-07-13 11:34:20,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 11:34:20,916 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 20 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:20,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 349 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 71 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-07-13 11:34:20,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-13 11:34:20,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 198. [2022-07-13 11:34:20,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 178 states have (on average 1.1629213483146068) internal successors, (207), 178 states have internal predecessors, (207), 8 states have call successors, (8), 8 states have call predecessors, (8), 11 states have return successors, (11), 11 states have call predecessors, (11), 7 states have call successors, (11) [2022-07-13 11:34:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 226 transitions. [2022-07-13 11:34:20,927 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 226 transitions. Word has length 74 [2022-07-13 11:34:20,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:20,927 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 226 transitions. [2022-07-13 11:34:20,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-13 11:34:20,927 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 226 transitions. [2022-07-13 11:34:20,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-13 11:34:20,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:20,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:34:20,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-13 11:34:20,929 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:20,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:20,929 INFO L85 PathProgramCache]: Analyzing trace with hash -452450229, now seen corresponding path program 1 times [2022-07-13 11:34:20,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:20,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273098586] [2022-07-13 11:34:20,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:20,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:21,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 11:34:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:21,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:34:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:21,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:34:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:21,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 11:34:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:21,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:34:21,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:21,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273098586] [2022-07-13 11:34:21,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273098586] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:21,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 11:34:21,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 11:34:21,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428336186] [2022-07-13 11:34:21,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:21,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 11:34:21,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:21,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 11:34:21,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:34:21,109 INFO L87 Difference]: Start difference. First operand 198 states and 226 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:34:23,116 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:26,025 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:26,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:26,204 INFO L93 Difference]: Finished difference Result 220 states and 250 transitions. [2022-07-13 11:34:26,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 11:34:26,205 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 82 [2022-07-13 11:34:26,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:26,206 INFO L225 Difference]: With dead ends: 220 [2022-07-13 11:34:26,206 INFO L226 Difference]: Without dead ends: 178 [2022-07-13 11:34:26,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-13 11:34:26,206 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 59 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 19 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:26,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 739 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 214 Invalid, 2 Unknown, 0 Unchecked, 5.1s Time] [2022-07-13 11:34:26,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-13 11:34:26,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-07-13 11:34:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 160 states have (on average 1.14375) internal successors, (183), 160 states have internal predecessors, (183), 8 states have call successors, (8), 8 states have call predecessors, (8), 9 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-13 11:34:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 200 transitions. [2022-07-13 11:34:26,218 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 200 transitions. Word has length 82 [2022-07-13 11:34:26,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:26,218 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 200 transitions. [2022-07-13 11:34:26,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:34:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 200 transitions. [2022-07-13 11:34:26,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-13 11:34:26,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:26,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:34:26,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-13 11:34:26,220 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:26,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:26,220 INFO L85 PathProgramCache]: Analyzing trace with hash -447625103, now seen corresponding path program 1 times [2022-07-13 11:34:26,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:26,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315509356] [2022-07-13 11:34:26,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:26,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:26,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 11:34:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:26,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:34:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:26,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:34:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:26,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 11:34:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:34:26,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:26,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315509356] [2022-07-13 11:34:26,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315509356] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:34:26,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427623180] [2022-07-13 11:34:26,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:26,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:34:26,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:34:26,626 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:34:26,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 11:34:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:27,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 1447 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 11:34:27,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:34:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:34:27,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:34:27,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:34:27,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427623180] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:34:27,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:34:27,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2022-07-13 11:34:27,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571220224] [2022-07-13 11:34:27,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:34:27,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 11:34:27,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:27,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 11:34:27,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-13 11:34:27,677 INFO L87 Difference]: Start difference. First operand 178 states and 200 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 7 states have internal predecessors, (108), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 11:34:29,685 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:31,699 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:32,910 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:33,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:33,060 INFO L93 Difference]: Finished difference Result 338 states and 383 transitions. [2022-07-13 11:34:33,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 11:34:33,061 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 7 states have internal predecessors, (108), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 88 [2022-07-13 11:34:33,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:33,061 INFO L225 Difference]: With dead ends: 338 [2022-07-13 11:34:33,061 INFO L226 Difference]: Without dead ends: 184 [2022-07-13 11:34:33,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:34:33,062 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 66 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:33,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 530 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 118 Invalid, 2 Unknown, 0 Unchecked, 5.3s Time] [2022-07-13 11:34:33,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-13 11:34:33,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2022-07-13 11:34:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 8 states have call successors, (8), 8 states have call predecessors, (8), 9 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-13 11:34:33,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2022-07-13 11:34:33,076 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 88 [2022-07-13 11:34:33,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:33,077 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2022-07-13 11:34:33,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 7 states have internal predecessors, (108), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 11:34:33,099 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2022-07-13 11:34:33,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-13 11:34:33,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:33,100 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:34:33,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 11:34:33,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-13 11:34:33,323 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:33,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:33,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1753567182, now seen corresponding path program 2 times [2022-07-13 11:34:33,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:33,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747113430] [2022-07-13 11:34:33,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:33,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:33,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-13 11:34:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:33,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:34:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:33,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:34:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:33,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 11:34:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 11:34:33,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:33,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747113430] [2022-07-13 11:34:33,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747113430] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:34:33,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589815305] [2022-07-13 11:34:33,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:34:33,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:34:33,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:34:33,795 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:34:33,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 11:34:34,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 11:34:34,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 11:34:35,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 11:34:35,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:34:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:34:35,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 11:34:35,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589815305] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 11:34:35,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 11:34:35,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-13 11:34:35,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323228404] [2022-07-13 11:34:35,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:35,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 11:34:35,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:35,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 11:34:35,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:34:35,044 INFO L87 Difference]: Start difference. First operand 184 states and 206 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:34:35,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:35,086 INFO L93 Difference]: Finished difference Result 308 states and 345 transitions. [2022-07-13 11:34:35,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 11:34:35,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 91 [2022-07-13 11:34:35,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:35,087 INFO L225 Difference]: With dead ends: 308 [2022-07-13 11:34:35,087 INFO L226 Difference]: Without dead ends: 186 [2022-07-13 11:34:35,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-13 11:34:35,089 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:35,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:34:35,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-13 11:34:35,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-07-13 11:34:35,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 168 states have (on average 1.1369047619047619) internal successors, (191), 168 states have internal predecessors, (191), 8 states have call successors, (8), 8 states have call predecessors, (8), 9 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-13 11:34:35,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2022-07-13 11:34:35,103 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 91 [2022-07-13 11:34:35,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:35,103 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2022-07-13 11:34:35,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-13 11:34:35,103 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2022-07-13 11:34:35,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-13 11:34:35,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:35,104 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:34:35,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 11:34:35,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:34:35,327 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:35,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:35,328 INFO L85 PathProgramCache]: Analyzing trace with hash -463830121, now seen corresponding path program 1 times [2022-07-13 11:34:35,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:35,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927452903] [2022-07-13 11:34:35,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:35,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:35,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 11:34:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:35,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:34:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:35,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:34:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:35,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 11:34:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 11:34:35,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:35,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927452903] [2022-07-13 11:34:35,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927452903] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:34:35,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865050266] [2022-07-13 11:34:35,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:35,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:34:35,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:34:35,736 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:34:35,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 11:34:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:36,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 1561 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 11:34:36,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:34:36,625 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:34:36,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:34:36,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-13 11:34:36,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865050266] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 11:34:36,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 11:34:36,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 5] total 14 [2022-07-13 11:34:36,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966920724] [2022-07-13 11:34:36,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 11:34:36,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 11:34:36,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:36,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 11:34:36,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:34:36,681 INFO L87 Difference]: Start difference. First operand 186 states and 208 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:34:36,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:36,718 INFO L93 Difference]: Finished difference Result 308 states and 343 transitions. [2022-07-13 11:34:36,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 11:34:36,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 92 [2022-07-13 11:34:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:36,719 INFO L225 Difference]: With dead ends: 308 [2022-07-13 11:34:36,720 INFO L226 Difference]: Without dead ends: 188 [2022-07-13 11:34:36,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-13 11:34:36,720 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 38 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:36,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 201 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 11:34:36,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-13 11:34:36,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-07-13 11:34:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 170 states have (on average 1.1352941176470588) internal successors, (193), 170 states have internal predecessors, (193), 8 states have call successors, (8), 8 states have call predecessors, (8), 9 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-13 11:34:36,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2022-07-13 11:34:36,735 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 92 [2022-07-13 11:34:36,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:36,735 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2022-07-13 11:34:36,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-13 11:34:36,736 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2022-07-13 11:34:36,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-13 11:34:36,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:36,736 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:34:36,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 11:34:36,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:34:36,955 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:36,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:36,956 INFO L85 PathProgramCache]: Analyzing trace with hash 839553712, now seen corresponding path program 1 times [2022-07-13 11:34:36,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:36,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684691337] [2022-07-13 11:34:36,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:36,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:37,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-13 11:34:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:37,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:34:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:37,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:34:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:37,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 11:34:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:34:37,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:37,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684691337] [2022-07-13 11:34:37,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684691337] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:34:37,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799354933] [2022-07-13 11:34:37,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:37,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:34:37,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:34:37,480 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:34:37,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 11:34:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:38,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 1580 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 11:34:38,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 11:34:38,702 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:34:38,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 11:34:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:34:38,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799354933] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 11:34:38,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 11:34:38,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 19 [2022-07-13 11:34:38,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371910450] [2022-07-13 11:34:38,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 11:34:38,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 11:34:38,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 11:34:38,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 11:34:38,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2022-07-13 11:34:38,858 INFO L87 Difference]: Start difference. First operand 188 states and 210 transitions. Second operand has 19 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 16 states have internal predecessors, (119), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 11:34:40,014 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:42,027 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 11:34:43,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 11:34:43,037 INFO L93 Difference]: Finished difference Result 358 states and 409 transitions. [2022-07-13 11:34:43,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 11:34:43,038 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 16 states have internal predecessors, (119), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2022-07-13 11:34:43,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 11:34:43,038 INFO L225 Difference]: With dead ends: 358 [2022-07-13 11:34:43,038 INFO L226 Difference]: Without dead ends: 200 [2022-07-13 11:34:43,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2022-07-13 11:34:43,039 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 70 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-13 11:34:43,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 823 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 189 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-07-13 11:34:43,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-13 11:34:43,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-07-13 11:34:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 182 states have (on average 1.1263736263736264) internal successors, (205), 182 states have internal predecessors, (205), 8 states have call successors, (8), 8 states have call predecessors, (8), 9 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-13 11:34:43,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2022-07-13 11:34:43,054 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 93 [2022-07-13 11:34:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 11:34:43,054 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2022-07-13 11:34:43,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 16 states have internal predecessors, (119), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-13 11:34:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2022-07-13 11:34:43,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-13 11:34:43,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 11:34:43,055 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 11:34:43,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 11:34:43,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-13 11:34:43,271 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 11:34:43,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 11:34:43,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1195309008, now seen corresponding path program 2 times [2022-07-13 11:34:43,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 11:34:43,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54039134] [2022-07-13 11:34:43,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 11:34:43,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 11:34:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:43,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 11:34:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:43,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 11:34:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:43,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 11:34:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:43,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 11:34:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 11:34:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 11:34:43,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 11:34:43,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54039134] [2022-07-13 11:34:43,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54039134] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 11:34:43,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480383061] [2022-07-13 11:34:43,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 11:34:43,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 11:34:43,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 11:34:43,774 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 11:34:43,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process