./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers/diskperf.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ntdrivers/diskperf.i.cil-1.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 f0996d70f204c5713a65b04e25037e48d7532ec1ba0c10162e12c5c0d518b4e3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:47:11,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:47:11,591 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:47:11,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:47:11,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:47:11,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:47:11,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:47:11,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:47:11,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:47:11,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:47:11,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:47:11,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:47:11,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:47:11,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:47:11,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:47:11,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:47:11,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:47:11,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:47:11,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:47:11,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:47:11,632 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:47:11,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:47:11,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:47:11,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:47:11,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:47:11,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:47:11,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:47:11,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:47:11,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:47:11,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:47:11,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:47:11,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:47:11,641 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:47:11,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:47:11,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:47:11,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:47:11,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:47:11,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:47:11,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:47:11,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:47:11,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:47:11,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:47:11,647 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:47:11,665 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:47:11,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:47:11,666 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:47:11,666 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:47:11,667 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:47:11,667 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:47:11,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:47:11,668 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:47:11,668 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:47:11,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:47:11,669 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:47:11,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:47:11,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:47:11,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:47:11,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:47:11,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:47:11,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:47:11,670 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:47:11,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:47:11,671 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:47:11,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:47:11,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:47:11,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:47:11,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:47:11,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:47:11,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:47:11,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:47:11,673 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:47:11,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:47:11,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:47:11,686 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:47:11,686 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:47:11,686 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:47:11,686 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 -> f0996d70f204c5713a65b04e25037e48d7532ec1ba0c10162e12c5c0d518b4e3 [2022-07-11 23:47:11,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:47:11,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:47:11,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:47:11,943 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:47:11,944 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:47:11,946 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers/diskperf.i.cil-1.c [2022-07-11 23:47:12,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92250c72d/43de113e2e5f4f2c9777377fb26f2ec4/FLAG3a8de1c13 [2022-07-11 23:47:12,660 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:47:12,661 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers/diskperf.i.cil-1.c [2022-07-11 23:47:12,684 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92250c72d/43de113e2e5f4f2c9777377fb26f2ec4/FLAG3a8de1c13 [2022-07-11 23:47:12,798 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92250c72d/43de113e2e5f4f2c9777377fb26f2ec4 [2022-07-11 23:47:12,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:47:12,802 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:47:12,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:47:12,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:47:12,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:47:12,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:47:12" (1/1) ... [2022-07-11 23:47:12,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294ae824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:12, skipping insertion in model container [2022-07-11 23:47:12,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:47:12" (1/1) ... [2022-07-11 23:47:12,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:47:12,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:47:13,311 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/diskperf.i.cil-1.c[84645,84658] [2022-07-11 23:47:13,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:47:13,627 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:47:13,675 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/diskperf.i.cil-1.c[84645,84658] [2022-07-11 23:47:13,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:47:13,898 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:47:13,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:13 WrapperNode [2022-07-11 23:47:13,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:47:13,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:47:13,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:47:13,900 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:47:13,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:13" (1/1) ... [2022-07-11 23:47:13,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:13" (1/1) ... [2022-07-11 23:47:14,099 INFO L137 Inliner]: procedures = 127, calls = 1459, calls flagged for inlining = 20, calls inlined = 18, statements flattened = 3760 [2022-07-11 23:47:14,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:47:14,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:47:14,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:47:14,101 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:47:14,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:13" (1/1) ... [2022-07-11 23:47:14,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:13" (1/1) ... [2022-07-11 23:47:14,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:13" (1/1) ... [2022-07-11 23:47:14,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:13" (1/1) ... [2022-07-11 23:47:14,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:13" (1/1) ... [2022-07-11 23:47:14,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:13" (1/1) ... [2022-07-11 23:47:14,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:13" (1/1) ... [2022-07-11 23:47:14,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:47:14,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:47:14,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:47:14,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:47:14,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:13" (1/1) ... [2022-07-11 23:47:14,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:47:14,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:47:14,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-11 23:47:14,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-11 23:47:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-11 23:47:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-11 23:47:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-11 23:47:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:47:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-07-11 23:47:14,436 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-07-11 23:47:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2022-07-11 23:47:14,436 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2022-07-11 23:47:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-11 23:47:14,437 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-11 23:47:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfAddCounters [2022-07-11 23:47:14,437 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfAddCounters [2022-07-11 23:47:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-11 23:47:14,438 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-11 23:47:14,438 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedDecrement [2022-07-11 23:47:14,438 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedDecrement [2022-07-11 23:47:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure IoWMIRegistrationControl [2022-07-11 23:47:14,439 INFO L138 BoogieDeclarations]: Found implementation of procedure IoWMIRegistrationControl [2022-07-11 23:47:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:47:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-11 23:47:14,439 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-11 23:47:14,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-11 23:47:14,439 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-11 23:47:14,440 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-11 23:47:14,440 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-11 23:47:14,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:47:14,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:47:14,440 INFO L130 BoogieDeclarations]: Found specification of procedure KeQuerySystemTime [2022-07-11 23:47:14,440 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQuerySystemTime [2022-07-11 23:47:14,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-11 23:47:14,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 23:47:14,441 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-11 23:47:14,441 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-11 23:47:14,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-11 23:47:14,441 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2022-07-11 23:47:14,441 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2022-07-11 23:47:14,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 23:47:14,442 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfLogError [2022-07-11 23:47:14,442 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfLogError [2022-07-11 23:47:14,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-11 23:47:14,442 INFO L130 BoogieDeclarations]: Found specification of procedure KeQueryPerformanceCounter [2022-07-11 23:47:14,442 INFO L138 BoogieDeclarations]: Found implementation of procedure KeQueryPerformanceCounter [2022-07-11 23:47:14,443 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedIncrement [2022-07-11 23:47:14,443 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedIncrement [2022-07-11 23:47:14,443 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-07-11 23:47:14,443 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-07-11 23:47:14,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2022-07-11 23:47:14,444 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2022-07-11 23:47:14,444 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2022-07-11 23:47:14,444 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2022-07-11 23:47:14,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:47:14,444 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2022-07-11 23:47:14,445 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2022-07-11 23:47:14,445 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2022-07-11 23:47:14,446 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2022-07-11 23:47:14,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-11 23:47:14,446 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2022-07-11 23:47:14,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2022-07-11 23:47:14,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:47:14,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:47:15,025 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:47:15,027 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:47:15,166 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:15,181 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-07-11 23:47:15,181 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-07-11 23:47:15,318 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:15,342 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-07-11 23:47:15,342 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-07-11 23:47:15,901 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:15,921 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-07-11 23:47:15,922 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-07-11 23:47:16,063 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:16,068 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:16,073 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:47:54,549 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##61: assume false; [2022-07-11 23:47:54,549 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##62: assume !false; [2022-07-11 23:47:54,549 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume !false; [2022-07-11 23:47:54,550 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##34: assume false; [2022-07-11 23:47:54,550 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume false; [2022-07-11 23:47:54,550 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume !false; [2022-07-11 23:47:54,563 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:47:54,574 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:47:54,574 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-11 23:47:54,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:47:54 BoogieIcfgContainer [2022-07-11 23:47:54,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:47:54,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:47:54,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:47:54,582 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:47:54,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:47:12" (1/3) ... [2022-07-11 23:47:54,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4956bfc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:47:54, skipping insertion in model container [2022-07-11 23:47:54,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:47:13" (2/3) ... [2022-07-11 23:47:54,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4956bfc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:47:54, skipping insertion in model container [2022-07-11 23:47:54,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:47:54" (3/3) ... [2022-07-11 23:47:54,585 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf.i.cil-1.c [2022-07-11 23:47:54,598 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:47:54,599 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:47:54,657 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:47:54,663 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@796d88f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6bc24d0f [2022-07-11 23:47:54,663 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:47:54,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 383 states, 279 states have (on average 1.4265232974910393) internal successors, (398), 297 states have internal predecessors, (398), 80 states have call successors, (80), 22 states have call predecessors, (80), 22 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2022-07-11 23:47:54,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-11 23:47:54,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:54,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:47:54,677 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:54,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:54,682 INFO L85 PathProgramCache]: Analyzing trace with hash -735846889, now seen corresponding path program 1 times [2022-07-11 23:47:54,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:54,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298169920] [2022-07-11 23:47:54,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:54,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:55,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:47:55,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:55,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298169920] [2022-07-11 23:47:55,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298169920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:55,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:55,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:47:55,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929146232] [2022-07-11 23:47:55,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:55,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 23:47:55,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:55,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 23:47:55,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:47:55,988 INFO L87 Difference]: Start difference. First operand has 383 states, 279 states have (on average 1.4265232974910393) internal successors, (398), 297 states have internal predecessors, (398), 80 states have call successors, (80), 22 states have call predecessors, (80), 22 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:56,071 INFO L93 Difference]: Finished difference Result 760 states and 1148 transitions. [2022-07-11 23:47:56,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 23:47:56,073 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 17 [2022-07-11 23:47:56,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:56,085 INFO L225 Difference]: With dead ends: 760 [2022-07-11 23:47:56,085 INFO L226 Difference]: Without dead ends: 376 [2022-07-11 23:47:56,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:47:56,095 INFO L413 NwaCegarLoop]: 532 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, 532 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:56,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:47:56,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-07-11 23:47:56,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2022-07-11 23:47:56,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 274 states have (on average 1.3613138686131387) internal successors, (373), 290 states have internal predecessors, (373), 80 states have call successors, (80), 22 states have call predecessors, (80), 21 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-07-11 23:47:56,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 519 transitions. [2022-07-11 23:47:56,168 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 519 transitions. Word has length 17 [2022-07-11 23:47:56,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:56,168 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 519 transitions. [2022-07-11 23:47:56,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:56,169 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 519 transitions. [2022-07-11 23:47:56,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-11 23:47:56,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:56,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:47:56,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:47:56,171 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:56,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1538755995, now seen corresponding path program 1 times [2022-07-11 23:47:56,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:56,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565385085] [2022-07-11 23:47:56,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:56,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:47:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:47:57,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:47:57,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565385085] [2022-07-11 23:47:57,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565385085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:47:57,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:47:57,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:47:57,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711042360] [2022-07-11 23:47:57,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:47:57,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:47:57,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:47:57,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:47:57,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:47:57,107 INFO L87 Difference]: Start difference. First operand 376 states and 519 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:47:57,319 INFO L93 Difference]: Finished difference Result 754 states and 1041 transitions. [2022-07-11 23:47:57,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:47:57,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 19 [2022-07-11 23:47:57,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:47:57,323 INFO L225 Difference]: With dead ends: 754 [2022-07-11 23:47:57,323 INFO L226 Difference]: Without dead ends: 382 [2022-07-11 23:47:57,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:47:57,326 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 2 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:47:57,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1537 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:47:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-07-11 23:47:57,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2022-07-11 23:47:57,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 278 states have (on average 1.356115107913669) internal successors, (377), 294 states have internal predecessors, (377), 80 states have call successors, (80), 22 states have call predecessors, (80), 21 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-07-11 23:47:57,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2022-07-11 23:47:57,351 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 19 [2022-07-11 23:47:57,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:47:57,351 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2022-07-11 23:47:57,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:47:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2022-07-11 23:47:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-11 23:47:57,353 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:47:57,353 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:47:57,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:47:57,353 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:47:57,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:47:57,354 INFO L85 PathProgramCache]: Analyzing trace with hash -908911237, now seen corresponding path program 1 times [2022-07-11 23:47:57,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:47:57,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979269094] [2022-07-11 23:47:57,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:47:57,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:47:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:00,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:48:00,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:00,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979269094] [2022-07-11 23:48:00,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979269094] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:00,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:00,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:48:00,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044213970] [2022-07-11 23:48:00,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:00,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:48:00,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:00,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:48:00,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:48:00,279 INFO L87 Difference]: Start difference. First operand 380 states and 523 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:00,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:00,482 INFO L93 Difference]: Finished difference Result 400 states and 549 transitions. [2022-07-11 23:48:00,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:48:00,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-07-11 23:48:00,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:00,486 INFO L225 Difference]: With dead ends: 400 [2022-07-11 23:48:00,486 INFO L226 Difference]: Without dead ends: 380 [2022-07-11 23:48:00,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:48:00,488 INFO L413 NwaCegarLoop]: 517 mSDtfsCounter, 12 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:00,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 979 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:48:00,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-07-11 23:48:00,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-07-11 23:48:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 278 states have (on average 1.3525179856115108) internal successors, (376), 294 states have internal predecessors, (376), 80 states have call successors, (80), 22 states have call predecessors, (80), 21 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2022-07-11 23:48:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 522 transitions. [2022-07-11 23:48:00,511 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 522 transitions. Word has length 23 [2022-07-11 23:48:00,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:00,511 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 522 transitions. [2022-07-11 23:48:00,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:00,512 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 522 transitions. [2022-07-11 23:48:00,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-11 23:48:00,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:00,513 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:00,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:48:00,513 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:00,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:00,514 INFO L85 PathProgramCache]: Analyzing trace with hash 2145614325, now seen corresponding path program 1 times [2022-07-11 23:48:00,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:00,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112399902] [2022-07-11 23:48:00,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:00,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:48:02,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:02,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112399902] [2022-07-11 23:48:02,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112399902] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:02,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:02,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:48:02,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496219563] [2022-07-11 23:48:02,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:02,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:48:02,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:02,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:48:02,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:48:02,858 INFO L87 Difference]: Start difference. First operand 380 states and 522 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:04,951 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:05,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:05,290 INFO L93 Difference]: Finished difference Result 884 states and 1237 transitions. [2022-07-11 23:48:05,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:48:05,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-11 23:48:05,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:05,297 INFO L225 Difference]: With dead ends: 884 [2022-07-11 23:48:05,297 INFO L226 Difference]: Without dead ends: 624 [2022-07-11 23:48:05,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:48:05,300 INFO L413 NwaCegarLoop]: 729 mSDtfsCounter, 438 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:05,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1087 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 75 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-07-11 23:48:05,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-07-11 23:48:05,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 604. [2022-07-11 23:48:05,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 445 states have (on average 1.3370786516853932) internal successors, (595), 455 states have internal predecessors, (595), 120 states have call successors, (120), 39 states have call predecessors, (120), 38 states have return successors, (129), 113 states have call predecessors, (129), 109 states have call successors, (129) [2022-07-11 23:48:05,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 844 transitions. [2022-07-11 23:48:05,335 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 844 transitions. Word has length 25 [2022-07-11 23:48:05,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:05,335 INFO L495 AbstractCegarLoop]: Abstraction has 604 states and 844 transitions. [2022-07-11 23:48:05,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 844 transitions. [2022-07-11 23:48:05,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-11 23:48:05,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:05,338 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:05,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:48:05,338 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:05,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:05,339 INFO L85 PathProgramCache]: Analyzing trace with hash 24371751, now seen corresponding path program 1 times [2022-07-11 23:48:05,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:05,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146689707] [2022-07-11 23:48:05,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:05,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:07,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:48:07,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:07,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146689707] [2022-07-11 23:48:07,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146689707] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:07,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:07,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:48:07,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158427428] [2022-07-11 23:48:07,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:07,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:48:07,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:07,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:48:07,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:48:07,531 INFO L87 Difference]: Start difference. First operand 604 states and 844 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, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:07,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:07,683 INFO L93 Difference]: Finished difference Result 1428 states and 2036 transitions. [2022-07-11 23:48:07,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:48:07,683 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, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-11 23:48:07,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:07,691 INFO L225 Difference]: With dead ends: 1428 [2022-07-11 23:48:07,691 INFO L226 Difference]: Without dead ends: 965 [2022-07-11 23:48:07,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:48:07,696 INFO L413 NwaCegarLoop]: 598 mSDtfsCounter, 428 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 945 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.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:07,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 945 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:48:07,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2022-07-11 23:48:07,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 935. [2022-07-11 23:48:07,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 683 states have (on average 1.3440702781844802) internal successors, (918), 694 states have internal predecessors, (918), 189 states have call successors, (189), 62 states have call predecessors, (189), 62 states have return successors, (223), 183 states have call predecessors, (223), 179 states have call successors, (223) [2022-07-11 23:48:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1330 transitions. [2022-07-11 23:48:07,749 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1330 transitions. Word has length 33 [2022-07-11 23:48:07,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:07,750 INFO L495 AbstractCegarLoop]: Abstraction has 935 states and 1330 transitions. [2022-07-11 23:48:07,750 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, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1330 transitions. [2022-07-11 23:48:07,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-11 23:48:07,755 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:07,756 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:07,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:48:07,756 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:07,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:07,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1069292676, now seen corresponding path program 1 times [2022-07-11 23:48:07,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:07,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600977131] [2022-07-11 23:48:07,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:07,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:48:09,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:09,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600977131] [2022-07-11 23:48:09,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600977131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:09,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:09,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:48:09,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997360501] [2022-07-11 23:48:09,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:09,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:48:09,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:09,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:48:09,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:48:09,937 INFO L87 Difference]: Start difference. First operand 935 states and 1330 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:12,018 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:12,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:12,216 INFO L93 Difference]: Finished difference Result 949 states and 1349 transitions. [2022-07-11 23:48:12,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:48:12,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-11 23:48:12,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:12,222 INFO L225 Difference]: With dead ends: 949 [2022-07-11 23:48:12,223 INFO L226 Difference]: Without dead ends: 945 [2022-07-11 23:48:12,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:48:12,224 INFO L413 NwaCegarLoop]: 493 mSDtfsCounter, 28 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:12,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 923 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-11 23:48:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2022-07-11 23:48:12,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 944. [2022-07-11 23:48:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 693 states have (on average 1.3434343434343434) internal successors, (931), 702 states have internal predecessors, (931), 188 states have call successors, (188), 63 states have call predecessors, (188), 62 states have return successors, (223), 183 states have call predecessors, (223), 179 states have call successors, (223) [2022-07-11 23:48:12,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1342 transitions. [2022-07-11 23:48:12,264 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1342 transitions. Word has length 33 [2022-07-11 23:48:12,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:12,264 INFO L495 AbstractCegarLoop]: Abstraction has 944 states and 1342 transitions. [2022-07-11 23:48:12,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:48:12,265 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1342 transitions. [2022-07-11 23:48:12,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-11 23:48:12,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:12,266 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:12,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:48:12,267 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:12,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:12,267 INFO L85 PathProgramCache]: Analyzing trace with hash 30875736, now seen corresponding path program 1 times [2022-07-11 23:48:12,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:12,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930744600] [2022-07-11 23:48:12,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:12,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:14,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:48:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:14,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:48:14,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:14,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930744600] [2022-07-11 23:48:14,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930744600] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:14,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:14,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:48:14,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659775205] [2022-07-11 23:48:14,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:14,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:48:14,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:14,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:48:14,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:48:14,253 INFO L87 Difference]: Start difference. First operand 944 states and 1342 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:48:16,471 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:18,534 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:21,794 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-11 23:48:23,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:23,118 INFO L93 Difference]: Finished difference Result 1001 states and 1423 transitions. [2022-07-11 23:48:23,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:48:23,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 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 37 [2022-07-11 23:48:23,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:23,125 INFO L225 Difference]: With dead ends: 1001 [2022-07-11 23:48:23,125 INFO L226 Difference]: Without dead ends: 990 [2022-07-11 23:48:23,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:48:23,126 INFO L413 NwaCegarLoop]: 470 mSDtfsCounter, 655 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 138 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:23,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1112 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 664 Invalid, 3 Unknown, 0 Unchecked, 8.6s Time] [2022-07-11 23:48:23,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2022-07-11 23:48:23,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 968. [2022-07-11 23:48:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 715 states have (on average 1.3426573426573427) internal successors, (960), 726 states have internal predecessors, (960), 188 states have call successors, (188), 63 states have call predecessors, (188), 64 states have return successors, (232), 183 states have call predecessors, (232), 179 states have call successors, (232) [2022-07-11 23:48:23,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1380 transitions. [2022-07-11 23:48:23,169 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1380 transitions. Word has length 37 [2022-07-11 23:48:23,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:23,170 INFO L495 AbstractCegarLoop]: Abstraction has 968 states and 1380 transitions. [2022-07-11 23:48:23,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:48:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1380 transitions. [2022-07-11 23:48:23,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-11 23:48:23,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:23,172 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:23,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:48:23,172 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:23,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:23,173 INFO L85 PathProgramCache]: Analyzing trace with hash 521007993, now seen corresponding path program 1 times [2022-07-11 23:48:23,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:23,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446905220] [2022-07-11 23:48:23,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:23,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:25,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:48:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:48:25,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:25,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446905220] [2022-07-11 23:48:25,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446905220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:25,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:25,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:48:25,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272963780] [2022-07-11 23:48:25,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:25,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:48:25,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:25,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:48:25,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:48:25,220 INFO L87 Difference]: Start difference. First operand 968 states and 1380 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:48:27,390 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:29,432 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:32,053 INFO L93 Difference]: Finished difference Result 992 states and 1408 transitions. [2022-07-11 23:48:32,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:48:32,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 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 38 [2022-07-11 23:48:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:32,059 INFO L225 Difference]: With dead ends: 992 [2022-07-11 23:48:32,059 INFO L226 Difference]: Without dead ends: 984 [2022-07-11 23:48:32,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:48:32,060 INFO L413 NwaCegarLoop]: 469 mSDtfsCounter, 644 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 134 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:32,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 1106 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 661 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-07-11 23:48:32,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2022-07-11 23:48:32,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 968. [2022-07-11 23:48:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 715 states have (on average 1.3412587412587413) internal successors, (959), 726 states have internal predecessors, (959), 188 states have call successors, (188), 63 states have call predecessors, (188), 64 states have return successors, (232), 183 states have call predecessors, (232), 179 states have call successors, (232) [2022-07-11 23:48:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1379 transitions. [2022-07-11 23:48:32,097 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1379 transitions. Word has length 38 [2022-07-11 23:48:32,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:32,097 INFO L495 AbstractCegarLoop]: Abstraction has 968 states and 1379 transitions. [2022-07-11 23:48:32,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:48:32,098 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1379 transitions. [2022-07-11 23:48:32,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-11 23:48:32,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:32,099 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:32,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:48:32,099 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:32,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:32,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1295756881, now seen corresponding path program 1 times [2022-07-11 23:48:32,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:32,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612410318] [2022-07-11 23:48:32,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:32,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:33,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:48:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:33,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:48:33,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:33,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612410318] [2022-07-11 23:48:33,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612410318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:33,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:33,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:48:33,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709163340] [2022-07-11 23:48:33,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:33,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:48:33,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:33,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:48:33,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:48:33,846 INFO L87 Difference]: Start difference. First operand 968 states and 1379 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:48:35,950 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:37,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:37,411 INFO L93 Difference]: Finished difference Result 1775 states and 2563 transitions. [2022-07-11 23:48:37,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:48:37,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 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 39 [2022-07-11 23:48:37,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:37,421 INFO L225 Difference]: With dead ends: 1775 [2022-07-11 23:48:37,421 INFO L226 Difference]: Without dead ends: 1746 [2022-07-11 23:48:37,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:48:37,423 INFO L413 NwaCegarLoop]: 613 mSDtfsCounter, 681 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 138 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:37,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 1112 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 291 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-07-11 23:48:37,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2022-07-11 23:48:37,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1707. [2022-07-11 23:48:37,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1248 states have (on average 1.3493589743589745) internal successors, (1684), 1263 states have internal predecessors, (1684), 338 states have call successors, (338), 119 states have call predecessors, (338), 120 states have return successors, (446), 334 states have call predecessors, (446), 329 states have call successors, (446) [2022-07-11 23:48:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2468 transitions. [2022-07-11 23:48:37,495 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2468 transitions. Word has length 39 [2022-07-11 23:48:37,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:37,496 INFO L495 AbstractCegarLoop]: Abstraction has 1707 states and 2468 transitions. [2022-07-11 23:48:37,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:48:37,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2468 transitions. [2022-07-11 23:48:37,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-11 23:48:37,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:37,497 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:37,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:48:37,498 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:37,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:37,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1505314783, now seen corresponding path program 1 times [2022-07-11 23:48:37,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:37,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821155022] [2022-07-11 23:48:37,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:37,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:39,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:48:39,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:39,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:48:39,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:39,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821155022] [2022-07-11 23:48:39,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821155022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:39,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:39,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:48:39,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722644319] [2022-07-11 23:48:39,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:39,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:48:39,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:39,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:48:39,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:48:39,678 INFO L87 Difference]: Start difference. First operand 1707 states and 2468 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:48:41,770 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:43,841 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:45,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:45,909 INFO L93 Difference]: Finished difference Result 1740 states and 2513 transitions. [2022-07-11 23:48:45,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:48:45,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 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 40 [2022-07-11 23:48:45,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:45,918 INFO L225 Difference]: With dead ends: 1740 [2022-07-11 23:48:45,919 INFO L226 Difference]: Without dead ends: 1722 [2022-07-11 23:48:45,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:48:45,921 INFO L413 NwaCegarLoop]: 478 mSDtfsCounter, 152 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 71 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:45,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1367 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 437 Invalid, 2 Unknown, 0 Unchecked, 6.1s Time] [2022-07-11 23:48:45,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2022-07-11 23:48:45,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1703. [2022-07-11 23:48:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1245 states have (on average 1.3493975903614457) internal successors, (1680), 1260 states have internal predecessors, (1680), 337 states have call successors, (337), 119 states have call predecessors, (337), 120 states have return successors, (445), 333 states have call predecessors, (445), 328 states have call successors, (445) [2022-07-11 23:48:45,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2462 transitions. [2022-07-11 23:48:45,989 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2462 transitions. Word has length 40 [2022-07-11 23:48:45,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:45,989 INFO L495 AbstractCegarLoop]: Abstraction has 1703 states and 2462 transitions. [2022-07-11 23:48:45,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:48:45,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2462 transitions. [2022-07-11 23:48:45,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 23:48:45,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:45,991 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:45,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-11 23:48:45,991 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:45,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:45,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1296764344, now seen corresponding path program 1 times [2022-07-11 23:48:45,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:45,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514928023] [2022-07-11 23:48:45,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:45,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:48:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:47,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-11 23:48:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:48:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:48:47,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:48:47,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514928023] [2022-07-11 23:48:47,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514928023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:48:47,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:48:47,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:48:47,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403846202] [2022-07-11 23:48:47,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:48:47,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:48:47,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:48:47,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:48:47,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:48:47,823 INFO L87 Difference]: Start difference. First operand 1703 states and 2462 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:48:49,922 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:52,033 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:54,055 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:48:56,566 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-11 23:48:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:48:58,510 INFO L93 Difference]: Finished difference Result 2673 states and 4091 transitions. [2022-07-11 23:48:58,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:48:58,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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 43 [2022-07-11 23:48:58,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:48:58,536 INFO L225 Difference]: With dead ends: 2673 [2022-07-11 23:48:58,536 INFO L226 Difference]: Without dead ends: 2665 [2022-07-11 23:48:58,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:48:58,539 INFO L413 NwaCegarLoop]: 609 mSDtfsCounter, 432 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 138 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:48:58,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1129 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 608 Invalid, 3 Unknown, 0 Unchecked, 10.5s Time] [2022-07-11 23:48:58,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2022-07-11 23:48:58,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 1845. [2022-07-11 23:48:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1845 states, 1347 states have (on average 1.3511507052709726) internal successors, (1820), 1366 states have internal predecessors, (1820), 365 states have call successors, (365), 128 states have call predecessors, (365), 132 states have return successors, (494), 360 states have call predecessors, (494), 356 states have call successors, (494) [2022-07-11 23:48:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2679 transitions. [2022-07-11 23:48:58,656 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2679 transitions. Word has length 43 [2022-07-11 23:48:58,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:48:58,657 INFO L495 AbstractCegarLoop]: Abstraction has 1845 states and 2679 transitions. [2022-07-11 23:48:58,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:48:58,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2679 transitions. [2022-07-11 23:48:58,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:48:58,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:48:58,658 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:48:58,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-11 23:48:58,659 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:48:58,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:48:58,659 INFO L85 PathProgramCache]: Analyzing trace with hash 239217347, now seen corresponding path program 1 times [2022-07-11 23:48:58,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:48:58,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478238989] [2022-07-11 23:48:58,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:48:58,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:00,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-11 23:49:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:49:00,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:00,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478238989] [2022-07-11 23:49:00,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478238989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:00,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:00,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:49:00,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474179162] [2022-07-11 23:49:00,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:00,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:49:00,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:00,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:49:00,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:49:00,483 INFO L87 Difference]: Start difference. First operand 1845 states and 2679 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:49:02,572 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:04,666 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:08,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:08,469 INFO L93 Difference]: Finished difference Result 1894 states and 2742 transitions. [2022-07-11 23:49:08,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:49:08,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-07-11 23:49:08,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:08,479 INFO L225 Difference]: With dead ends: 1894 [2022-07-11 23:49:08,479 INFO L226 Difference]: Without dead ends: 1862 [2022-07-11 23:49:08,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:49:08,481 INFO L413 NwaCegarLoop]: 483 mSDtfsCounter, 165 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 72 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:08,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1691 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 624 Invalid, 2 Unknown, 0 Unchecked, 7.8s Time] [2022-07-11 23:49:08,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2022-07-11 23:49:08,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1843. [2022-07-11 23:49:08,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1843 states, 1346 states have (on average 1.349925705794948) internal successors, (1817), 1365 states have internal predecessors, (1817), 364 states have call successors, (364), 128 states have call predecessors, (364), 132 states have return successors, (493), 359 states have call predecessors, (493), 355 states have call successors, (493) [2022-07-11 23:49:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 2674 transitions. [2022-07-11 23:49:08,637 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 2674 transitions. Word has length 44 [2022-07-11 23:49:08,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:08,639 INFO L495 AbstractCegarLoop]: Abstraction has 1843 states and 2674 transitions. [2022-07-11 23:49:08,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:49:08,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2674 transitions. [2022-07-11 23:49:08,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:49:08,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:08,640 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:49:08,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-11 23:49:08,641 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:08,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:08,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1091853957, now seen corresponding path program 1 times [2022-07-11 23:49:08,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:08,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137999068] [2022-07-11 23:49:08,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:08,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:10,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-11 23:49:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:49:10,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:10,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137999068] [2022-07-11 23:49:10,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137999068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:10,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:10,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:49:10,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715884367] [2022-07-11 23:49:10,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:10,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:49:10,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:10,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:49:10,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:49:10,559 INFO L87 Difference]: Start difference. First operand 1843 states and 2674 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:49:12,680 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:14,784 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:16,820 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:23,144 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:24,105 INFO L93 Difference]: Finished difference Result 2675 states and 4088 transitions. [2022-07-11 23:49:24,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:49:24,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-07-11 23:49:24,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:24,121 INFO L225 Difference]: With dead ends: 2675 [2022-07-11 23:49:24,121 INFO L226 Difference]: Without dead ends: 2667 [2022-07-11 23:49:24,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:49:24,124 INFO L413 NwaCegarLoop]: 583 mSDtfsCounter, 1200 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 477 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 477 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:24,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 1241 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [477 Valid, 986 Invalid, 4 Unknown, 0 Unchecked, 12.9s Time] [2022-07-11 23:49:24,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2022-07-11 23:49:24,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 1843. [2022-07-11 23:49:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1843 states, 1346 states have (on average 1.349182763744428) internal successors, (1816), 1365 states have internal predecessors, (1816), 364 states have call successors, (364), 128 states have call predecessors, (364), 132 states have return successors, (493), 359 states have call predecessors, (493), 355 states have call successors, (493) [2022-07-11 23:49:24,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 2673 transitions. [2022-07-11 23:49:24,241 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 2673 transitions. Word has length 44 [2022-07-11 23:49:24,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:24,242 INFO L495 AbstractCegarLoop]: Abstraction has 1843 states and 2673 transitions. [2022-07-11 23:49:24,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:49:24,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2673 transitions. [2022-07-11 23:49:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:49:24,243 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:24,243 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:49:24,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-11 23:49:24,243 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:24,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:24,244 INFO L85 PathProgramCache]: Analyzing trace with hash -376452844, now seen corresponding path program 1 times [2022-07-11 23:49:24,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:24,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551852386] [2022-07-11 23:49:24,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:24,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:26,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-11 23:49:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:49:26,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:26,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551852386] [2022-07-11 23:49:26,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551852386] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:26,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:26,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:49:26,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049610224] [2022-07-11 23:49:26,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:26,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:49:26,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:26,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:49:26,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:49:26,164 INFO L87 Difference]: Start difference. First operand 1843 states and 2673 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:49:28,281 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:30,408 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:32,442 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:37,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:49:37,467 INFO L93 Difference]: Finished difference Result 2667 states and 4078 transitions. [2022-07-11 23:49:37,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:49:37,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-07-11 23:49:37,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:49:37,485 INFO L225 Difference]: With dead ends: 2667 [2022-07-11 23:49:37,485 INFO L226 Difference]: Without dead ends: 2663 [2022-07-11 23:49:37,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:49:37,488 INFO L413 NwaCegarLoop]: 585 mSDtfsCounter, 1183 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 474 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:49:37,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 1242 Invalid, 1462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 985 Invalid, 3 Unknown, 0 Unchecked, 10.7s Time] [2022-07-11 23:49:37,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2022-07-11 23:49:37,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 1845. [2022-07-11 23:49:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1845 states, 1348 states have (on average 1.3486646884272997) internal successors, (1818), 1367 states have internal predecessors, (1818), 364 states have call successors, (364), 128 states have call predecessors, (364), 132 states have return successors, (493), 359 states have call predecessors, (493), 355 states have call successors, (493) [2022-07-11 23:49:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2675 transitions. [2022-07-11 23:49:37,711 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2675 transitions. Word has length 45 [2022-07-11 23:49:37,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:49:37,712 INFO L495 AbstractCegarLoop]: Abstraction has 1845 states and 2675 transitions. [2022-07-11 23:49:37,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:49:37,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2675 transitions. [2022-07-11 23:49:37,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:49:37,713 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:49:37,713 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:49:37,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-11 23:49:37,714 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:49:37,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:49:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash -376176014, now seen corresponding path program 1 times [2022-07-11 23:49:37,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:49:37,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668847137] [2022-07-11 23:49:37,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:49:37,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:49:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:39,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-11 23:49:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:49:39,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:49:39,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:49:39,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668847137] [2022-07-11 23:49:39,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668847137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:49:39,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:49:39,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-11 23:49:39,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850816653] [2022-07-11 23:49:39,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:49:39,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:49:39,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:49:39,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:49:39,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:49:39,673 INFO L87 Difference]: Start difference. First operand 1845 states and 2675 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:49:41,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:43,891 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:46,006 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:48,037 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:50,074 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:52,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:54,138 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:49:56,169 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:03,106 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:03,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:50:03,948 INFO L93 Difference]: Finished difference Result 2012 states and 3011 transitions. [2022-07-11 23:50:03,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:50:03,949 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-07-11 23:50:03,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:50:03,959 INFO L225 Difference]: With dead ends: 2012 [2022-07-11 23:50:03,959 INFO L226 Difference]: Without dead ends: 1996 [2022-07-11 23:50:03,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:50:03,964 INFO L413 NwaCegarLoop]: 484 mSDtfsCounter, 87 mSDsluCounter, 1964 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 75 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:50:03,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 2448 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1034 Invalid, 9 Unknown, 0 Unchecked, 24.1s Time] [2022-07-11 23:50:03,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2022-07-11 23:50:04,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1842. [2022-07-11 23:50:04,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1346 states have (on average 1.348439821693908) internal successors, (1815), 1365 states have internal predecessors, (1815), 363 states have call successors, (363), 128 states have call predecessors, (363), 132 states have return successors, (492), 358 states have call predecessors, (492), 354 states have call successors, (492) [2022-07-11 23:50:04,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2670 transitions. [2022-07-11 23:50:04,087 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2670 transitions. Word has length 45 [2022-07-11 23:50:04,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:50:04,087 INFO L495 AbstractCegarLoop]: Abstraction has 1842 states and 2670 transitions. [2022-07-11 23:50:04,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:50:04,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2670 transitions. [2022-07-11 23:50:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:50:04,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:50:04,089 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:50:04,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-11 23:50:04,089 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:50:04,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:50:04,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1564230585, now seen corresponding path program 1 times [2022-07-11 23:50:04,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:50:04,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713034519] [2022-07-11 23:50:04,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:50:04,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:50:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:50:06,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:50:06,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713034519] [2022-07-11 23:50:06,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713034519] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:50:06,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:50:06,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:50:06,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675061710] [2022-07-11 23:50:06,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:50:06,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:50:06,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:50:06,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:50:06,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:50:06,080 INFO L87 Difference]: Start difference. First operand 1842 states and 2670 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:50:06,949 INFO L93 Difference]: Finished difference Result 1869 states and 2695 transitions. [2022-07-11 23:50:06,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:50:06,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 44 [2022-07-11 23:50:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:50:06,961 INFO L225 Difference]: With dead ends: 1869 [2022-07-11 23:50:06,962 INFO L226 Difference]: Without dead ends: 1845 [2022-07-11 23:50:06,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:50:06,965 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 485 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-11 23:50:06,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 766 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-11 23:50:06,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2022-07-11 23:50:07,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1834. [2022-07-11 23:50:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1339 states have (on average 1.3487677371172517) internal successors, (1806), 1359 states have internal predecessors, (1806), 363 states have call successors, (363), 128 states have call predecessors, (363), 131 states have return successors, (490), 356 states have call predecessors, (490), 354 states have call successors, (490) [2022-07-11 23:50:07,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2659 transitions. [2022-07-11 23:50:07,091 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2659 transitions. Word has length 44 [2022-07-11 23:50:07,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:50:07,091 INFO L495 AbstractCegarLoop]: Abstraction has 1834 states and 2659 transitions. [2022-07-11 23:50:07,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:07,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2659 transitions. [2022-07-11 23:50:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:50:07,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:50:07,093 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:50:07,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-11 23:50:07,093 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:50:07,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:50:07,094 INFO L85 PathProgramCache]: Analyzing trace with hash -47913128, now seen corresponding path program 1 times [2022-07-11 23:50:07,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:50:07,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975481854] [2022-07-11 23:50:07,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:50:07,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:50:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:08,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:50:08,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:50:08,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975481854] [2022-07-11 23:50:08,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975481854] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:50:08,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:50:08,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:50:08,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768958626] [2022-07-11 23:50:08,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:50:08,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:50:08,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:50:08,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:50:08,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:50:08,813 INFO L87 Difference]: Start difference. First operand 1834 states and 2659 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:09,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:50:09,603 INFO L93 Difference]: Finished difference Result 1872 states and 2700 transitions. [2022-07-11 23:50:09,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:50:09,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 44 [2022-07-11 23:50:09,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:50:09,612 INFO L225 Difference]: With dead ends: 1872 [2022-07-11 23:50:09,612 INFO L226 Difference]: Without dead ends: 1835 [2022-07-11 23:50:09,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:50:09,616 INFO L413 NwaCegarLoop]: 472 mSDtfsCounter, 472 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:50:09,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 775 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:50:09,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2022-07-11 23:50:09,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1833. [2022-07-11 23:50:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1338 states have (on average 1.3467862481315396) internal successors, (1802), 1358 states have internal predecessors, (1802), 363 states have call successors, (363), 128 states have call predecessors, (363), 131 states have return successors, (489), 356 states have call predecessors, (489), 354 states have call successors, (489) [2022-07-11 23:50:09,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2654 transitions. [2022-07-11 23:50:09,728 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2654 transitions. Word has length 44 [2022-07-11 23:50:09,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:50:09,728 INFO L495 AbstractCegarLoop]: Abstraction has 1833 states and 2654 transitions. [2022-07-11 23:50:09,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2654 transitions. [2022-07-11 23:50:09,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:50:09,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:50:09,730 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:50:09,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-11 23:50:09,730 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:50:09,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:50:09,730 INFO L85 PathProgramCache]: Analyzing trace with hash -621902248, now seen corresponding path program 1 times [2022-07-11 23:50:09,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:50:09,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075198334] [2022-07-11 23:50:09,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:50:09,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:50:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:50:11,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:50:11,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075198334] [2022-07-11 23:50:11,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075198334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:50:11,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:50:11,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:50:11,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936076387] [2022-07-11 23:50:11,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:50:11,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:50:11,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:50:11,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:50:11,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:50:11,592 INFO L87 Difference]: Start difference. First operand 1833 states and 2654 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:13,660 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:14,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:50:14,029 INFO L93 Difference]: Finished difference Result 2582 states and 3846 transitions. [2022-07-11 23:50:14,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:50:14,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 44 [2022-07-11 23:50:14,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:50:14,043 INFO L225 Difference]: With dead ends: 2582 [2022-07-11 23:50:14,044 INFO L226 Difference]: Without dead ends: 2569 [2022-07-11 23:50:14,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:50:14,046 INFO L413 NwaCegarLoop]: 776 mSDtfsCounter, 328 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:50:14,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1194 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-11 23:50:14,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2022-07-11 23:50:14,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 1833. [2022-07-11 23:50:14,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1338 states have (on average 1.344544095665172) internal successors, (1799), 1358 states have internal predecessors, (1799), 362 states have call successors, (362), 128 states have call predecessors, (362), 132 states have return successors, (497), 356 states have call predecessors, (497), 354 states have call successors, (497) [2022-07-11 23:50:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2658 transitions. [2022-07-11 23:50:14,264 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2658 transitions. Word has length 44 [2022-07-11 23:50:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:50:14,264 INFO L495 AbstractCegarLoop]: Abstraction has 1833 states and 2658 transitions. [2022-07-11 23:50:14,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:14,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2658 transitions. [2022-07-11 23:50:14,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:50:14,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:50:14,266 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:50:14,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-11 23:50:14,267 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:50:14,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:50:14,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1645965461, now seen corresponding path program 1 times [2022-07-11 23:50:14,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:50:14,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572520420] [2022-07-11 23:50:14,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:50:14,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:50:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:50:16,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:50:16,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572520420] [2022-07-11 23:50:16,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572520420] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:50:16,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:50:16,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:50:16,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310217131] [2022-07-11 23:50:16,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:50:16,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:50:16,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:50:16,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:50:16,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:50:16,032 INFO L87 Difference]: Start difference. First operand 1833 states and 2658 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:17,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:50:17,269 INFO L93 Difference]: Finished difference Result 2569 states and 3830 transitions. [2022-07-11 23:50:17,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:50:17,272 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 45 [2022-07-11 23:50:17,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:50:17,280 INFO L225 Difference]: With dead ends: 2569 [2022-07-11 23:50:17,280 INFO L226 Difference]: Without dead ends: 2565 [2022-07-11 23:50:17,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:50:17,282 INFO L413 NwaCegarLoop]: 761 mSDtfsCounter, 681 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:50:17,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 1067 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-11 23:50:17,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2022-07-11 23:50:17,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1831. [2022-07-11 23:50:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1831 states, 1336 states have (on average 1.344311377245509) internal successors, (1796), 1356 states have internal predecessors, (1796), 362 states have call successors, (362), 128 states have call predecessors, (362), 132 states have return successors, (497), 356 states have call predecessors, (497), 354 states have call successors, (497) [2022-07-11 23:50:17,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2655 transitions. [2022-07-11 23:50:17,402 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2655 transitions. Word has length 45 [2022-07-11 23:50:17,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:50:17,403 INFO L495 AbstractCegarLoop]: Abstraction has 1831 states and 2655 transitions. [2022-07-11 23:50:17,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2655 transitions. [2022-07-11 23:50:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-11 23:50:17,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:50:17,404 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:50:17,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-11 23:50:17,404 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:50:17,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:50:17,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1645688631, now seen corresponding path program 1 times [2022-07-11 23:50:17,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:50:17,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538344310] [2022-07-11 23:50:17,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:50:17,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:50:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:50:19,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:50:19,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538344310] [2022-07-11 23:50:19,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538344310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:50:19,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:50:19,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:50:19,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174105002] [2022-07-11 23:50:19,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:50:19,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:50:19,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:50:19,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:50:19,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:50:19,139 INFO L87 Difference]: Start difference. First operand 1831 states and 2655 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:21,272 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:23,428 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:25,459 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:27,493 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:29,526 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:29,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:50:29,868 INFO L93 Difference]: Finished difference Result 1843 states and 2667 transitions. [2022-07-11 23:50:29,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:50:29,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 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 45 [2022-07-11 23:50:29,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:50:29,875 INFO L225 Difference]: With dead ends: 1843 [2022-07-11 23:50:29,876 INFO L226 Difference]: Without dead ends: 1816 [2022-07-11 23:50:29,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:50:29,878 INFO L413 NwaCegarLoop]: 468 mSDtfsCounter, 34 mSDsluCounter, 1821 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 2289 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:50:29,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 2289 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 5 Unknown, 0 Unchecked, 10.6s Time] [2022-07-11 23:50:29,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2022-07-11 23:50:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1816. [2022-07-11 23:50:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1816 states, 1321 states have (on average 1.3459500378501135) internal successors, (1778), 1341 states have internal predecessors, (1778), 362 states have call successors, (362), 128 states have call predecessors, (362), 132 states have return successors, (497), 356 states have call predecessors, (497), 354 states have call successors, (497) [2022-07-11 23:50:29,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2637 transitions. [2022-07-11 23:50:29,990 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2637 transitions. Word has length 45 [2022-07-11 23:50:29,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:50:29,990 INFO L495 AbstractCegarLoop]: Abstraction has 1816 states and 2637 transitions. [2022-07-11 23:50:29,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:50:29,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2637 transitions. [2022-07-11 23:50:29,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-11 23:50:29,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:50:29,991 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:50:29,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-11 23:50:29,992 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:50:29,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:50:29,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1082898128, now seen corresponding path program 1 times [2022-07-11 23:50:29,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:50:29,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766214794] [2022-07-11 23:50:29,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:50:29,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:50:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:31,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-11 23:50:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:50:32,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:50:32,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766214794] [2022-07-11 23:50:32,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766214794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:50:32,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:50:32,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-11 23:50:32,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453459794] [2022-07-11 23:50:32,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:50:32,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:50:32,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:50:32,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:50:32,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:50:32,061 INFO L87 Difference]: Start difference. First operand 1816 states and 2637 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:50:34,256 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:36,368 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:38,465 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:40,499 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:42,529 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:44,560 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:46,593 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:48,635 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:50:53,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:50:53,870 INFO L93 Difference]: Finished difference Result 1976 states and 2965 transitions. [2022-07-11 23:50:53,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:50:53,871 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 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 47 [2022-07-11 23:50:53,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:50:53,878 INFO L225 Difference]: With dead ends: 1976 [2022-07-11 23:50:53,878 INFO L226 Difference]: Without dead ends: 1957 [2022-07-11 23:50:53,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:50:53,880 INFO L413 NwaCegarLoop]: 449 mSDtfsCounter, 87 mSDsluCounter, 1806 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 71 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:50:53,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 2255 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 998 Invalid, 8 Unknown, 0 Unchecked, 21.6s Time] [2022-07-11 23:50:53,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2022-07-11 23:50:53,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1803. [2022-07-11 23:50:53,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1803 states, 1309 states have (on average 1.3475935828877006) internal successors, (1764), 1329 states have internal predecessors, (1764), 361 states have call successors, (361), 128 states have call predecessors, (361), 132 states have return successors, (496), 355 states have call predecessors, (496), 353 states have call successors, (496) [2022-07-11 23:50:53,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2621 transitions. [2022-07-11 23:50:53,990 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2621 transitions. Word has length 47 [2022-07-11 23:50:53,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:50:53,990 INFO L495 AbstractCegarLoop]: Abstraction has 1803 states and 2621 transitions. [2022-07-11 23:50:53,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:50:53,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2621 transitions. [2022-07-11 23:50:53,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-11 23:50:53,992 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:50:53,992 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:50:53,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-11 23:50:53,992 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:50:53,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:50:53,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2097232139, now seen corresponding path program 1 times [2022-07-11 23:50:53,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:50:53,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298186029] [2022-07-11 23:50:53,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:50:53,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:50:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:55,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-11 23:50:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:56,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:50:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:50:56,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-11 23:50:56,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:50:56,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298186029] [2022-07-11 23:50:56,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298186029] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:50:56,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:50:56,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-11 23:50:56,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729038488] [2022-07-11 23:50:56,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:50:56,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 23:50:56,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:50:56,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 23:50:56,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:50:56,141 INFO L87 Difference]: Start difference. First operand 1803 states and 2621 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-11 23:50:58,372 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:51:00,511 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:51:02,599 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:51:04,640 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:51:06,685 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:51:08,726 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:51:10,764 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:51:12,809 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-11 23:51:14,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []