./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 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-6c24879 [2022-07-11 23:47:28,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:47:28,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:47:28,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:47:28,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:47:28,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:47:28,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:47:28,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:47:28,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:47:28,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:47:28,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:47:28,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:47:28,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:47:28,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:47:28,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:47:28,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:47:28,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:47:28,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:47:28,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:47:28,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:47:28,926 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:47:28,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:47:28,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:47:28,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:47:28,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:47:28,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:47:28,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:47:28,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:47:28,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:47:28,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:47:28,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:47:28,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:47:28,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:47:28,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:47:28,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:47:28,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:47:28,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:47:28,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:47:28,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:47:28,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:47:28,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:47:28,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:47:28,942 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:47:28,957 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:47:28,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:47:28,958 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:47:28,958 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:47:28,958 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:47:28,958 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:47:28,959 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:47:28,959 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:47:28,959 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:47:28,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:47:28,959 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:47:28,959 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:47:28,959 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:47:28,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:47:28,960 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:47:28,960 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:47:28,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:47:28,960 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:47:28,960 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:47:28,960 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:47:28,961 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:47:28,961 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:47:28,961 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:47:28,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:47:28,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:47:28,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:47:28,962 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:47:28,962 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:47:28,962 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:47:28,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:47:28,962 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:47:28,962 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:47:28,962 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:47:28,963 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-11 23:47:29,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:47:29,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:47:29,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:47:29,171 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:47:29,171 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:47:29,172 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-11 23:47:29,227 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81495ba90/aa38e7db6b264fdeac02837944e8c9a9/FLAGca92dd248 [2022-07-11 23:47:29,724 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:47:29,725 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c [2022-07-11 23:47:29,751 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81495ba90/aa38e7db6b264fdeac02837944e8c9a9/FLAGca92dd248 [2022-07-11 23:47:30,247 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81495ba90/aa38e7db6b264fdeac02837944e8c9a9 [2022-07-11 23:47:30,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:47:30,251 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:47:30,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:47:30,253 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:47:30,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:47:30,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:47:30" (1/1) ... [2022-07-11 23:47:30,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b02e36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:30, skipping insertion in model container [2022-07-11 23:47:30,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:47:30" (1/1) ... [2022-07-11 23:47:30,261 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:47:30,313 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:47:30,592 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-11 23:47:30,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:47:30,729 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:47:30,783 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-11 23:47:30,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:47:30,904 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:47:30,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:30 WrapperNode [2022-07-11 23:47:30,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:47:30,908 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:47:30,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:47:30,908 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:47:30,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:30" (1/1) ... [2022-07-11 23:47:30,951 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:30" (1/1) ... [2022-07-11 23:47:31,005 INFO L137 Inliner]: procedures = 109, calls = 328, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 1084 [2022-07-11 23:47:31,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:47:31,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:47:31,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:47:31,006 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:47:31,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:30" (1/1) ... [2022-07-11 23:47:31,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:30" (1/1) ... [2022-07-11 23:47:31,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:30" (1/1) ... [2022-07-11 23:47:31,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:30" (1/1) ... [2022-07-11 23:47:31,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:30" (1/1) ... [2022-07-11 23:47:31,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:30" (1/1) ... [2022-07-11 23:47:31,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:30" (1/1) ... [2022-07-11 23:47:31,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:47:31,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:47:31,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:47:31,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:47:31,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:30" (1/1) ... [2022-07-11 23:47:31,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:47:31,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:47:31,160 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-11 23:47:31,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-11 23:47:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-07-11 23:47:31,210 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-07-11 23:47:31,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-11 23:47:31,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-11 23:47:31,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-11 23:47:31,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:47:31,211 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-11 23:47:31,211 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-11 23:47:31,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:47:31,211 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-11 23:47:31,212 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-11 23:47:31,212 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-11 23:47:31,212 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-11 23:47:31,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:47:31,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:47:31,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 23:47:31,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-11 23:47:31,212 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-11 23:47:31,213 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-11 23:47:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-07-11 23:47:31,213 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-07-11 23:47:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-11 23:47:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 23:47:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:47:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-11 23:47:31,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:47:31,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:47:31,214 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-07-11 23:47:31,214 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-07-11 23:47:31,495 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:47:31,499 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:47:31,545 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:31,567 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-07-11 23:47:31,568 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-07-11 23:47:31,623 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:31,626 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:31,628 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:31,631 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:31,632 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:31,634 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:31,635 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:33,685 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##83: assume false; [2022-07-11 23:47:33,685 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume !false; [2022-07-11 23:47:33,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##36: assume !false; [2022-07-11 23:47:33,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume false; [2022-07-11 23:47:33,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##139: assume false; [2022-07-11 23:47:33,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume !false; [2022-07-11 23:47:33,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2022-07-11 23:47:33,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2022-07-11 23:47:33,686 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2022-07-11 23:47:33,687 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume !false; [2022-07-11 23:47:33,687 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2022-07-11 23:47:33,687 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##156: assume false; [2022-07-11 23:47:33,687 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##114: assume !false; [2022-07-11 23:47:33,687 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume false; [2022-07-11 23:47:33,702 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:47:33,710 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:47:33,710 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-11 23:47:33,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:47:33 BoogieIcfgContainer [2022-07-11 23:47:33,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:47:33,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:47:33,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:47:33,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:47:33,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:47:30" (1/3) ... [2022-07-11 23:47:33,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e1e0c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:47:33, skipping insertion in model container [2022-07-11 23:47:33,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:30" (2/3) ... [2022-07-11 23:47:33,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e1e0c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:47:33, skipping insertion in model container [2022-07-11 23:47:33,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:47:33" (3/3) ... [2022-07-11 23:47:33,721 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr.i.cil-2.c [2022-07-11 23:47:33,733 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:47:33,733 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:47:33,785 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:47:33,799 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@64c8fc4a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@37f3370d [2022-07-11 23:47:33,799 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:47:33,803 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-11 23:47:33,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-11 23:47:33,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:33,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:47:33,813 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:33,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:33,818 INFO L85 PathProgramCache]: Analyzing trace with hash -660511979, now seen corresponding path program 1 times [2022-07-11 23:47:33,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:33,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046352772] [2022-07-11 23:47:33,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:33,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:34,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:47:34,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:34,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046352772] [2022-07-11 23:47:34,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046352772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:34,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:34,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:47:34,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148153872] [2022-07-11 23:47:34,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:34,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 23:47:34,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:34,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 23:47:34,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:47:34,191 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-11 23:47:34,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:34,226 INFO L93 Difference]: Finished difference Result 472 states and 755 transitions. [2022-07-11 23:47:34,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 23:47:34,227 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-11 23:47:34,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:34,234 INFO L225 Difference]: With dead ends: 472 [2022-07-11 23:47:34,235 INFO L226 Difference]: Without dead ends: 231 [2022-07-11 23:47:34,238 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-11 23:47:34,240 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-11 23:47:34,241 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-11 23:47:34,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-11 23:47:34,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2022-07-11 23:47:34,277 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-11 23:47:34,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 339 transitions. [2022-07-11 23:47:34,281 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 339 transitions. Word has length 16 [2022-07-11 23:47:34,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:34,282 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 339 transitions. [2022-07-11 23:47:34,282 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-11 23:47:34,282 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 339 transitions. [2022-07-11 23:47:34,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-11 23:47:34,283 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:34,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:47:34,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:47:34,288 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:34,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:34,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1247317993, now seen corresponding path program 1 times [2022-07-11 23:47:34,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:34,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425465418] [2022-07-11 23:47:34,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:34,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:34,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:47:34,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:34,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425465418] [2022-07-11 23:47:34,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425465418] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:34,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:34,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:47:34,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006752398] [2022-07-11 23:47:34,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:34,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:47:34,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:34,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:47:34,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:47:34,435 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-11 23:47:35,733 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:47:35,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:35,825 INFO L93 Difference]: Finished difference Result 248 states and 360 transitions. [2022-07-11 23:47:35,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:47:35,826 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-11 23:47:35,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:35,828 INFO L225 Difference]: With dead ends: 248 [2022-07-11 23:47:35,830 INFO L226 Difference]: Without dead ends: 231 [2022-07-11 23:47:35,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:47:35,832 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 249 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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-11 23:47:35,833 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-11 23:47:35,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-11 23:47:35,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2022-07-11 23:47:35,849 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-11 23:47:35,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 338 transitions. [2022-07-11 23:47:35,853 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 338 transitions. Word has length 16 [2022-07-11 23:47:35,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:35,853 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 338 transitions. [2022-07-11 23:47:35,853 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-11 23:47:35,853 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 338 transitions. [2022-07-11 23:47:35,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-11 23:47:35,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:35,855 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-11 23:47:35,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:47:35,855 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:35,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:35,855 INFO L85 PathProgramCache]: Analyzing trace with hash 8900389, now seen corresponding path program 1 times [2022-07-11 23:47:35,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:35,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292691873] [2022-07-11 23:47:35,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:35,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:47:36,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:36,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292691873] [2022-07-11 23:47:36,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292691873] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:36,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:36,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:47:36,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806296539] [2022-07-11 23:47:36,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:36,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:47:36,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:36,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:47:36,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:47:36,011 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-11 23:47:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:36,295 INFO L93 Difference]: Finished difference Result 603 states and 904 transitions. [2022-07-11 23:47:36,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:47:36,297 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-11 23:47:36,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:36,299 INFO L225 Difference]: With dead ends: 603 [2022-07-11 23:47:36,299 INFO L226 Difference]: Without dead ends: 392 [2022-07-11 23:47:36,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:47:36,300 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.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:36,300 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.3s Time] [2022-07-11 23:47:36,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-07-11 23:47:36,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 233. [2022-07-11 23:47:36,313 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-11 23:47:36,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 340 transitions. [2022-07-11 23:47:36,314 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 340 transitions. Word has length 28 [2022-07-11 23:47:36,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:36,315 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 340 transitions. [2022-07-11 23:47:36,315 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-11 23:47:36,315 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 340 transitions. [2022-07-11 23:47:36,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-11 23:47:36,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:36,316 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-11 23:47:36,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:47:36,316 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:36,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:36,316 INFO L85 PathProgramCache]: Analyzing trace with hash 620779237, now seen corresponding path program 1 times [2022-07-11 23:47:36,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:36,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182529278] [2022-07-11 23:47:36,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:36,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:36,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:47:36,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:36,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182529278] [2022-07-11 23:47:36,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182529278] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:36,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:36,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:47:36,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396091430] [2022-07-11 23:47:36,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:36,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:47:36,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:36,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:47:36,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:47:36,436 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-11 23:47:37,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:37,388 INFO L93 Difference]: Finished difference Result 354 states and 506 transitions. [2022-07-11 23:47:37,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:47:37,389 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-11 23:47:37,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:37,391 INFO L225 Difference]: With dead ends: 354 [2022-07-11 23:47:37,392 INFO L226 Difference]: Without dead ends: 299 [2022-07-11 23:47:37,393 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-11 23:47:37,394 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-11 23:47:37,395 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-11 23:47:37,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-11 23:47:37,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 283. [2022-07-11 23:47:37,419 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-11 23:47:37,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 405 transitions. [2022-07-11 23:47:37,421 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 405 transitions. Word has length 28 [2022-07-11 23:47:37,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:37,422 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 405 transitions. [2022-07-11 23:47:37,422 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-11 23:47:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 405 transitions. [2022-07-11 23:47:37,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-11 23:47:37,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:37,429 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-11 23:47:37,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:47:37,430 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:37,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:37,430 INFO L85 PathProgramCache]: Analyzing trace with hash -451775854, now seen corresponding path program 1 times [2022-07-11 23:47:37,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:37,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350316340] [2022-07-11 23:47:37,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:37,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:37,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:47:37,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:37,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350316340] [2022-07-11 23:47:37,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350316340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:37,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:37,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:47:37,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346730336] [2022-07-11 23:47:37,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:37,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:47:37,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:37,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:47:37,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:47:37,539 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-11 23:47:37,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:37,562 INFO L93 Difference]: Finished difference Result 439 states and 613 transitions. [2022-07-11 23:47:37,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:47:37,563 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-11 23:47:37,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:37,564 INFO L225 Difference]: With dead ends: 439 [2022-07-11 23:47:37,565 INFO L226 Difference]: Without dead ends: 340 [2022-07-11 23:47:37,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:47:37,566 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-11 23:47:37,566 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-11 23:47:37,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-07-11 23:47:37,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 317. [2022-07-11 23:47:37,576 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-11 23:47:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 450 transitions. [2022-07-11 23:47:37,578 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 450 transitions. Word has length 30 [2022-07-11 23:47:37,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:37,578 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 450 transitions. [2022-07-11 23:47:37,578 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-11 23:47:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 450 transitions. [2022-07-11 23:47:37,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-11 23:47:37,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:37,579 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-11 23:47:37,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:47:37,580 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:37,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:37,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1294247663, now seen corresponding path program 1 times [2022-07-11 23:47:37,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:37,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491730723] [2022-07-11 23:47:37,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:37,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:37,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:47:37,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:37,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491730723] [2022-07-11 23:47:37,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491730723] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:37,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:37,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:47:37,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881560796] [2022-07-11 23:47:37,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:37,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:47:37,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:37,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:47:37,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:47:37,720 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-11 23:47:38,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:38,491 INFO L93 Difference]: Finished difference Result 341 states and 477 transitions. [2022-07-11 23:47:38,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:47:38,492 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-11 23:47:38,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:38,494 INFO L225 Difference]: With dead ends: 341 [2022-07-11 23:47:38,494 INFO L226 Difference]: Without dead ends: 333 [2022-07-11 23:47:38,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:47:38,495 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-11 23:47:38,495 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-11 23:47:38,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-07-11 23:47:38,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 322. [2022-07-11 23:47:38,508 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-11 23:47:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 456 transitions. [2022-07-11 23:47:38,509 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 456 transitions. Word has length 32 [2022-07-11 23:47:38,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:38,510 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 456 transitions. [2022-07-11 23:47:38,510 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-11 23:47:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 456 transitions. [2022-07-11 23:47:38,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-11 23:47:38,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:38,511 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-11 23:47:38,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:47:38,511 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:38,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:38,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1059548875, now seen corresponding path program 1 times [2022-07-11 23:47:38,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:38,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031141344] [2022-07-11 23:47:38,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:38,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:38,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:47:38,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:38,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031141344] [2022-07-11 23:47:38,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031141344] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:38,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:38,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:47:38,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923143800] [2022-07-11 23:47:38,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:38,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:47:38,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:38,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:47:38,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:47:38,686 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-11 23:47:40,700 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:47:40,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:40,907 INFO L93 Difference]: Finished difference Result 341 states and 476 transitions. [2022-07-11 23:47:40,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:47:40,908 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-11 23:47:40,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:40,909 INFO L225 Difference]: With dead ends: 341 [2022-07-11 23:47:40,909 INFO L226 Difference]: Without dead ends: 333 [2022-07-11 23:47:40,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:47:40,910 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 523 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:40,910 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.2s Time] [2022-07-11 23:47:40,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-07-11 23:47:40,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 323. [2022-07-11 23:47:40,919 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-11 23:47:40,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 457 transitions. [2022-07-11 23:47:40,921 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 457 transitions. Word has length 33 [2022-07-11 23:47:40,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:40,921 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 457 transitions. [2022-07-11 23:47:40,921 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-11 23:47:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 457 transitions. [2022-07-11 23:47:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:47:40,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:40,922 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-11 23:47:40,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:47:40,923 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:40,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:40,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1752141914, now seen corresponding path program 1 times [2022-07-11 23:47:40,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:40,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131926117] [2022-07-11 23:47:40,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:40,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:47:41,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:41,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131926117] [2022-07-11 23:47:41,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131926117] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:41,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:41,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:47:41,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169939647] [2022-07-11 23:47:41,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:41,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:47:41,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:41,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:47:41,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:47:41,036 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-11 23:47:41,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:41,163 INFO L93 Difference]: Finished difference Result 335 states and 468 transitions. [2022-07-11 23:47:41,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:47:41,164 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-11 23:47:41,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:41,165 INFO L225 Difference]: With dead ends: 335 [2022-07-11 23:47:41,165 INFO L226 Difference]: Without dead ends: 293 [2022-07-11 23:47:41,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:47:41,166 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-11 23:47:41,167 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-11 23:47:41,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-07-11 23:47:41,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2022-07-11 23:47:41,177 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-11 23:47:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 412 transitions. [2022-07-11 23:47:41,178 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 412 transitions. Word has length 34 [2022-07-11 23:47:41,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:41,178 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 412 transitions. [2022-07-11 23:47:41,178 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-11 23:47:41,179 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 412 transitions. [2022-07-11 23:47:41,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:47:41,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:41,179 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-11 23:47:41,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:47:41,180 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:41,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:41,180 INFO L85 PathProgramCache]: Analyzing trace with hash 350835753, now seen corresponding path program 1 times [2022-07-11 23:47:41,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:41,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969261080] [2022-07-11 23:47:41,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:41,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:41,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:47:41,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:41,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969261080] [2022-07-11 23:47:41,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969261080] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:41,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:41,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:47:41,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438231204] [2022-07-11 23:47:41,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:41,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:47:41,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:41,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:47:41,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:47:41,261 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-11 23:47:42,360 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-11 23:47:42,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:42,419 INFO L93 Difference]: Finished difference Result 293 states and 414 transitions. [2022-07-11 23:47:42,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:47:42,420 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-11 23:47:42,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:42,421 INFO L225 Difference]: With dead ends: 293 [2022-07-11 23:47:42,421 INFO L226 Difference]: Without dead ends: 289 [2022-07-11 23:47:42,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:47:42,422 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 26 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:42,422 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.1s Time] [2022-07-11 23:47:42,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-11 23:47:42,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2022-07-11 23:47:42,431 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-11 23:47:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 409 transitions. [2022-07-11 23:47:42,432 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 409 transitions. Word has length 34 [2022-07-11 23:47:42,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:42,433 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 409 transitions. [2022-07-11 23:47:42,433 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-11 23:47:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 409 transitions. [2022-07-11 23:47:42,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 23:47:42,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:42,434 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-11 23:47:42,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:47:42,434 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:42,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:42,435 INFO L85 PathProgramCache]: Analyzing trace with hash 407921745, now seen corresponding path program 1 times [2022-07-11 23:47:42,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:42,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127526421] [2022-07-11 23:47:42,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:42,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:47:42,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:42,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127526421] [2022-07-11 23:47:42,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127526421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:42,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:42,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:47:42,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322954369] [2022-07-11 23:47:42,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:42,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:47:42,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:42,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:47:42,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:47:42,539 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-11 23:47:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:42,619 INFO L93 Difference]: Finished difference Result 343 states and 476 transitions. [2022-07-11 23:47:42,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:47:42,620 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-11 23:47:42,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:42,622 INFO L225 Difference]: With dead ends: 343 [2022-07-11 23:47:42,622 INFO L226 Difference]: Without dead ends: 304 [2022-07-11 23:47:42,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:47:42,623 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-11 23:47:42,623 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-11 23:47:42,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-11 23:47:42,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 289. [2022-07-11 23:47:42,632 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-11 23:47:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 407 transitions. [2022-07-11 23:47:42,633 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 407 transitions. Word has length 43 [2022-07-11 23:47:42,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:42,633 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 407 transitions. [2022-07-11 23:47:42,633 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-11 23:47:42,633 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 407 transitions. [2022-07-11 23:47:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:47:42,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:42,634 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-11 23:47:42,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-11 23:47:42,635 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:42,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:42,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1067937794, now seen corresponding path program 1 times [2022-07-11 23:47:42,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:42,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077895175] [2022-07-11 23:47:42,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:42,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:42,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-11 23:47:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:42,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:47:42,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:42,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077895175] [2022-07-11 23:47:42,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077895175] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:42,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:42,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:47:42,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666520906] [2022-07-11 23:47:42,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:42,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:47:42,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:42,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:47:42,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:47:42,809 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-11 23:47:44,815 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:47:46,203 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:47:46,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:46,377 INFO L93 Difference]: Finished difference Result 316 states and 439 transitions. [2022-07-11 23:47:46,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:47:46,378 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-11 23:47:46,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:46,380 INFO L225 Difference]: With dead ends: 316 [2022-07-11 23:47:46,380 INFO L226 Difference]: Without dead ends: 308 [2022-07-11 23:47:46,380 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-11 23:47:46,380 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 371 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s 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, 3.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:46,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 727 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-11 23:47:46,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-11 23:47:46,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 300. [2022-07-11 23:47:46,392 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-11 23:47:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 421 transitions. [2022-07-11 23:47:46,394 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 421 transitions. Word has length 44 [2022-07-11 23:47:46,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:46,394 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 421 transitions. [2022-07-11 23:47:46,394 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-11 23:47:46,394 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 421 transitions. [2022-07-11 23:47:46,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:47:46,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:46,396 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-11 23:47:46,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-11 23:47:46,396 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:46,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:46,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1661089768, now seen corresponding path program 1 times [2022-07-11 23:47:46,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:46,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265374685] [2022-07-11 23:47:46,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:46,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:46,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-11 23:47:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:47:46,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:46,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265374685] [2022-07-11 23:47:46,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265374685] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:46,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:46,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:47:46,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828851127] [2022-07-11 23:47:46,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:46,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:47:46,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:46,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:47:46,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:47:46,571 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-11 23:47:47,727 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:47:49,742 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:47:49,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:49,903 INFO L93 Difference]: Finished difference Result 316 states and 438 transitions. [2022-07-11 23:47:49,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:47:49,904 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-11 23:47:49,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:49,905 INFO L225 Difference]: With dead ends: 316 [2022-07-11 23:47:49,905 INFO L226 Difference]: Without dead ends: 308 [2022-07-11 23:47:49,905 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-11 23:47:49,906 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 367 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s 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.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:49,906 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.3s Time] [2022-07-11 23:47:49,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-11 23:47:49,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 301. [2022-07-11 23:47:49,916 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-11 23:47:49,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 422 transitions. [2022-07-11 23:47:49,917 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 422 transitions. Word has length 45 [2022-07-11 23:47:49,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:49,918 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 422 transitions. [2022-07-11 23:47:49,918 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-11 23:47:49,919 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 422 transitions. [2022-07-11 23:47:49,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:47:49,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:49,919 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-11 23:47:49,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-11 23:47:49,920 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:49,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:49,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1877198546, now seen corresponding path program 1 times [2022-07-11 23:47:49,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:49,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953352963] [2022-07-11 23:47:49,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:49,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:50,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-11 23:47:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:50,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:47:50,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:50,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953352963] [2022-07-11 23:47:50,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953352963] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:50,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:50,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:47:50,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286162062] [2022-07-11 23:47:50,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:50,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:47:50,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:50,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:47:50,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:47:50,026 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-11 23:47:51,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:51,631 INFO L93 Difference]: Finished difference Result 348 states and 473 transitions. [2022-07-11 23:47:51,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:47:51,632 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-11 23:47:51,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:51,633 INFO L225 Difference]: With dead ends: 348 [2022-07-11 23:47:51,633 INFO L226 Difference]: Without dead ends: 289 [2022-07-11 23:47:51,633 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-11 23:47:51,634 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 362 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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, 1.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:51,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 844 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-11 23:47:51,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-11 23:47:51,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 271. [2022-07-11 23:47:51,648 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-11 23:47:51,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 374 transitions. [2022-07-11 23:47:51,650 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 374 transitions. Word has length 45 [2022-07-11 23:47:51,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:51,651 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 374 transitions. [2022-07-11 23:47:51,651 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-11 23:47:51,651 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 374 transitions. [2022-07-11 23:47:51,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:47:51,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:51,652 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-11 23:47:51,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-11 23:47:51,652 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:51,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:51,653 INFO L85 PathProgramCache]: Analyzing trace with hash 859522540, now seen corresponding path program 1 times [2022-07-11 23:47:51,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:51,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39177619] [2022-07-11 23:47:51,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:51,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:51,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-11 23:47:51,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:51,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39177619] [2022-07-11 23:47:51,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39177619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:51,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:51,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:47:51,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43601708] [2022-07-11 23:47:51,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:51,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:47:51,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:51,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:47:51,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:47:51,795 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-11 23:47:52,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:52,520 INFO L93 Difference]: Finished difference Result 310 states and 423 transitions. [2022-07-11 23:47:52,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:47:52,521 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-11 23:47:52,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:52,522 INFO L225 Difference]: With dead ends: 310 [2022-07-11 23:47:52,522 INFO L226 Difference]: Without dead ends: 269 [2022-07-11 23:47:52,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:47:52,523 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 303 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:52,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 500 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:47:52,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-11 23:47:52,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2022-07-11 23:47:52,534 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-11 23:47:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 370 transitions. [2022-07-11 23:47:52,535 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 370 transitions. Word has length 45 [2022-07-11 23:47:52,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:52,536 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 370 transitions. [2022-07-11 23:47:52,536 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-11 23:47:52,536 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 370 transitions. [2022-07-11 23:47:52,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:47:52,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:52,537 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-11 23:47:52,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-11 23:47:52,537 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:52,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:52,538 INFO L85 PathProgramCache]: Analyzing trace with hash 285533420, now seen corresponding path program 1 times [2022-07-11 23:47:52,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:52,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341504756] [2022-07-11 23:47:52,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:52,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:52,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:52,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-11 23:47:52,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:52,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341504756] [2022-07-11 23:47:52,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341504756] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:52,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:52,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:47:52,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769221845] [2022-07-11 23:47:52,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:52,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:47:52,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:52,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:47:52,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:47:52,632 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-11 23:47:52,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:52,655 INFO L93 Difference]: Finished difference Result 286 states and 391 transitions. [2022-07-11 23:47:52,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:47:52,655 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-11 23:47:52,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:52,656 INFO L225 Difference]: With dead ends: 286 [2022-07-11 23:47:52,657 INFO L226 Difference]: Without dead ends: 263 [2022-07-11 23:47:52,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:47:52,659 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-11 23:47:52,659 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-11 23:47:52,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-11 23:47:52,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2022-07-11 23:47:52,670 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-11 23:47:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 359 transitions. [2022-07-11 23:47:52,671 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 359 transitions. Word has length 45 [2022-07-11 23:47:52,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:52,671 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 359 transitions. [2022-07-11 23:47:52,672 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-11 23:47:52,672 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 359 transitions. [2022-07-11 23:47:52,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-11 23:47:52,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:52,673 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-11 23:47:52,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-11 23:47:52,673 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:52,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:52,673 INFO L85 PathProgramCache]: Analyzing trace with hash 270131950, now seen corresponding path program 1 times [2022-07-11 23:47:52,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:52,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147355460] [2022-07-11 23:47:52,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:52,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:47:52,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:52,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147355460] [2022-07-11 23:47:52,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147355460] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:52,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:52,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:47:52,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355327508] [2022-07-11 23:47:52,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:52,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:47:52,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:52,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:47:52,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:47:52,799 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-11 23:47:53,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:53,546 INFO L93 Difference]: Finished difference Result 283 states and 381 transitions. [2022-07-11 23:47:53,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:47:53,546 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-11 23:47:53,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:53,547 INFO L225 Difference]: With dead ends: 283 [2022-07-11 23:47:53,547 INFO L226 Difference]: Without dead ends: 262 [2022-07-11 23:47:53,548 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-11 23:47:53,548 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 50 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:53,548 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.7s Time] [2022-07-11 23:47:53,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-11 23:47:53,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-07-11 23:47:53,560 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-11 23:47:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 357 transitions. [2022-07-11 23:47:53,562 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 357 transitions. Word has length 46 [2022-07-11 23:47:53,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:53,562 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 357 transitions. [2022-07-11 23:47:53,562 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-11 23:47:53,563 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 357 transitions. [2022-07-11 23:47:53,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-11 23:47:53,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:53,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:47:53,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-11 23:47:53,564 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:53,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:53,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1666913919, now seen corresponding path program 1 times [2022-07-11 23:47:53,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:53,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249062636] [2022-07-11 23:47:53,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:53,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:53,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-11 23:47:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:53,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:47:53,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:53,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249062636] [2022-07-11 23:47:53,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249062636] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:53,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:53,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:47:53,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532885460] [2022-07-11 23:47:53,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:53,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:47:53,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:53,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:47:53,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:47:53,661 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-11 23:47:55,669 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:47:57,679 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:47:58,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:58,072 INFO L93 Difference]: Finished difference Result 502 states and 687 transitions. [2022-07-11 23:47:58,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:47:58,072 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-11 23:47:58,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:58,073 INFO L225 Difference]: With dead ends: 502 [2022-07-11 23:47:58,073 INFO L226 Difference]: Without dead ends: 262 [2022-07-11 23:47:58,074 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-11 23:47:58,074 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 41 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 17 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.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, 87 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:58,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1030 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 87 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-07-11 23:47:58,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-11 23:47:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2022-07-11 23:47:58,086 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-11 23:47:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 354 transitions. [2022-07-11 23:47:58,087 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 354 transitions. Word has length 47 [2022-07-11 23:47:58,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:58,087 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 354 transitions. [2022-07-11 23:47:58,088 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-11 23:47:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 354 transitions. [2022-07-11 23:47:58,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-11 23:47:58,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:58,088 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-11 23:47:58,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-11 23:47:58,089 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:58,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:58,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1795358223, now seen corresponding path program 1 times [2022-07-11 23:47:58,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:58,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875982060] [2022-07-11 23:47:58,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:58,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:58,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-11 23:47:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:58,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:47:58,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:58,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875982060] [2022-07-11 23:47:58,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875982060] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:58,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:58,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:47:58,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389839493] [2022-07-11 23:47:58,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:58,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:47:58,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:58,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:47:58,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:47:58,207 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-11 23:48:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:00,283 INFO L93 Difference]: Finished difference Result 312 states and 413 transitions. [2022-07-11 23:48:00,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:48:00,284 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-11 23:48:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:00,285 INFO L225 Difference]: With dead ends: 312 [2022-07-11 23:48:00,285 INFO L226 Difference]: Without dead ends: 259 [2022-07-11 23:48:00,285 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-11 23:48:00,285 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 65 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:00,285 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.0s Time] [2022-07-11 23:48:00,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-07-11 23:48:00,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2022-07-11 23:48:00,295 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-11 23:48:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 349 transitions. [2022-07-11 23:48:00,296 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 349 transitions. Word has length 52 [2022-07-11 23:48:00,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:00,296 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 349 transitions. [2022-07-11 23:48:00,297 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-11 23:48:00,297 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 349 transitions. [2022-07-11 23:48:00,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-11 23:48:00,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:00,298 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-11 23:48:00,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-11 23:48:00,298 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:00,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:00,298 INFO L85 PathProgramCache]: Analyzing trace with hash -18191150, now seen corresponding path program 1 times [2022-07-11 23:48:00,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:00,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092005981] [2022-07-11 23:48:00,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:00,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:00,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:48:00,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:00,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092005981] [2022-07-11 23:48:00,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092005981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:00,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:00,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:48:00,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143777357] [2022-07-11 23:48:00,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:00,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:48:00,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:00,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:48:00,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:48:00,443 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-11 23:48:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:00,525 INFO L93 Difference]: Finished difference Result 291 states and 389 transitions. [2022-07-11 23:48:00,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:48:00,526 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-11 23:48:00,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:00,527 INFO L225 Difference]: With dead ends: 291 [2022-07-11 23:48:00,527 INFO L226 Difference]: Without dead ends: 177 [2022-07-11 23:48:00,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:48:00,528 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-11 23:48:00,528 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-11 23:48:00,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-11 23:48:00,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 154. [2022-07-11 23:48:00,535 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-11 23:48:00,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 198 transitions. [2022-07-11 23:48:00,536 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 198 transitions. Word has length 52 [2022-07-11 23:48:00,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:00,536 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 198 transitions. [2022-07-11 23:48:00,536 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-11 23:48:00,536 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 198 transitions. [2022-07-11 23:48:00,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-11 23:48:00,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:00,537 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-11 23:48:00,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-11 23:48:00,537 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:00,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:00,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1854339953, now seen corresponding path program 1 times [2022-07-11 23:48:00,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:00,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052917563] [2022-07-11 23:48:00,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:00,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:00,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-11 23:48:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:00,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-11 23:48:00,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:00,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052917563] [2022-07-11 23:48:00,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052917563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:00,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:00,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:48:00,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691829473] [2022-07-11 23:48:00,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:00,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:48:00,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:00,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:48:00,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:48:00,631 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-11 23:48:02,640 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:02,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:02,697 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2022-07-11 23:48:02,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:48:02,697 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-11 23:48:02,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:02,698 INFO L225 Difference]: With dead ends: 168 [2022-07-11 23:48:02,698 INFO L226 Difference]: Without dead ends: 124 [2022-07-11 23:48:02,698 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-11 23:48:02,699 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 42 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:02,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 371 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-07-11 23:48:02,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-11 23:48:02,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-11 23:48:02,704 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-11 23:48:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 157 transitions. [2022-07-11 23:48:02,705 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 157 transitions. Word has length 53 [2022-07-11 23:48:02,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:02,705 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 157 transitions. [2022-07-11 23:48:02,705 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-11 23:48:02,705 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2022-07-11 23:48:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-11 23:48:02,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:02,705 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-11 23:48:02,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-11 23:48:02,705 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:02,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:02,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1084558305, now seen corresponding path program 1 times [2022-07-11 23:48:02,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:02,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164033301] [2022-07-11 23:48:02,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:02,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:02,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-11 23:48:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:02,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-11 23:48:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:02,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:48:02,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:02,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164033301] [2022-07-11 23:48:02,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164033301] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:02,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:02,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:48:02,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34071173] [2022-07-11 23:48:02,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:02,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:48:02,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:02,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:48:02,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:48:02,820 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-11 23:48:04,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:06,911 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:07,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:07,000 INFO L93 Difference]: Finished difference Result 173 states and 219 transitions. [2022-07-11 23:48:07,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:48:07,001 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-11 23:48:07,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:07,001 INFO L225 Difference]: With dead ends: 173 [2022-07-11 23:48:07,002 INFO L226 Difference]: Without dead ends: 122 [2022-07-11 23:48:07,002 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-11 23:48:07,002 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 31 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:07,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 361 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-11 23:48:07,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-11 23:48:07,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-07-11 23:48:07,009 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-11 23:48:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2022-07-11 23:48:07,010 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 55 [2022-07-11 23:48:07,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:07,010 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2022-07-11 23:48:07,010 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-11 23:48:07,010 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2022-07-11 23:48:07,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-11 23:48:07,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:07,011 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-11 23:48:07,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-11 23:48:07,011 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:07,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:07,012 INFO L85 PathProgramCache]: Analyzing trace with hash -638228197, now seen corresponding path program 1 times [2022-07-11 23:48:07,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:07,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107445796] [2022-07-11 23:48:07,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:07,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:07,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-11 23:48:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:07,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:48:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:07,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:48:07,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:07,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107445796] [2022-07-11 23:48:07,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107445796] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:07,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:07,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-11 23:48:07,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300774399] [2022-07-11 23:48:07,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:07,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:48:07,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:07,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:48:07,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:48:07,166 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-11 23:48:08,897 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:09,052 INFO L93 Difference]: Finished difference Result 211 states and 270 transitions. [2022-07-11 23:48:09,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:48:09,052 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-11 23:48:09,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:09,053 INFO L225 Difference]: With dead ends: 211 [2022-07-11 23:48:09,053 INFO L226 Difference]: Without dead ends: 158 [2022-07-11 23:48:09,054 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-11 23:48:09,055 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 46 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 1.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:09,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 561 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-11 23:48:09,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-11 23:48:09,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 138. [2022-07-11 23:48:09,065 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-11 23:48:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 170 transitions. [2022-07-11 23:48:09,066 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 170 transitions. Word has length 57 [2022-07-11 23:48:09,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:09,067 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 170 transitions. [2022-07-11 23:48:09,067 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-11 23:48:09,067 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 170 transitions. [2022-07-11 23:48:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-11 23:48:09,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:09,068 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-11 23:48:09,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-11 23:48:09,068 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:09,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:09,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1799191219, now seen corresponding path program 1 times [2022-07-11 23:48:09,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:09,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760970711] [2022-07-11 23:48:09,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:09,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:09,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-11 23:48:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:09,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:48:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:48:09,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:09,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760970711] [2022-07-11 23:48:09,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760970711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:09,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:09,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:48:09,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657741963] [2022-07-11 23:48:09,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:09,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:48:09,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:09,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:48:09,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:48:09,223 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-11 23:48:10,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:10,264 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-07-11 23:48:10,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:48:10,264 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-11 23:48:10,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:10,265 INFO L225 Difference]: With dead ends: 164 [2022-07-11 23:48:10,265 INFO L226 Difference]: Without dead ends: 161 [2022-07-11 23:48:10,265 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-11 23:48:10,265 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 31 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.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, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:10,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 307 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-11 23:48:10,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-11 23:48:10,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 142. [2022-07-11 23:48:10,273 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-11 23:48:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 176 transitions. [2022-07-11 23:48:10,274 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 176 transitions. Word has length 58 [2022-07-11 23:48:10,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:10,274 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 176 transitions. [2022-07-11 23:48:10,274 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-11 23:48:10,274 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 176 transitions. [2022-07-11 23:48:10,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-11 23:48:10,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:10,274 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-11 23:48:10,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-11 23:48:10,275 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:10,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:10,275 INFO L85 PathProgramCache]: Analyzing trace with hash 297674658, now seen corresponding path program 1 times [2022-07-11 23:48:10,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:10,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032502541] [2022-07-11 23:48:10,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:10,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:10,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-11 23:48:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:10,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:48:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:10,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:48:10,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:10,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032502541] [2022-07-11 23:48:10,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032502541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:10,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:10,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:48:10,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727856417] [2022-07-11 23:48:10,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:10,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:48:10,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:10,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:48:10,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:48:10,416 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-11 23:48:13,163 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:13,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:13,274 INFO L93 Difference]: Finished difference Result 280 states and 346 transitions. [2022-07-11 23:48:13,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:48:13,275 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-11 23:48:13,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:13,276 INFO L225 Difference]: With dead ends: 280 [2022-07-11 23:48:13,276 INFO L226 Difference]: Without dead ends: 253 [2022-07-11 23:48:13,276 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-11 23:48:13,277 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 62 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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, 2.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:13,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 379 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-07-11 23:48:13,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-07-11 23:48:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2022-07-11 23:48:13,308 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-11 23:48:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 311 transitions. [2022-07-11 23:48:13,308 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 311 transitions. Word has length 60 [2022-07-11 23:48:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:13,309 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 311 transitions. [2022-07-11 23:48:13,309 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-11 23:48:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 311 transitions. [2022-07-11 23:48:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-11 23:48:13,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:13,310 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-11 23:48:13,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-11 23:48:13,311 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:13,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:13,311 INFO L85 PathProgramCache]: Analyzing trace with hash 2072682020, now seen corresponding path program 1 times [2022-07-11 23:48:13,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:13,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303631009] [2022-07-11 23:48:13,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:13,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:13,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-11 23:48:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:13,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:48:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:13,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:48:13,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:13,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303631009] [2022-07-11 23:48:13,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303631009] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:13,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:13,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:48:13,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893925032] [2022-07-11 23:48:13,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:13,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:48:13,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:13,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:48:13,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:48:13,652 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-11 23:48:15,257 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:16,383 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:16,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:16,453 INFO L93 Difference]: Finished difference Result 476 states and 599 transitions. [2022-07-11 23:48:16,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:48:16,453 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-11 23:48:16,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:16,454 INFO L225 Difference]: With dead ends: 476 [2022-07-11 23:48:16,454 INFO L226 Difference]: Without dead ends: 250 [2022-07-11 23:48:16,454 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-11 23:48:16,455 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 7 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.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, 2.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:16,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 378 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-11 23:48:16,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-07-11 23:48:16,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2022-07-11 23:48:16,472 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-11 23:48:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 313 transitions. [2022-07-11 23:48:16,473 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 313 transitions. Word has length 60 [2022-07-11 23:48:16,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:16,473 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 313 transitions. [2022-07-11 23:48:16,474 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-11 23:48:16,474 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 313 transitions. [2022-07-11 23:48:16,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-11 23:48:16,475 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:16,475 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-11 23:48:16,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-11 23:48:16,475 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:16,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:16,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1685978785, now seen corresponding path program 1 times [2022-07-11 23:48:16,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:16,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027877643] [2022-07-11 23:48:16,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:16,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:16,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-11 23:48:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:16,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:48:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:16,951 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-11 23:48:16,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:16,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027877643] [2022-07-11 23:48:16,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027877643] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:48:16,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770422791] [2022-07-11 23:48:16,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:16,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:48:16,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:48:16,954 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:48:16,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-11 23:48:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:17,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 1359 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-11 23:48:17,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:48:17,669 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-11 23:48:17,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:48:17,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770422791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:17,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:48:17,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-07-11 23:48:17,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386248783] [2022-07-11 23:48:17,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:17,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:48:17,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:17,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:48:17,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:48:17,671 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-11 23:48:17,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:17,701 INFO L93 Difference]: Finished difference Result 336 states and 423 transitions. [2022-07-11 23:48:17,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:48:17,702 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-11 23:48:17,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:17,703 INFO L225 Difference]: With dead ends: 336 [2022-07-11 23:48:17,703 INFO L226 Difference]: Without dead ends: 236 [2022-07-11 23:48:17,703 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-11 23:48:17,704 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-11 23:48:17,705 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-11 23:48:17,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-11 23:48:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2022-07-11 23:48:17,718 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-11 23:48:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 293 transitions. [2022-07-11 23:48:17,719 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 293 transitions. Word has length 61 [2022-07-11 23:48:17,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:17,719 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 293 transitions. [2022-07-11 23:48:17,719 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-11 23:48:17,720 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 293 transitions. [2022-07-11 23:48:17,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-11 23:48:17,720 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:17,720 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-11 23:48:17,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-11 23:48:17,935 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-11 23:48:17,936 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:17,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:17,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1919232474, now seen corresponding path program 1 times [2022-07-11 23:48:17,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:17,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086694553] [2022-07-11 23:48:17,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:17,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:18,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-11 23:48:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:18,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:48:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:18,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:48:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:18,142 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-11 23:48:18,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:18,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086694553] [2022-07-11 23:48:18,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086694553] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:18,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:18,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-11 23:48:18,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167180948] [2022-07-11 23:48:18,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:18,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:48:18,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:18,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:48:18,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:48:18,143 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-11 23:48:19,300 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:21,313 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:23,331 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:25,344 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:25,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:25,494 INFO L93 Difference]: Finished difference Result 310 states and 391 transitions. [2022-07-11 23:48:25,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:48:25,495 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-11 23:48:25,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:25,495 INFO L225 Difference]: With dead ends: 310 [2022-07-11 23:48:25,496 INFO L226 Difference]: Without dead ends: 224 [2022-07-11 23:48:25,496 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-11 23:48:25,496 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 98 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 29 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:25,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 475 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 157 Invalid, 3 Unknown, 0 Unchecked, 7.3s Time] [2022-07-11 23:48:25,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-11 23:48:25,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2022-07-11 23:48:25,510 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-11 23:48:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 277 transitions. [2022-07-11 23:48:25,511 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 277 transitions. Word has length 65 [2022-07-11 23:48:25,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:25,511 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 277 transitions. [2022-07-11 23:48:25,511 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-11 23:48:25,512 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 277 transitions. [2022-07-11 23:48:25,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-11 23:48:25,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:25,512 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-11 23:48:25,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-11 23:48:25,513 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:25,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:25,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1018080202, now seen corresponding path program 1 times [2022-07-11 23:48:25,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:25,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905880356] [2022-07-11 23:48:25,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:25,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:25,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-11 23:48:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:25,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:48:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:25,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:48:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:25,676 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-11 23:48:25,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:25,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905880356] [2022-07-11 23:48:25,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905880356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:25,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:25,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-11 23:48:25,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661565519] [2022-07-11 23:48:25,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:25,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:48:25,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:25,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:48:25,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:48:25,679 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-11 23:48:27,685 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:30,679 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:30,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:30,834 INFO L93 Difference]: Finished difference Result 287 states and 351 transitions. [2022-07-11 23:48:30,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:48:30,834 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-11 23:48:30,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:30,835 INFO L225 Difference]: With dead ends: 287 [2022-07-11 23:48:30,835 INFO L226 Difference]: Without dead ends: 260 [2022-07-11 23:48:30,836 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-11 23:48:30,836 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 47 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 13 mSolverCounterUnsat, 2 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, 223 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:30,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 830 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 223 Invalid, 2 Unknown, 0 Unchecked, 5.1s Time] [2022-07-11 23:48:30,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-11 23:48:30,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 240. [2022-07-11 23:48:30,850 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-11 23:48:30,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 295 transitions. [2022-07-11 23:48:30,850 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 295 transitions. Word has length 67 [2022-07-11 23:48:30,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:30,851 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 295 transitions. [2022-07-11 23:48:30,851 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-11 23:48:30,851 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 295 transitions. [2022-07-11 23:48:30,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-11 23:48:30,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:30,853 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-11 23:48:30,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-11 23:48:30,853 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:30,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:30,853 INFO L85 PathProgramCache]: Analyzing trace with hash 555821410, now seen corresponding path program 1 times [2022-07-11 23:48:30,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:30,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480896463] [2022-07-11 23:48:30,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:30,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:30,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-11 23:48:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:30,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:48:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:30,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:48:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:30,994 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-11 23:48:30,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:30,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480896463] [2022-07-11 23:48:30,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480896463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:30,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:30,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:48:30,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133192680] [2022-07-11 23:48:30,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:30,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:48:30,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:30,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:48:30,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:48:30,996 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-11 23:48:32,197 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:33,298 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-11 23:48:34,736 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:35,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:35,423 INFO L93 Difference]: Finished difference Result 325 states and 391 transitions. [2022-07-11 23:48:35,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:48:35,424 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-11 23:48:35,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:35,425 INFO L225 Difference]: With dead ends: 325 [2022-07-11 23:48:35,425 INFO L226 Difference]: Without dead ends: 265 [2022-07-11 23:48:35,425 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-11 23:48:35,426 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 56 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:35,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 418 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-11 23:48:35,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-07-11 23:48:35,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2022-07-11 23:48:35,443 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-11 23:48:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 293 transitions. [2022-07-11 23:48:35,444 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 293 transitions. Word has length 66 [2022-07-11 23:48:35,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:35,444 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 293 transitions. [2022-07-11 23:48:35,444 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-11 23:48:35,445 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 293 transitions. [2022-07-11 23:48:35,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-11 23:48:35,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:35,446 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-11 23:48:35,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-11 23:48:35,447 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:35,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:35,447 INFO L85 PathProgramCache]: Analyzing trace with hash -118230121, now seen corresponding path program 1 times [2022-07-11 23:48:35,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:35,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747076736] [2022-07-11 23:48:35,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:35,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:35,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-11 23:48:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:35,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:48:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:35,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:48:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:35,625 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-11 23:48:35,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:35,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747076736] [2022-07-11 23:48:35,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747076736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:35,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:35,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-11 23:48:35,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093327624] [2022-07-11 23:48:35,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:35,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:48:35,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:35,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:48:35,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:48:35,627 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-11 23:48:37,635 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:38,979 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:40,389 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:40,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:40,554 INFO L93 Difference]: Finished difference Result 336 states and 398 transitions. [2022-07-11 23:48:40,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:48:40,555 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-11 23:48:40,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:40,556 INFO L225 Difference]: With dead ends: 336 [2022-07-11 23:48:40,556 INFO L226 Difference]: Without dead ends: 257 [2022-07-11 23:48:40,556 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-11 23:48:40,557 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 44 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:40,557 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.9s Time] [2022-07-11 23:48:40,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-07-11 23:48:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 237. [2022-07-11 23:48:40,585 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-11 23:48:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 277 transitions. [2022-07-11 23:48:40,585 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 277 transitions. Word has length 68 [2022-07-11 23:48:40,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:40,586 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 277 transitions. [2022-07-11 23:48:40,586 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-11 23:48:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 277 transitions. [2022-07-11 23:48:40,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-11 23:48:40,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:40,588 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-11 23:48:40,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-11 23:48:40,588 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:40,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:40,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1748301759, now seen corresponding path program 1 times [2022-07-11 23:48:40,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:40,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273050203] [2022-07-11 23:48:40,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:40,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:40,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-11 23:48:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:40,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:48:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:40,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:48:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:40,727 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-11 23:48:40,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:40,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273050203] [2022-07-11 23:48:40,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273050203] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:40,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:40,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:48:40,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171945844] [2022-07-11 23:48:40,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:40,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:48:40,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:40,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:48:40,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:48:40,728 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-11 23:48:42,741 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:44,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:44,547 INFO L93 Difference]: Finished difference Result 271 states and 314 transitions. [2022-07-11 23:48:44,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:48:44,548 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-11 23:48:44,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:44,548 INFO L225 Difference]: With dead ends: 271 [2022-07-11 23:48:44,549 INFO L226 Difference]: Without dead ends: 216 [2022-07-11 23:48:44,549 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-11 23:48:44,549 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 20 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s 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, 3.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:44,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 349 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 71 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-07-11 23:48:44,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-11 23:48:44,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 198. [2022-07-11 23:48:44,560 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-11 23:48:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 226 transitions. [2022-07-11 23:48:44,560 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 226 transitions. Word has length 74 [2022-07-11 23:48:44,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:44,561 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 226 transitions. [2022-07-11 23:48:44,561 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-11 23:48:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 226 transitions. [2022-07-11 23:48:44,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-11 23:48:44,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:44,562 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-11 23:48:44,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-11 23:48:44,562 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:44,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:44,562 INFO L85 PathProgramCache]: Analyzing trace with hash -452450229, now seen corresponding path program 1 times [2022-07-11 23:48:44,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:44,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335248204] [2022-07-11 23:48:44,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:44,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:44,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-11 23:48:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:44,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:48:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:44,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:48:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:44,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-11 23:48:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:44,738 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-11 23:48:44,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:44,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335248204] [2022-07-11 23:48:44,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335248204] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:44,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:44,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-11 23:48:44,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19450797] [2022-07-11 23:48:44,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:44,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:48:44,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:44,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:48:44,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:48:44,740 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-11 23:48:46,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:48,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:49,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:49,035 INFO L93 Difference]: Finished difference Result 220 states and 250 transitions. [2022-07-11 23:48:49,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:48:49,043 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-11 23:48:49,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:49,044 INFO L225 Difference]: With dead ends: 220 [2022-07-11 23:48:49,044 INFO L226 Difference]: Without dead ends: 178 [2022-07-11 23:48:49,044 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-11 23:48:49,045 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 59 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:49,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 739 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-11 23:48:49,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-11 23:48:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-07-11 23:48:49,072 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-11 23:48:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 200 transitions. [2022-07-11 23:48:49,073 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 200 transitions. Word has length 82 [2022-07-11 23:48:49,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:49,073 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 200 transitions. [2022-07-11 23:48:49,073 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-11 23:48:49,073 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 200 transitions. [2022-07-11 23:48:49,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-11 23:48:49,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:49,074 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-11 23:48:49,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-11 23:48:49,074 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:49,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:49,075 INFO L85 PathProgramCache]: Analyzing trace with hash -447625103, now seen corresponding path program 1 times [2022-07-11 23:48:49,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:49,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568828765] [2022-07-11 23:48:49,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:49,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:49,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-11 23:48:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:49,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:48:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:49,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:48:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:49,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-11 23:48:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:49,432 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-11 23:48:49,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:49,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568828765] [2022-07-11 23:48:49,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568828765] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:48:49,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715077861] [2022-07-11 23:48:49,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:49,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:48:49,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:48:49,444 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:48:49,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-11 23:48:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:50,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 1447 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-11 23:48:50,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:48:50,459 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-11 23:48:50,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:48:50,520 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-11 23:48:50,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715077861] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:48:50,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:48:50,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2022-07-11 23:48:50,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222349365] [2022-07-11 23:48:50,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:48:50,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 23:48:50,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:50,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 23:48:50,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:48:50,522 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-11 23:48:52,021 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:54,496 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:54,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:54,644 INFO L93 Difference]: Finished difference Result 338 states and 383 transitions. [2022-07-11 23:48:54,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:48:54,645 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-11 23:48:54,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:54,645 INFO L225 Difference]: With dead ends: 338 [2022-07-11 23:48:54,645 INFO L226 Difference]: Without dead ends: 184 [2022-07-11 23:48:54,646 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-11 23:48:54,646 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 66 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:54,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 530 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 119 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-07-11 23:48:54,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-11 23:48:54,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2022-07-11 23:48:54,658 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-11 23:48:54,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2022-07-11 23:48:54,659 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 88 [2022-07-11 23:48:54,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:54,659 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2022-07-11 23:48:54,659 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-11 23:48:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2022-07-11 23:48:54,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-11 23:48:54,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:54,660 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-11 23:48:54,683 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-11 23:48:54,883 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-11 23:48:54,883 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:54,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:54,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1753567182, now seen corresponding path program 2 times [2022-07-11 23:48:54,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:54,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241847762] [2022-07-11 23:48:54,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:54,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:55,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-11 23:48:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:55,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:48:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:55,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:48:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:55,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-11 23:48:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:55,401 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-11 23:48:55,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:55,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241847762] [2022-07-11 23:48:55,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241847762] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:48:55,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354506334] [2022-07-11 23:48:55,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:48:55,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:48:55,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:48:55,403 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:48:55,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-11 23:48:56,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-11 23:48:56,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:48:56,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-11 23:48:56,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:48:56,581 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-11 23:48:56,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:48:56,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354506334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:56,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:48:56,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-11 23:48:56,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996493827] [2022-07-11 23:48:56,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:56,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:48:56,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:56,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:48:56,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:48:56,583 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-11 23:48:56,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:56,624 INFO L93 Difference]: Finished difference Result 308 states and 345 transitions. [2022-07-11 23:48:56,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:48:56,624 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-11 23:48:56,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:56,625 INFO L225 Difference]: With dead ends: 308 [2022-07-11 23:48:56,625 INFO L226 Difference]: Without dead ends: 186 [2022-07-11 23:48:56,625 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-11 23:48:56,626 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-11 23:48:56,626 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-11 23:48:56,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-11 23:48:56,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-07-11 23:48:56,638 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-11 23:48:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2022-07-11 23:48:56,639 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 91 [2022-07-11 23:48:56,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:56,639 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2022-07-11 23:48:56,639 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-11 23:48:56,639 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2022-07-11 23:48:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-11 23:48:56,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:56,640 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-11 23:48:56,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:48:56,855 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-11 23:48:56,856 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:56,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:56,856 INFO L85 PathProgramCache]: Analyzing trace with hash -463830121, now seen corresponding path program 1 times [2022-07-11 23:48:56,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:56,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196766791] [2022-07-11 23:48:56,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:56,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:57,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-11 23:48:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:57,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:48:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:57,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:48:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:57,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-11 23:48:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:57,394 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-11 23:48:57,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:57,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196766791] [2022-07-11 23:48:57,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196766791] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:48:57,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031038473] [2022-07-11 23:48:57,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:57,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:48:57,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:48:57,396 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:48:57,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-11 23:48:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:58,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 1561 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:48:58,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:48:58,407 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-11 23:48:58,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:48:58,464 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-11 23:48:58,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031038473] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-11 23:48:58,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:48:58,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 5] total 14 [2022-07-11 23:48:58,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215827881] [2022-07-11 23:48:58,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:58,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:48:58,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:58,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:48:58,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:48:58,467 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-11 23:48:58,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:58,509 INFO L93 Difference]: Finished difference Result 308 states and 343 transitions. [2022-07-11 23:48:58,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:48:58,509 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-11 23:48:58,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:58,510 INFO L225 Difference]: With dead ends: 308 [2022-07-11 23:48:58,510 INFO L226 Difference]: Without dead ends: 188 [2022-07-11 23:48:58,511 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-11 23:48:58,511 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-11 23:48:58,512 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-11 23:48:58,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-11 23:48:58,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-07-11 23:48:58,528 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-11 23:48:58,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2022-07-11 23:48:58,529 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 92 [2022-07-11 23:48:58,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:58,529 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2022-07-11 23:48:58,529 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-11 23:48:58,529 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2022-07-11 23:48:58,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-11 23:48:58,530 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:58,530 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-11 23:48:58,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-11 23:48:58,751 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-11 23:48:58,751 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:58,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:58,752 INFO L85 PathProgramCache]: Analyzing trace with hash 839553712, now seen corresponding path program 1 times [2022-07-11 23:48:58,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:58,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100841390] [2022-07-11 23:48:58,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:58,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:59,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-11 23:48:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:59,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:48:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:59,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:48:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:59,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-11 23:48:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:59,283 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-11 23:48:59,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:59,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100841390] [2022-07-11 23:48:59,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100841390] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:48:59,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703566074] [2022-07-11 23:48:59,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:59,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:48:59,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:48:59,286 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:48:59,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-11 23:49:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:00,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 1580 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-11 23:49:00,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:49:00,511 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-11 23:49:00,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:49:00,650 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-11 23:49:00,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703566074] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:49:00,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:49:00,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 19 [2022-07-11 23:49:00,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342644788] [2022-07-11 23:49:00,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:49:00,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-11 23:49:00,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:00,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-11 23:49:00,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2022-07-11 23:49:00,652 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-11 23:49:02,659 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:04,668 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:05,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:05,410 INFO L93 Difference]: Finished difference Result 358 states and 409 transitions. [2022-07-11 23:49:05,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-11 23:49:05,411 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-11 23:49:05,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:05,411 INFO L225 Difference]: With dead ends: 358 [2022-07-11 23:49:05,412 INFO L226 Difference]: Without dead ends: 200 [2022-07-11 23:49:05,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2022-07-11 23:49:05,413 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 70 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 20 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:05,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 823 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 188 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-11 23:49:05,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-11 23:49:05,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-07-11 23:49:05,431 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-11 23:49:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2022-07-11 23:49:05,431 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 93 [2022-07-11 23:49:05,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:05,431 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2022-07-11 23:49:05,432 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-11 23:49:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2022-07-11 23:49:05,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-11 23:49:05,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:05,432 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-11 23:49:05,468 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-11 23:49:05,647 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-11 23:49:05,647 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:05,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:05,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1195309008, now seen corresponding path program 2 times [2022-07-11 23:49:05,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:05,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092514984] [2022-07-11 23:49:05,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:05,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:06,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-11 23:49:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:06,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-11 23:49:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:06,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-11 23:49:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:06,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-11 23:49:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:06,312 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-11 23:49:06,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:06,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092514984] [2022-07-11 23:49:06,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092514984] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:49:06,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633438430] [2022-07-11 23:49:06,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:49:06,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:49:06,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:49:06,315 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:49:06,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process