./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 eb692b52 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-?-eb692b5 [2022-07-19 10:57:57,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:57:57,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:57:57,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:57:57,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:57:57,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:57:57,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:57:57,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:57:57,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:57:57,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:57:57,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:57:57,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:57:57,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:57:57,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:57:57,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:57:57,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:57:57,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:57:57,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:57:57,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:57:57,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:57:57,709 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:57:57,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:57:57,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:57:57,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:57:57,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:57:57,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:57:57,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:57:57,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:57:57,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:57:57,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:57:57,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:57:57,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:57:57,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:57:57,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:57:57,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:57:57,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:57:57,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:57:57,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:57:57,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:57:57,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:57:57,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:57:57,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:57:57,729 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:57:57,758 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:57:57,759 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:57:57,759 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:57:57,759 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:57:57,760 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:57:57,760 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:57:57,761 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:57:57,761 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:57:57,761 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:57:57,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:57:57,762 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:57:57,762 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:57:57,762 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:57:57,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:57:57,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:57:57,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:57:57,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:57:57,763 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:57:57,763 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:57:57,764 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:57:57,764 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:57:57,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:57:57,764 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:57:57,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:57:57,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:57:57,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:57:57,765 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:57:57,765 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:57:57,765 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:57:57,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:57:57,766 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:57:57,766 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:57:57,766 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:57:57,766 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-19 10:57:57,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:57:57,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:57:58,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:57:58,002 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:57:58,003 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:57:58,004 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-19 10:57:58,062 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010ec51bd/4c315e85ac654121b888eec5d9f0a0c4/FLAGce8947eac [2022-07-19 10:57:58,606 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:57:58,607 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c [2022-07-19 10:57:58,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010ec51bd/4c315e85ac654121b888eec5d9f0a0c4/FLAGce8947eac [2022-07-19 10:57:59,088 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010ec51bd/4c315e85ac654121b888eec5d9f0a0c4 [2022-07-19 10:57:59,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:57:59,091 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:57:59,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:57:59,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:57:59,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:57:59,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:57:59" (1/1) ... [2022-07-19 10:57:59,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3414e327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:59, skipping insertion in model container [2022-07-19 10:57:59,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:57:59" (1/1) ... [2022-07-19 10:57:59,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:57:59,173 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:57:59,552 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-19 10:57:59,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:57:59,750 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:57:59,789 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-19 10:57:59,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:57:59,908 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:57:59,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:59 WrapperNode [2022-07-19 10:57:59,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:57:59,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:57:59,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:57:59,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:57:59,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:59" (1/1) ... [2022-07-19 10:57:59,955 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:59" (1/1) ... [2022-07-19 10:58:00,013 INFO L137 Inliner]: procedures = 109, calls = 328, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 1084 [2022-07-19 10:58:00,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:58:00,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:58:00,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:58:00,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:58:00,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:59" (1/1) ... [2022-07-19 10:58:00,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:59" (1/1) ... [2022-07-19 10:58:00,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:59" (1/1) ... [2022-07-19 10:58:00,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:59" (1/1) ... [2022-07-19 10:58:00,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:59" (1/1) ... [2022-07-19 10:58:00,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:59" (1/1) ... [2022-07-19 10:58:00,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:59" (1/1) ... [2022-07-19 10:58:00,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:58:00,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:58:00,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:58:00,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:58:00,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:59" (1/1) ... [2022-07-19 10:58:00,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:58:00,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:58:00,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-19 10:58:00,167 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-19 10:58:00,208 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-07-19 10:58:00,208 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-07-19 10:58:00,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-19 10:58:00,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-19 10:58:00,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-19 10:58:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 10:58:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-19 10:58:00,209 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-19 10:58:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 10:58:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-19 10:58:00,209 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-19 10:58:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-19 10:58:00,210 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-19 10:58:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 10:58:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:58:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 10:58:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 10:58:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-19 10:58:00,211 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-19 10:58:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-07-19 10:58:00,211 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-07-19 10:58:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 10:58:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 10:58:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:58:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-19 10:58:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:58:00,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:58:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-07-19 10:58:00,212 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-07-19 10:58:00,525 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:58:00,527 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:58:00,590 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:58:00,632 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-07-19 10:58:00,638 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-07-19 10:58:00,701 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:58:00,702 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:58:00,704 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:58:00,707 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:58:00,708 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:58:00,711 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:58:00,712 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:58:02,807 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##83: assume false; [2022-07-19 10:58:02,807 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume !false; [2022-07-19 10:58:02,807 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##36: assume !false; [2022-07-19 10:58:02,807 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume false; [2022-07-19 10:58:02,808 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##139: assume false; [2022-07-19 10:58:02,808 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume !false; [2022-07-19 10:58:02,808 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2022-07-19 10:58:02,808 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2022-07-19 10:58:02,808 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2022-07-19 10:58:02,808 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##157: assume !false; [2022-07-19 10:58:02,809 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2022-07-19 10:58:02,809 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##156: assume false; [2022-07-19 10:58:02,809 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##114: assume !false; [2022-07-19 10:58:02,809 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume false; [2022-07-19 10:58:02,823 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:58:02,831 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:58:02,831 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 10:58:02,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:58:02 BoogieIcfgContainer [2022-07-19 10:58:02,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:58:02,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:58:02,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:58:02,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:58:02,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:57:59" (1/3) ... [2022-07-19 10:58:02,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd52b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:58:02, skipping insertion in model container [2022-07-19 10:58:02,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:59" (2/3) ... [2022-07-19 10:58:02,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fd52b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:58:02, skipping insertion in model container [2022-07-19 10:58:02,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:58:02" (3/3) ... [2022-07-19 10:58:02,861 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr.i.cil-2.c [2022-07-19 10:58:02,872 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:58:02,883 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:58:02,928 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:58:02,934 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@21881fb1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3f692b7a [2022-07-19 10:58:02,943 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:58:02,948 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-19 10:58:02,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 10:58:02,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:02,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:58:02,955 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:02,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:02,959 INFO L85 PathProgramCache]: Analyzing trace with hash -660511979, now seen corresponding path program 1 times [2022-07-19 10:58:02,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:02,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884996408] [2022-07-19 10:58:02,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:02,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:03,342 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-19 10:58:03,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:03,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884996408] [2022-07-19 10:58:03,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884996408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:03,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:03,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 10:58:03,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895777960] [2022-07-19 10:58:03,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:03,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 10:58:03,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:03,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 10:58:03,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 10:58:03,384 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-19 10:58:03,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:03,455 INFO L93 Difference]: Finished difference Result 472 states and 755 transitions. [2022-07-19 10:58:03,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 10:58:03,457 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-19 10:58:03,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:03,467 INFO L225 Difference]: With dead ends: 472 [2022-07-19 10:58:03,467 INFO L226 Difference]: Without dead ends: 231 [2022-07-19 10:58:03,471 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-19 10:58:03,474 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-19 10:58:03,475 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-19 10:58:03,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-19 10:58:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2022-07-19 10:58:03,520 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-19 10:58:03,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 339 transitions. [2022-07-19 10:58:03,524 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 339 transitions. Word has length 16 [2022-07-19 10:58:03,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:03,525 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 339 transitions. [2022-07-19 10:58:03,525 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-19 10:58:03,525 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 339 transitions. [2022-07-19 10:58:03,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 10:58:03,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:03,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:58:03,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:58:03,527 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:03,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:03,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1247317993, now seen corresponding path program 1 times [2022-07-19 10:58:03,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:03,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948705567] [2022-07-19 10:58:03,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:03,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:03,750 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-19 10:58:03,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:03,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948705567] [2022-07-19 10:58:03,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948705567] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:03,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:03,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:58:03,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727722834] [2022-07-19 10:58:03,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:03,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:58:03,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:03,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:58:03,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:58:03,758 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-19 10:58:04,871 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:04,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:04,929 INFO L93 Difference]: Finished difference Result 248 states and 360 transitions. [2022-07-19 10:58:04,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:58:04,930 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-19 10:58:04,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:04,934 INFO L225 Difference]: With dead ends: 248 [2022-07-19 10:58:04,936 INFO L226 Difference]: Without dead ends: 231 [2022-07-19 10:58:04,937 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-19 10:58:04,938 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 249 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:04,940 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.1s Time] [2022-07-19 10:58:04,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-19 10:58:04,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2022-07-19 10:58:04,962 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-19 10:58:04,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 338 transitions. [2022-07-19 10:58:04,965 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 338 transitions. Word has length 16 [2022-07-19 10:58:04,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:04,966 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 338 transitions. [2022-07-19 10:58:04,966 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-19 10:58:04,966 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 338 transitions. [2022-07-19 10:58:04,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 10:58:04,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:04,968 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-19 10:58:04,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:58:04,969 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:04,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:04,970 INFO L85 PathProgramCache]: Analyzing trace with hash 8900389, now seen corresponding path program 1 times [2022-07-19 10:58:04,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:04,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085057594] [2022-07-19 10:58:04,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:04,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:05,150 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-19 10:58:05,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:05,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085057594] [2022-07-19 10:58:05,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085057594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:05,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:05,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:58:05,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113147644] [2022-07-19 10:58:05,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:05,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:58:05,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:05,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:58:05,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:58:05,158 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-19 10:58:05,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:05,443 INFO L93 Difference]: Finished difference Result 603 states and 904 transitions. [2022-07-19 10:58:05,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:58:05,444 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-19 10:58:05,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:05,449 INFO L225 Difference]: With dead ends: 603 [2022-07-19 10:58:05,449 INFO L226 Difference]: Without dead ends: 392 [2022-07-19 10:58:05,450 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-19 10:58:05,453 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-19 10:58:05,454 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-19 10:58:05,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-07-19 10:58:05,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 233. [2022-07-19 10:58:05,495 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-19 10:58:05,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 340 transitions. [2022-07-19 10:58:05,496 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 340 transitions. Word has length 28 [2022-07-19 10:58:05,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:05,497 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 340 transitions. [2022-07-19 10:58:05,497 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-19 10:58:05,497 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 340 transitions. [2022-07-19 10:58:05,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 10:58:05,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:05,498 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-19 10:58:05,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 10:58:05,498 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:05,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:05,499 INFO L85 PathProgramCache]: Analyzing trace with hash 620779237, now seen corresponding path program 1 times [2022-07-19 10:58:05,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:05,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723223400] [2022-07-19 10:58:05,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:05,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:05,677 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-19 10:58:05,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:05,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723223400] [2022-07-19 10:58:05,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723223400] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:05,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:05,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:58:05,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61580257] [2022-07-19 10:58:05,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:05,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:58:05,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:05,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:58:05,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:58:05,681 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-19 10:58:06,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:06,494 INFO L93 Difference]: Finished difference Result 354 states and 506 transitions. [2022-07-19 10:58:06,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:58:06,495 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-19 10:58:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:06,497 INFO L225 Difference]: With dead ends: 354 [2022-07-19 10:58:06,497 INFO L226 Difference]: Without dead ends: 299 [2022-07-19 10:58:06,500 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-19 10:58:06,506 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 244 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.8s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:06,507 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.8s Time] [2022-07-19 10:58:06,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-19 10:58:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 283. [2022-07-19 10:58:06,525 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-19 10:58:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 405 transitions. [2022-07-19 10:58:06,528 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 405 transitions. Word has length 28 [2022-07-19 10:58:06,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:06,529 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 405 transitions. [2022-07-19 10:58:06,529 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-19 10:58:06,529 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 405 transitions. [2022-07-19 10:58:06,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 10:58:06,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:06,538 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-19 10:58:06,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 10:58:06,539 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:06,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:06,539 INFO L85 PathProgramCache]: Analyzing trace with hash -451775854, now seen corresponding path program 1 times [2022-07-19 10:58:06,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:06,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178730200] [2022-07-19 10:58:06,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:06,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:06,721 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-19 10:58:06,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:06,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178730200] [2022-07-19 10:58:06,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178730200] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:06,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:06,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:58:06,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840358766] [2022-07-19 10:58:06,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:06,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:58:06,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:06,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:58:06,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:58:06,725 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-19 10:58:06,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:06,756 INFO L93 Difference]: Finished difference Result 439 states and 613 transitions. [2022-07-19 10:58:06,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:58:06,756 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-19 10:58:06,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:06,761 INFO L225 Difference]: With dead ends: 439 [2022-07-19 10:58:06,761 INFO L226 Difference]: Without dead ends: 340 [2022-07-19 10:58:06,762 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-19 10:58:06,762 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-19 10:58:06,763 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-19 10:58:06,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-07-19 10:58:06,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 317. [2022-07-19 10:58:06,777 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-19 10:58:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 450 transitions. [2022-07-19 10:58:06,779 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 450 transitions. Word has length 30 [2022-07-19 10:58:06,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:06,780 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 450 transitions. [2022-07-19 10:58:06,780 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-19 10:58:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 450 transitions. [2022-07-19 10:58:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 10:58:06,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:06,782 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-19 10:58:06,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 10:58:06,782 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:06,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:06,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1294247663, now seen corresponding path program 1 times [2022-07-19 10:58:06,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:06,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193073296] [2022-07-19 10:58:06,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:06,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:06,955 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-19 10:58:06,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:06,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193073296] [2022-07-19 10:58:06,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193073296] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:06,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:06,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:58:06,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092755704] [2022-07-19 10:58:06,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:06,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:58:06,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:06,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:58:06,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:58:06,957 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-19 10:58:07,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:07,858 INFO L93 Difference]: Finished difference Result 341 states and 477 transitions. [2022-07-19 10:58:07,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:58:07,858 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-19 10:58:07,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:07,862 INFO L225 Difference]: With dead ends: 341 [2022-07-19 10:58:07,862 INFO L226 Difference]: Without dead ends: 333 [2022-07-19 10:58:07,863 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-19 10:58:07,864 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 526 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:07,864 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.9s Time] [2022-07-19 10:58:07,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-07-19 10:58:07,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 322. [2022-07-19 10:58:07,879 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-19 10:58:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 456 transitions. [2022-07-19 10:58:07,880 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 456 transitions. Word has length 32 [2022-07-19 10:58:07,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:07,881 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 456 transitions. [2022-07-19 10:58:07,881 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-19 10:58:07,881 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 456 transitions. [2022-07-19 10:58:07,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-19 10:58:07,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:07,882 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-19 10:58:07,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 10:58:07,882 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:07,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:07,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1059548875, now seen corresponding path program 1 times [2022-07-19 10:58:07,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:07,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606927725] [2022-07-19 10:58:07,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:07,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:08,029 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-19 10:58:08,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:08,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606927725] [2022-07-19 10:58:08,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606927725] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:08,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:08,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:58:08,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575321729] [2022-07-19 10:58:08,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:08,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:58:08,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:08,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:58:08,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:58:08,032 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-19 10:58:10,042 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:10,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:10,229 INFO L93 Difference]: Finished difference Result 341 states and 476 transitions. [2022-07-19 10:58:10,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:58:10,229 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-19 10:58:10,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:10,231 INFO L225 Difference]: With dead ends: 341 [2022-07-19 10:58:10,231 INFO L226 Difference]: Without dead ends: 333 [2022-07-19 10:58:10,232 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-19 10:58:10,232 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 523 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:10,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 403 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 10:58:10,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-07-19 10:58:10,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 323. [2022-07-19 10:58:10,256 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-19 10:58:10,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 457 transitions. [2022-07-19 10:58:10,258 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 457 transitions. Word has length 33 [2022-07-19 10:58:10,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:10,258 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 457 transitions. [2022-07-19 10:58:10,258 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-19 10:58:10,259 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 457 transitions. [2022-07-19 10:58:10,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 10:58:10,260 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:10,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:58:10,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 10:58:10,260 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:10,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:10,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1752141914, now seen corresponding path program 1 times [2022-07-19 10:58:10,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:10,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770581206] [2022-07-19 10:58:10,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:10,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:10,381 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-19 10:58:10,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:10,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770581206] [2022-07-19 10:58:10,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770581206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:10,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:10,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:58:10,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124175537] [2022-07-19 10:58:10,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:10,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:58:10,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:10,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:58:10,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:58:10,384 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-19 10:58:10,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:10,546 INFO L93 Difference]: Finished difference Result 335 states and 468 transitions. [2022-07-19 10:58:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:58:10,547 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-19 10:58:10,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:10,549 INFO L225 Difference]: With dead ends: 335 [2022-07-19 10:58:10,549 INFO L226 Difference]: Without dead ends: 293 [2022-07-19 10:58:10,549 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-19 10:58:10,550 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-19 10:58:10,550 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-19 10:58:10,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-07-19 10:58:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2022-07-19 10:58:10,564 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-19 10:58:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 412 transitions. [2022-07-19 10:58:10,566 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 412 transitions. Word has length 34 [2022-07-19 10:58:10,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:10,566 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 412 transitions. [2022-07-19 10:58:10,566 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-19 10:58:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 412 transitions. [2022-07-19 10:58:10,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 10:58:10,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:10,567 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-19 10:58:10,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 10:58:10,568 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:10,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:10,568 INFO L85 PathProgramCache]: Analyzing trace with hash 350835753, now seen corresponding path program 1 times [2022-07-19 10:58:10,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:10,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796510757] [2022-07-19 10:58:10,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:10,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:10,704 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-19 10:58:10,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:10,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796510757] [2022-07-19 10:58:10,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796510757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:10,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:10,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:58:10,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218404127] [2022-07-19 10:58:10,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:10,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:58:10,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:10,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:58:10,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:58:10,706 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-19 10:58:11,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:11,248 INFO L93 Difference]: Finished difference Result 293 states and 414 transitions. [2022-07-19 10:58:11,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:58:11,248 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-19 10:58:11,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:11,250 INFO L225 Difference]: With dead ends: 293 [2022-07-19 10:58:11,250 INFO L226 Difference]: Without dead ends: 289 [2022-07-19 10:58:11,250 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-19 10:58:11,251 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 26 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:11,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 535 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 10:58:11,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-19 10:58:11,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2022-07-19 10:58:11,262 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-19 10:58:11,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 409 transitions. [2022-07-19 10:58:11,264 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 409 transitions. Word has length 34 [2022-07-19 10:58:11,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:11,264 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 409 transitions. [2022-07-19 10:58:11,264 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-19 10:58:11,264 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 409 transitions. [2022-07-19 10:58:11,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 10:58:11,265 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:11,266 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-19 10:58:11,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 10:58:11,266 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:11,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:11,267 INFO L85 PathProgramCache]: Analyzing trace with hash 407921745, now seen corresponding path program 1 times [2022-07-19 10:58:11,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:11,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117930721] [2022-07-19 10:58:11,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:11,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:11,385 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-19 10:58:11,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:11,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117930721] [2022-07-19 10:58:11,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117930721] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:11,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:11,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:58:11,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401989216] [2022-07-19 10:58:11,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:11,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:58:11,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:11,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:58:11,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:58:11,388 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-19 10:58:11,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:11,504 INFO L93 Difference]: Finished difference Result 343 states and 476 transitions. [2022-07-19 10:58:11,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:58:11,504 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-19 10:58:11,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:11,506 INFO L225 Difference]: With dead ends: 343 [2022-07-19 10:58:11,506 INFO L226 Difference]: Without dead ends: 304 [2022-07-19 10:58:11,507 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-19 10:58:11,507 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-19 10:58:11,508 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-19 10:58:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-19 10:58:11,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 289. [2022-07-19 10:58:11,520 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-19 10:58:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 407 transitions. [2022-07-19 10:58:11,521 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 407 transitions. Word has length 43 [2022-07-19 10:58:11,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:11,522 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 407 transitions. [2022-07-19 10:58:11,522 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-19 10:58:11,522 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 407 transitions. [2022-07-19 10:58:11,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 10:58:11,523 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:11,523 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-19 10:58:11,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 10:58:11,524 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:11,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:11,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1067937794, now seen corresponding path program 1 times [2022-07-19 10:58:11,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:11,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885478991] [2022-07-19 10:58:11,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:11,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:11,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 10:58:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:11,751 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-19 10:58:11,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:11,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885478991] [2022-07-19 10:58:11,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885478991] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:11,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:11,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:58:11,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183557195] [2022-07-19 10:58:11,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:11,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:58:11,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:11,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:58:11,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:58:11,753 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-19 10:58:13,764 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-19 10:58:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:14,915 INFO L93 Difference]: Finished difference Result 316 states and 439 transitions. [2022-07-19 10:58:14,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:58:14,916 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-19 10:58:14,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:14,918 INFO L225 Difference]: With dead ends: 316 [2022-07-19 10:58:14,918 INFO L226 Difference]: Without dead ends: 308 [2022-07-19 10:58:14,918 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-19 10:58:14,919 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 371 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:14,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 727 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 138 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-07-19 10:58:14,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-19 10:58:14,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 300. [2022-07-19 10:58:14,948 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-19 10:58:14,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 421 transitions. [2022-07-19 10:58:14,950 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 421 transitions. Word has length 44 [2022-07-19 10:58:14,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:14,950 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 421 transitions. [2022-07-19 10:58:14,951 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-19 10:58:14,951 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 421 transitions. [2022-07-19 10:58:14,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 10:58:14,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:14,953 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-19 10:58:14,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 10:58:14,953 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:14,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:14,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1661089768, now seen corresponding path program 1 times [2022-07-19 10:58:14,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:14,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082052094] [2022-07-19 10:58:14,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:14,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:15,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 10:58:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:15,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-19 10:58:15,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:15,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082052094] [2022-07-19 10:58:15,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082052094] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:15,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:15,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:58:15,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487394993] [2022-07-19 10:58:15,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:15,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:58:15,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:15,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:58:15,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:58:15,167 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-19 10:58:17,176 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-19 10:58:19,191 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-19 10:58:19,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:19,376 INFO L93 Difference]: Finished difference Result 316 states and 438 transitions. [2022-07-19 10:58:19,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:58:19,377 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-19 10:58:19,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:19,378 INFO L225 Difference]: With dead ends: 316 [2022-07-19 10:58:19,379 INFO L226 Difference]: Without dead ends: 308 [2022-07-19 10:58:19,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:58:19,379 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 367 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 42 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:19,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 729 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 135 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-07-19 10:58:19,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-07-19 10:58:19,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 301. [2022-07-19 10:58:19,393 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-19 10:58:19,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 422 transitions. [2022-07-19 10:58:19,395 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 422 transitions. Word has length 45 [2022-07-19 10:58:19,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:19,395 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 422 transitions. [2022-07-19 10:58:19,395 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-19 10:58:19,395 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 422 transitions. [2022-07-19 10:58:19,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 10:58:19,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:19,397 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-19 10:58:19,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 10:58:19,397 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:19,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:19,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1877198546, now seen corresponding path program 1 times [2022-07-19 10:58:19,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:19,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043243525] [2022-07-19 10:58:19,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:19,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:19,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 10:58:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:19,525 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-19 10:58:19,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:19,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043243525] [2022-07-19 10:58:19,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043243525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:19,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:19,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:58:19,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035710580] [2022-07-19 10:58:19,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:19,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:58:19,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:19,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:58:19,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:58:19,528 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-19 10:58:21,538 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-19 10:58:22,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:22,485 INFO L93 Difference]: Finished difference Result 348 states and 473 transitions. [2022-07-19 10:58:22,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:58:22,486 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-19 10:58:22,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:22,487 INFO L225 Difference]: With dead ends: 348 [2022-07-19 10:58:22,488 INFO L226 Difference]: Without dead ends: 289 [2022-07-19 10:58:22,488 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-19 10:58:22,488 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 362 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:22,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 844 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 130 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-07-19 10:58:22,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-19 10:58:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 271. [2022-07-19 10:58:22,504 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-19 10:58:22,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 374 transitions. [2022-07-19 10:58:22,506 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 374 transitions. Word has length 45 [2022-07-19 10:58:22,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:22,507 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 374 transitions. [2022-07-19 10:58:22,507 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-19 10:58:22,507 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 374 transitions. [2022-07-19 10:58:22,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 10:58:22,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:22,508 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-19 10:58:22,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 10:58:22,508 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:22,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:22,509 INFO L85 PathProgramCache]: Analyzing trace with hash 859522540, now seen corresponding path program 1 times [2022-07-19 10:58:22,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:22,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380452940] [2022-07-19 10:58:22,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:22,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:22,668 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-19 10:58:22,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:22,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380452940] [2022-07-19 10:58:22,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380452940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:22,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:22,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:58:22,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145142346] [2022-07-19 10:58:22,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:22,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:58:22,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:22,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:58:22,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:58:22,671 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-19 10:58:23,993 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:24,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:24,118 INFO L93 Difference]: Finished difference Result 310 states and 423 transitions. [2022-07-19 10:58:24,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:58:24,118 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-19 10:58:24,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:24,121 INFO L225 Difference]: With dead ends: 310 [2022-07-19 10:58:24,122 INFO L226 Difference]: Without dead ends: 269 [2022-07-19 10:58:24,122 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-19 10:58:24,122 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 303 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:24,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 500 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-19 10:58:24,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-19 10:58:24,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2022-07-19 10:58:24,138 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-19 10:58:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 370 transitions. [2022-07-19 10:58:24,140 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 370 transitions. Word has length 45 [2022-07-19 10:58:24,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:24,140 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 370 transitions. [2022-07-19 10:58:24,140 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-19 10:58:24,140 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 370 transitions. [2022-07-19 10:58:24,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 10:58:24,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:24,141 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-19 10:58:24,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 10:58:24,142 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:24,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:24,142 INFO L85 PathProgramCache]: Analyzing trace with hash 285533420, now seen corresponding path program 1 times [2022-07-19 10:58:24,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:24,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333655626] [2022-07-19 10:58:24,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:24,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:24,250 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-19 10:58:24,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:24,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333655626] [2022-07-19 10:58:24,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333655626] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:24,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:24,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:58:24,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423454509] [2022-07-19 10:58:24,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:24,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:58:24,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:24,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:58:24,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:58:24,252 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-19 10:58:24,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:24,293 INFO L93 Difference]: Finished difference Result 286 states and 391 transitions. [2022-07-19 10:58:24,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:58:24,294 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-19 10:58:24,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:24,295 INFO L225 Difference]: With dead ends: 286 [2022-07-19 10:58:24,295 INFO L226 Difference]: Without dead ends: 263 [2022-07-19 10:58:24,297 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-19 10:58:24,298 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-19 10:58:24,298 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-19 10:58:24,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-19 10:58:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2022-07-19 10:58:24,313 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-19 10:58:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 359 transitions. [2022-07-19 10:58:24,315 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 359 transitions. Word has length 45 [2022-07-19 10:58:24,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:24,315 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 359 transitions. [2022-07-19 10:58:24,315 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-19 10:58:24,315 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 359 transitions. [2022-07-19 10:58:24,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 10:58:24,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:58:24,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 10:58:24,317 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:24,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:24,317 INFO L85 PathProgramCache]: Analyzing trace with hash 270131950, now seen corresponding path program 1 times [2022-07-19 10:58:24,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:24,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248394037] [2022-07-19 10:58:24,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:24,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:24,450 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-19 10:58:24,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:24,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248394037] [2022-07-19 10:58:24,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248394037] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:24,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:24,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:58:24,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705082964] [2022-07-19 10:58:24,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:24,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:58:24,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:24,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:58:24,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:58:24,453 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-19 10:58:25,617 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:25,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:25,702 INFO L93 Difference]: Finished difference Result 283 states and 381 transitions. [2022-07-19 10:58:25,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:58:25,703 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-19 10:58:25,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:25,704 INFO L225 Difference]: With dead ends: 283 [2022-07-19 10:58:25,704 INFO L226 Difference]: Without dead ends: 262 [2022-07-19 10:58:25,705 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-19 10:58:25,705 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 50 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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, 1.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:25,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1444 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-19 10:58:25,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-19 10:58:25,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2022-07-19 10:58:25,718 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-19 10:58:25,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 357 transitions. [2022-07-19 10:58:25,720 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 357 transitions. Word has length 46 [2022-07-19 10:58:25,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:25,720 INFO L495 AbstractCegarLoop]: Abstraction has 262 states and 357 transitions. [2022-07-19 10:58:25,720 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-19 10:58:25,720 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 357 transitions. [2022-07-19 10:58:25,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-19 10:58:25,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:25,721 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-19 10:58:25,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 10:58:25,722 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:25,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:25,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1666913919, now seen corresponding path program 1 times [2022-07-19 10:58:25,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:25,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257002926] [2022-07-19 10:58:25,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:25,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:25,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 10:58:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:25,846 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-19 10:58:25,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:25,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257002926] [2022-07-19 10:58:25,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257002926] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:25,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:25,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:58:25,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543125605] [2022-07-19 10:58:25,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:25,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:58:25,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:25,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:58:25,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:58:25,849 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-19 10:58:27,858 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-19 10:58:29,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:29,147 INFO L93 Difference]: Finished difference Result 502 states and 687 transitions. [2022-07-19 10:58:29,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:58:29,148 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-19 10:58:29,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:29,149 INFO L225 Difference]: With dead ends: 502 [2022-07-19 10:58:29,149 INFO L226 Difference]: Without dead ends: 262 [2022-07-19 10:58:29,150 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-19 10:58:29,151 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 41 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:29,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1030 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 88 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-07-19 10:58:29,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-19 10:58:29,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2022-07-19 10:58:29,164 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-19 10:58:29,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 354 transitions. [2022-07-19 10:58:29,165 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 354 transitions. Word has length 47 [2022-07-19 10:58:29,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:29,166 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 354 transitions. [2022-07-19 10:58:29,166 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-19 10:58:29,166 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 354 transitions. [2022-07-19 10:58:29,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-19 10:58:29,167 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:29,167 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-19 10:58:29,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 10:58:29,167 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:29,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:29,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1795358223, now seen corresponding path program 1 times [2022-07-19 10:58:29,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:29,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962066399] [2022-07-19 10:58:29,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:29,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:29,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 10:58:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:29,306 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-19 10:58:29,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:29,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962066399] [2022-07-19 10:58:29,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962066399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:29,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:29,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:58:29,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930930552] [2022-07-19 10:58:29,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:29,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:58:29,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:29,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:58:29,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:58:29,308 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-19 10:58:32,285 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-19 10:58:32,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:32,459 INFO L93 Difference]: Finished difference Result 312 states and 413 transitions. [2022-07-19 10:58:32,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:58:32,459 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-19 10:58:32,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:32,461 INFO L225 Difference]: With dead ends: 312 [2022-07-19 10:58:32,461 INFO L226 Difference]: Without dead ends: 259 [2022-07-19 10:58:32,461 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-19 10:58:32,462 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 65 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:32,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1292 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 118 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-07-19 10:58:32,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-07-19 10:58:32,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2022-07-19 10:58:32,476 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-19 10:58:32,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 349 transitions. [2022-07-19 10:58:32,478 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 349 transitions. Word has length 52 [2022-07-19 10:58:32,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:32,478 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 349 transitions. [2022-07-19 10:58:32,478 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-19 10:58:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 349 transitions. [2022-07-19 10:58:32,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-19 10:58:32,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:32,479 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-19 10:58:32,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 10:58:32,480 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:32,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:32,480 INFO L85 PathProgramCache]: Analyzing trace with hash -18191150, now seen corresponding path program 1 times [2022-07-19 10:58:32,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:32,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980318797] [2022-07-19 10:58:32,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:32,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:32,677 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-19 10:58:32,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:32,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980318797] [2022-07-19 10:58:32,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980318797] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:32,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:32,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:58:32,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999410421] [2022-07-19 10:58:32,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:32,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:58:32,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:32,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:58:32,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:58:32,680 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-19 10:58:32,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:32,806 INFO L93 Difference]: Finished difference Result 291 states and 389 transitions. [2022-07-19 10:58:32,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:58:32,806 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-19 10:58:32,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:32,807 INFO L225 Difference]: With dead ends: 291 [2022-07-19 10:58:32,807 INFO L226 Difference]: Without dead ends: 177 [2022-07-19 10:58:32,808 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-19 10:58:32,808 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-19 10:58:32,809 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-19 10:58:32,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-19 10:58:32,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 154. [2022-07-19 10:58:32,818 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-19 10:58:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 198 transitions. [2022-07-19 10:58:32,819 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 198 transitions. Word has length 52 [2022-07-19 10:58:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:32,819 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 198 transitions. [2022-07-19 10:58:32,819 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-19 10:58:32,819 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 198 transitions. [2022-07-19 10:58:32,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-19 10:58:32,820 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:32,820 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-19 10:58:32,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 10:58:32,820 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:32,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:32,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1854339953, now seen corresponding path program 1 times [2022-07-19 10:58:32,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:32,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336756099] [2022-07-19 10:58:32,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:32,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:32,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 10:58:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:32,992 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-19 10:58:32,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:32,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336756099] [2022-07-19 10:58:32,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336756099] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:32,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:32,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:58:32,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107591185] [2022-07-19 10:58:32,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:32,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:58:32,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:32,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:58:32,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:58:32,995 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-19 10:58:34,331 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-19 10:58:34,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:34,402 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2022-07-19 10:58:34,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:58:34,402 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-19 10:58:34,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:34,403 INFO L225 Difference]: With dead ends: 168 [2022-07-19 10:58:34,403 INFO L226 Difference]: Without dead ends: 124 [2022-07-19 10:58:34,403 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-19 10:58:34,404 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 42 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:34,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 371 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-19 10:58:34,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-19 10:58:34,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-19 10:58:34,410 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-19 10:58:34,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 157 transitions. [2022-07-19 10:58:34,411 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 157 transitions. Word has length 53 [2022-07-19 10:58:34,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:34,411 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 157 transitions. [2022-07-19 10:58:34,411 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-19 10:58:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 157 transitions. [2022-07-19 10:58:34,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-19 10:58:34,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:34,412 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-19 10:58:34,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 10:58:34,412 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:34,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:34,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1084558305, now seen corresponding path program 1 times [2022-07-19 10:58:34,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:34,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488574305] [2022-07-19 10:58:34,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:34,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:34,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-19 10:58:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:34,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 10:58:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:34,600 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-19 10:58:34,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:34,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488574305] [2022-07-19 10:58:34,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488574305] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:34,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:34,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:58:34,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614996631] [2022-07-19 10:58:34,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:34,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:58:34,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:34,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:58:34,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:58:34,602 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-19 10:58:37,916 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:38,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:38,015 INFO L93 Difference]: Finished difference Result 173 states and 219 transitions. [2022-07-19 10:58:38,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:58:38,016 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-19 10:58:38,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:38,016 INFO L225 Difference]: With dead ends: 173 [2022-07-19 10:58:38,017 INFO L226 Difference]: Without dead ends: 122 [2022-07-19 10:58:38,017 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-19 10:58:38,017 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 31 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s 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, 3.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:38,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 361 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-19 10:58:38,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-19 10:58:38,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-07-19 10:58:38,026 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-19 10:58:38,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2022-07-19 10:58:38,027 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 55 [2022-07-19 10:58:38,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:38,027 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2022-07-19 10:58:38,028 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-19 10:58:38,028 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2022-07-19 10:58:38,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 10:58:38,028 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:38,028 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-19 10:58:38,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 10:58:38,029 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:38,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:38,029 INFO L85 PathProgramCache]: Analyzing trace with hash -638228197, now seen corresponding path program 1 times [2022-07-19 10:58:38,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:38,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445713651] [2022-07-19 10:58:38,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:38,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:38,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 10:58:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:38,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:58:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:38,208 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-19 10:58:38,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:38,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445713651] [2022-07-19 10:58:38,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445713651] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:38,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:38,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 10:58:38,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061446946] [2022-07-19 10:58:38,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:38,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:58:38,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:38,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:58:38,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:58:38,210 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-19 10:58:39,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:39,236 INFO L93 Difference]: Finished difference Result 211 states and 270 transitions. [2022-07-19 10:58:39,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:58:39,237 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-19 10:58:39,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:39,238 INFO L225 Difference]: With dead ends: 211 [2022-07-19 10:58:39,238 INFO L226 Difference]: Without dead ends: 158 [2022-07-19 10:58:39,238 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-19 10:58:39,238 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 46 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:39,239 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.0s Time] [2022-07-19 10:58:39,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-19 10:58:39,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 138. [2022-07-19 10:58:39,248 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-19 10:58:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 170 transitions. [2022-07-19 10:58:39,248 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 170 transitions. Word has length 57 [2022-07-19 10:58:39,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:39,249 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 170 transitions. [2022-07-19 10:58:39,249 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-19 10:58:39,249 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 170 transitions. [2022-07-19 10:58:39,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 10:58:39,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:39,250 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-19 10:58:39,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 10:58:39,250 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:39,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:39,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1799191219, now seen corresponding path program 1 times [2022-07-19 10:58:39,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:39,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014775995] [2022-07-19 10:58:39,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:39,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:39,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 10:58:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:39,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:58:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:39,423 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-19 10:58:39,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:39,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014775995] [2022-07-19 10:58:39,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014775995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:39,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:39,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:58:39,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077108997] [2022-07-19 10:58:39,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:39,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:58:39,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:39,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:58:39,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:58:39,427 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-19 10:58:40,563 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:40,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:40,648 INFO L93 Difference]: Finished difference Result 164 states and 206 transitions. [2022-07-19 10:58:40,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:58:40,649 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-19 10:58:40,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:40,650 INFO L225 Difference]: With dead ends: 164 [2022-07-19 10:58:40,650 INFO L226 Difference]: Without dead ends: 161 [2022-07-19 10:58:40,650 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-19 10:58:40,650 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 31 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:40,650 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.2s Time] [2022-07-19 10:58:40,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-19 10:58:40,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 142. [2022-07-19 10:58:40,664 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-19 10:58:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 176 transitions. [2022-07-19 10:58:40,665 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 176 transitions. Word has length 58 [2022-07-19 10:58:40,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:40,665 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 176 transitions. [2022-07-19 10:58:40,666 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-19 10:58:40,666 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 176 transitions. [2022-07-19 10:58:40,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-19 10:58:40,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:40,667 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-19 10:58:40,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 10:58:40,667 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:40,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:40,667 INFO L85 PathProgramCache]: Analyzing trace with hash 297674658, now seen corresponding path program 1 times [2022-07-19 10:58:40,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:40,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929679159] [2022-07-19 10:58:40,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:40,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:40,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 10:58:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:40,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:58:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:40,826 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-19 10:58:40,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:40,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929679159] [2022-07-19 10:58:40,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929679159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:40,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:40,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:58:40,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110615864] [2022-07-19 10:58:40,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:40,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:58:40,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:40,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:58:40,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:58:40,828 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-19 10:58:42,837 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-19 10:58:43,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:43,650 INFO L93 Difference]: Finished difference Result 280 states and 346 transitions. [2022-07-19 10:58:43,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:58:43,651 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-19 10:58:43,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:43,652 INFO L225 Difference]: With dead ends: 280 [2022-07-19 10:58:43,652 INFO L226 Difference]: Without dead ends: 253 [2022-07-19 10:58:43,652 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-19 10:58:43,653 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 62 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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-19 10:58:43,653 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-19 10:58:43,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-07-19 10:58:43,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2022-07-19 10:58:43,670 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-19 10:58:43,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 311 transitions. [2022-07-19 10:58:43,671 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 311 transitions. Word has length 60 [2022-07-19 10:58:43,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:43,671 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 311 transitions. [2022-07-19 10:58:43,672 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-19 10:58:43,672 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 311 transitions. [2022-07-19 10:58:43,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-19 10:58:43,673 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:58:43,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 10:58:43,673 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:43,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:43,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2072682020, now seen corresponding path program 1 times [2022-07-19 10:58:43,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:43,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85147942] [2022-07-19 10:58:43,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:43,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:44,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 10:58:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:44,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:58:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:44,087 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-19 10:58:44,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:44,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85147942] [2022-07-19 10:58:44,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85147942] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:44,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:44,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:58:44,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944977462] [2022-07-19 10:58:44,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:44,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:58:44,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:44,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:58:44,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:58:44,089 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-19 10:58:45,183 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:46,469 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-19 10:58:46,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:46,557 INFO L93 Difference]: Finished difference Result 476 states and 599 transitions. [2022-07-19 10:58:46,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:58:46,557 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-19 10:58:46,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:46,558 INFO L225 Difference]: With dead ends: 476 [2022-07-19 10:58:46,559 INFO L226 Difference]: Without dead ends: 250 [2022-07-19 10:58:46,559 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-19 10:58:46,560 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 7 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:46,560 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.4s Time] [2022-07-19 10:58:46,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-07-19 10:58:46,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2022-07-19 10:58:46,577 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-19 10:58:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 313 transitions. [2022-07-19 10:58:46,579 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 313 transitions. Word has length 60 [2022-07-19 10:58:46,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:46,579 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 313 transitions. [2022-07-19 10:58:46,579 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-19 10:58:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 313 transitions. [2022-07-19 10:58:46,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-19 10:58:46,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:46,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:58:46,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-19 10:58:46,580 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:46,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:46,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1685978785, now seen corresponding path program 1 times [2022-07-19 10:58:46,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:46,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948933869] [2022-07-19 10:58:46,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:46,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:47,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 10:58:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:47,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:58:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:47,292 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-19 10:58:47,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:47,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948933869] [2022-07-19 10:58:47,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948933869] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:58:47,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563383137] [2022-07-19 10:58:47,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:47,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:58:47,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:58:47,295 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-19 10:58:47,306 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-19 10:58:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:48,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 1359 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 10:58:48,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:58:48,139 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-19 10:58:48,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:58:48,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563383137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:48,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:58:48,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-07-19 10:58:48,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658335514] [2022-07-19 10:58:48,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:48,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:58:48,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:48,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:58:48,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:58:48,142 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-19 10:58:48,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:48,168 INFO L93 Difference]: Finished difference Result 336 states and 423 transitions. [2022-07-19 10:58:48,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:58:48,168 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-19 10:58:48,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:48,169 INFO L225 Difference]: With dead ends: 336 [2022-07-19 10:58:48,170 INFO L226 Difference]: Without dead ends: 236 [2022-07-19 10:58:48,170 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-19 10:58:48,171 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-19 10:58:48,171 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-19 10:58:48,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-19 10:58:48,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2022-07-19 10:58:48,189 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-19 10:58:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 293 transitions. [2022-07-19 10:58:48,190 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 293 transitions. Word has length 61 [2022-07-19 10:58:48,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:48,191 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 293 transitions. [2022-07-19 10:58:48,191 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-19 10:58:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 293 transitions. [2022-07-19 10:58:48,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-19 10:58:48,192 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:48,192 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-19 10:58:48,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 10:58:48,407 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-19 10:58:48,408 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:48,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:48,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1919232474, now seen corresponding path program 1 times [2022-07-19 10:58:48,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:48,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418095365] [2022-07-19 10:58:48,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:48,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:48,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 10:58:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:48,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:58:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:48,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:58:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:48,683 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-19 10:58:48,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:48,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418095365] [2022-07-19 10:58:48,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418095365] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:48,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:48,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 10:58:48,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611316649] [2022-07-19 10:58:48,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:48,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:58:48,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:48,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:58:48,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:58:48,686 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-19 10:58:49,847 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-19 10:58:51,060 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:52,081 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:53,376 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-19 10:58:54,649 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:58:54,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:54,823 INFO L93 Difference]: Finished difference Result 310 states and 391 transitions. [2022-07-19 10:58:54,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:58:54,824 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-19 10:58:54,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:54,825 INFO L225 Difference]: With dead ends: 310 [2022-07-19 10:58:54,825 INFO L226 Difference]: Without dead ends: 224 [2022-07-19 10:58:54,825 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-19 10:58:54,826 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 98 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:54,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 475 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-07-19 10:58:54,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-19 10:58:54,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2022-07-19 10:58:54,845 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-19 10:58:54,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 277 transitions. [2022-07-19 10:58:54,846 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 277 transitions. Word has length 65 [2022-07-19 10:58:54,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:54,846 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 277 transitions. [2022-07-19 10:58:54,846 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-19 10:58:54,846 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 277 transitions. [2022-07-19 10:58:54,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-19 10:58:54,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:54,847 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-19 10:58:54,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-19 10:58:54,848 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:54,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:54,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1018080202, now seen corresponding path program 1 times [2022-07-19 10:58:54,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:54,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239313939] [2022-07-19 10:58:54,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:54,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:55,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 10:58:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:55,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:58:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:55,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:58:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:55,079 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-19 10:58:55,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:55,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239313939] [2022-07-19 10:58:55,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239313939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:55,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:55,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 10:58:55,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182605643] [2022-07-19 10:58:55,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:55,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:58:55,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:55,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:58:55,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:58:55,083 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-19 10:58:57,092 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-19 10:58:58,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:58:58,664 INFO L93 Difference]: Finished difference Result 287 states and 351 transitions. [2022-07-19 10:58:58,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:58:58,664 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-19 10:58:58,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:58:58,666 INFO L225 Difference]: With dead ends: 287 [2022-07-19 10:58:58,666 INFO L226 Difference]: Without dead ends: 260 [2022-07-19 10:58:58,666 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-19 10:58:58,666 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 47 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-19 10:58:58,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 830 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 224 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-07-19 10:58:58,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-19 10:58:58,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 240. [2022-07-19 10:58:58,684 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-19 10:58:58,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 295 transitions. [2022-07-19 10:58:58,685 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 295 transitions. Word has length 67 [2022-07-19 10:58:58,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:58:58,686 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 295 transitions. [2022-07-19 10:58:58,686 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-19 10:58:58,686 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 295 transitions. [2022-07-19 10:58:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-19 10:58:58,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:58:58,687 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-19 10:58:58,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-19 10:58:58,687 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:58:58,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:58:58,688 INFO L85 PathProgramCache]: Analyzing trace with hash 555821410, now seen corresponding path program 1 times [2022-07-19 10:58:58,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:58:58,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731786021] [2022-07-19 10:58:58,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:58:58,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:58:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:58,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 10:58:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:58,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:58:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:58,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:58:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:58:58,872 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-19 10:58:58,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:58:58,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731786021] [2022-07-19 10:58:58,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731786021] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:58:58,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:58:58,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:58:58,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510097977] [2022-07-19 10:58:58,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:58:58,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:58:58,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:58:58,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:58:58,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:58:58,875 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-19 10:59:00,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:02,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:02,701 INFO L93 Difference]: Finished difference Result 325 states and 391 transitions. [2022-07-19 10:59:02,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:59:02,701 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-19 10:59:02,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:02,702 INFO L225 Difference]: With dead ends: 325 [2022-07-19 10:59:02,702 INFO L226 Difference]: Without dead ends: 265 [2022-07-19 10:59:02,703 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-19 10:59:02,703 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 56 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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, 3.8s IncrementalHoareTripleChecker+Time [2022-07-19 10:59:02,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 418 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-19 10:59:02,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-07-19 10:59:02,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2022-07-19 10:59:02,722 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-19 10:59:02,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 293 transitions. [2022-07-19 10:59:02,723 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 293 transitions. Word has length 66 [2022-07-19 10:59:02,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:02,723 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 293 transitions. [2022-07-19 10:59:02,723 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-19 10:59:02,723 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 293 transitions. [2022-07-19 10:59:02,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-19 10:59:02,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:02,724 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-19 10:59:02,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-19 10:59:02,725 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:02,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:02,725 INFO L85 PathProgramCache]: Analyzing trace with hash -118230121, now seen corresponding path program 1 times [2022-07-19 10:59:02,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:02,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646058433] [2022-07-19 10:59:02,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:02,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:02,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 10:59:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:02,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:59:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:02,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:59:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:02,934 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-19 10:59:02,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:02,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646058433] [2022-07-19 10:59:02,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646058433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:59:02,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:59:02,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 10:59:02,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257013803] [2022-07-19 10:59:02,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:59:02,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:59:02,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:02,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:59:02,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:59:02,936 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-19 10:59:05,452 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:06,675 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:06,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:06,851 INFO L93 Difference]: Finished difference Result 336 states and 398 transitions. [2022-07-19 10:59:06,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:59:06,851 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-19 10:59:06,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:06,852 INFO L225 Difference]: With dead ends: 336 [2022-07-19 10:59:06,852 INFO L226 Difference]: Without dead ends: 257 [2022-07-19 10:59:06,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:59:06,854 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 44 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.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, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-19 10:59:06,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 815 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-19 10:59:06,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-07-19 10:59:06,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 237. [2022-07-19 10:59:06,874 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-19 10:59:06,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 277 transitions. [2022-07-19 10:59:06,875 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 277 transitions. Word has length 68 [2022-07-19 10:59:06,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:06,875 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 277 transitions. [2022-07-19 10:59:06,875 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-19 10:59:06,876 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 277 transitions. [2022-07-19 10:59:06,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-19 10:59:06,876 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:06,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 10:59:06,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-19 10:59:06,877 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:06,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:06,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1748301759, now seen corresponding path program 1 times [2022-07-19 10:59:06,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:06,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787767533] [2022-07-19 10:59:06,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:06,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:07,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 10:59:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:07,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:59:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:07,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:59:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:07,037 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-19 10:59:07,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:07,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787767533] [2022-07-19 10:59:07,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787767533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:59:07,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:59:07,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:59:07,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319308225] [2022-07-19 10:59:07,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:59:07,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:59:07,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:07,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:59:07,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:59:07,039 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-19 10:59:09,773 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-19 10:59:10,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:10,400 INFO L93 Difference]: Finished difference Result 271 states and 314 transitions. [2022-07-19 10:59:10,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:59:10,401 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-19 10:59:10,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:10,402 INFO L225 Difference]: With dead ends: 271 [2022-07-19 10:59:10,402 INFO L226 Difference]: Without dead ends: 216 [2022-07-19 10:59:10,402 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-19 10:59:10,403 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 20 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s 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.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:59:10,403 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.3s Time] [2022-07-19 10:59:10,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-19 10:59:10,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 198. [2022-07-19 10:59:10,428 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-19 10:59:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 226 transitions. [2022-07-19 10:59:10,429 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 226 transitions. Word has length 74 [2022-07-19 10:59:10,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:10,429 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 226 transitions. [2022-07-19 10:59:10,430 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-19 10:59:10,430 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 226 transitions. [2022-07-19 10:59:10,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-19 10:59:10,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:10,431 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-19 10:59:10,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-19 10:59:10,431 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:10,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:10,432 INFO L85 PathProgramCache]: Analyzing trace with hash -452450229, now seen corresponding path program 1 times [2022-07-19 10:59:10,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:10,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433200994] [2022-07-19 10:59:10,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:10,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:10,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 10:59:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:10,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:59:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:10,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:59:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:10,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 10:59:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:10,662 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-19 10:59:10,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:10,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433200994] [2022-07-19 10:59:10,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433200994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:59:10,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:59:10,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 10:59:10,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371469509] [2022-07-19 10:59:10,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:59:10,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:59:10,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:10,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:59:10,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:59:10,664 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-19 10:59:11,805 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:13,510 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:13,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:13,666 INFO L93 Difference]: Finished difference Result 220 states and 250 transitions. [2022-07-19 10:59:13,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:59:13,666 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-19 10:59:13,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:13,668 INFO L225 Difference]: With dead ends: 220 [2022-07-19 10:59:13,668 INFO L226 Difference]: Without dead ends: 178 [2022-07-19 10:59:13,669 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-19 10:59:13,669 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 59 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s 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, 3.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:59:13,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 739 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-19 10:59:13,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-19 10:59:13,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2022-07-19 10:59:13,685 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-19 10:59:13,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 200 transitions. [2022-07-19 10:59:13,686 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 200 transitions. Word has length 82 [2022-07-19 10:59:13,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:13,686 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 200 transitions. [2022-07-19 10:59:13,686 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-19 10:59:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 200 transitions. [2022-07-19 10:59:13,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-19 10:59:13,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:13,687 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-19 10:59:13,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-19 10:59:13,688 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:13,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:13,688 INFO L85 PathProgramCache]: Analyzing trace with hash -447625103, now seen corresponding path program 1 times [2022-07-19 10:59:13,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:13,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115044089] [2022-07-19 10:59:13,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:13,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:14,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-19 10:59:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:14,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:59:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:14,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:59:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:14,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 10:59:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:14,211 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-19 10:59:14,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:14,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115044089] [2022-07-19 10:59:14,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115044089] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:59:14,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93922800] [2022-07-19 10:59:14,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:14,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:59:14,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:59:14,216 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-19 10:59:14,217 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-19 10:59:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:15,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 1447 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 10:59:15,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:59:15,354 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-19 10:59:15,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:59:15,445 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-19 10:59:15,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93922800] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:59:15,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:59:15,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2022-07-19 10:59:15,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631129925] [2022-07-19 10:59:15,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:59:15,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 10:59:15,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:15,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 10:59:15,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:59:15,448 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-19 10:59:17,457 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-19 10:59:19,738 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:19,902 INFO L93 Difference]: Finished difference Result 338 states and 383 transitions. [2022-07-19 10:59:19,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:59:19,902 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-19 10:59:19,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:19,903 INFO L225 Difference]: With dead ends: 338 [2022-07-19 10:59:19,903 INFO L226 Difference]: Without dead ends: 184 [2022-07-19 10:59:19,904 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-19 10:59:19,904 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 66 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:59:19,904 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.4s Time] [2022-07-19 10:59:19,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-19 10:59:19,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2022-07-19 10:59:19,925 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-19 10:59:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 206 transitions. [2022-07-19 10:59:19,926 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 206 transitions. Word has length 88 [2022-07-19 10:59:19,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:19,926 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 206 transitions. [2022-07-19 10:59:19,926 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-19 10:59:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 206 transitions. [2022-07-19 10:59:19,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-19 10:59:19,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:19,927 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-19 10:59:19,958 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-19 10:59:20,143 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-19 10:59:20,143 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:20,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:20,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1753567182, now seen corresponding path program 2 times [2022-07-19 10:59:20,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:20,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050132826] [2022-07-19 10:59:20,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:20,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:20,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 10:59:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:20,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:59:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:20,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:59:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:20,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 10:59:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:20,766 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-19 10:59:20,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:20,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050132826] [2022-07-19 10:59:20,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050132826] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:59:20,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071353650] [2022-07-19 10:59:20,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:59:20,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:59:20,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:59:20,768 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-19 10:59:20,769 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-19 10:59:21,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 10:59:21,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:59:21,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 1432 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 10:59:21,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:59:22,007 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-19 10:59:22,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:59:22,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071353650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:59:22,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:59:22,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-19 10:59:22,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535470387] [2022-07-19 10:59:22,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:59:22,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:59:22,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:22,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:59:22,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:59:22,010 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-19 10:59:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:22,046 INFO L93 Difference]: Finished difference Result 308 states and 345 transitions. [2022-07-19 10:59:22,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:59:22,047 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-19 10:59:22,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:22,048 INFO L225 Difference]: With dead ends: 308 [2022-07-19 10:59:22,048 INFO L226 Difference]: Without dead ends: 186 [2022-07-19 10:59:22,049 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-19 10:59:22,050 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-19 10:59:22,050 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-19 10:59:22,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-19 10:59:22,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-07-19 10:59:22,069 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-19 10:59:22,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 208 transitions. [2022-07-19 10:59:22,070 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 208 transitions. Word has length 91 [2022-07-19 10:59:22,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:22,070 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 208 transitions. [2022-07-19 10:59:22,070 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-19 10:59:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 208 transitions. [2022-07-19 10:59:22,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-19 10:59:22,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:22,071 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-19 10:59:22,110 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-19 10:59:22,299 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-19 10:59:22,300 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:22,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:22,300 INFO L85 PathProgramCache]: Analyzing trace with hash -463830121, now seen corresponding path program 1 times [2022-07-19 10:59:22,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:22,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974440277] [2022-07-19 10:59:22,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:22,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:22,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 10:59:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:22,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:59:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:22,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:59:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:22,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 10:59:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:22,863 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-19 10:59:22,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:22,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974440277] [2022-07-19 10:59:22,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974440277] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:59:22,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9348036] [2022-07-19 10:59:22,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:22,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:59:22,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:59:22,865 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-19 10:59:22,891 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-19 10:59:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:24,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 1561 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:59:24,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:59:24,084 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-19 10:59:24,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:59:24,135 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-19 10:59:24,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9348036] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 10:59:24,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:59:24,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 5] total 14 [2022-07-19 10:59:24,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305252352] [2022-07-19 10:59:24,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:59:24,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:59:24,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:24,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:59:24,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:59:24,138 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-19 10:59:24,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:24,182 INFO L93 Difference]: Finished difference Result 308 states and 343 transitions. [2022-07-19 10:59:24,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:59:24,182 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-19 10:59:24,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:24,183 INFO L225 Difference]: With dead ends: 308 [2022-07-19 10:59:24,183 INFO L226 Difference]: Without dead ends: 188 [2022-07-19 10:59:24,184 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-19 10:59:24,184 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-19 10:59:24,185 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-19 10:59:24,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-07-19 10:59:24,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-07-19 10:59:24,203 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-19 10:59:24,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 210 transitions. [2022-07-19 10:59:24,204 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 210 transitions. Word has length 92 [2022-07-19 10:59:24,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:24,204 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 210 transitions. [2022-07-19 10:59:24,205 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-19 10:59:24,205 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 210 transitions. [2022-07-19 10:59:24,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-19 10:59:24,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:24,206 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-19 10:59:24,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-19 10:59:24,431 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-19 10:59:24,431 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:24,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:24,432 INFO L85 PathProgramCache]: Analyzing trace with hash 839553712, now seen corresponding path program 1 times [2022-07-19 10:59:24,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:24,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530650104] [2022-07-19 10:59:24,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:24,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:25,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-19 10:59:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:25,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:59:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:25,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:59:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:25,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 10:59:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:25,099 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-19 10:59:25,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:25,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530650104] [2022-07-19 10:59:25,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530650104] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:59:25,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580654614] [2022-07-19 10:59:25,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:25,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:59:25,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:59:25,104 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-19 10:59:25,114 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-19 10:59:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:26,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 1580 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-19 10:59:26,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:59:26,412 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-19 10:59:26,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:59:26,595 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-19 10:59:26,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580654614] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:59:26,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:59:26,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 19 [2022-07-19 10:59:26,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130191207] [2022-07-19 10:59:26,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:59:26,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 10:59:26,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:59:26,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 10:59:26,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2022-07-19 10:59:26,597 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-19 10:59:27,712 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 10:59:29,722 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-19 10:59:30,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:59:30,450 INFO L93 Difference]: Finished difference Result 358 states and 409 transitions. [2022-07-19 10:59:30,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 10:59:30,451 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-19 10:59:30,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:59:30,452 INFO L225 Difference]: With dead ends: 358 [2022-07-19 10:59:30,452 INFO L226 Difference]: Without dead ends: 200 [2022-07-19 10:59:30,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2022-07-19 10:59:30,453 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 70 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:59:30,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 823 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 189 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-07-19 10:59:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-19 10:59:30,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-07-19 10:59:30,477 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-19 10:59:30,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 222 transitions. [2022-07-19 10:59:30,478 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 222 transitions. Word has length 93 [2022-07-19 10:59:30,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:59:30,478 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 222 transitions. [2022-07-19 10:59:30,482 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-19 10:59:30,482 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 222 transitions. [2022-07-19 10:59:30,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-19 10:59:30,483 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:59:30,483 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-19 10:59:30,519 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-19 10:59:30,693 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-19 10:59:30,693 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:59:30,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:59:30,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1195309008, now seen corresponding path program 2 times [2022-07-19 10:59:30,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:59:30,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916224178] [2022-07-19 10:59:30,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:59:30,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:59:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:31,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 10:59:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:31,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 10:59:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:31,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 10:59:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:31,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 10:59:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:59:31,302 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-19 10:59:31,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:59:31,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916224178] [2022-07-19 10:59:31,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916224178] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:59:31,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781388418] [2022-07-19 10:59:31,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:59:31,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:59:31,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:59:31,308 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-19 10:59:31,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process