./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 6e17534f736f8f0727327ccce9421d9a9e89801b3a6ab68095fc479caa060175 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:43:52,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:43:52,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:43:52,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:43:52,221 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:43:52,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:43:52,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:43:52,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:43:52,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:43:52,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:43:52,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:43:52,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:43:52,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:43:52,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:43:52,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:43:52,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:43:52,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:43:52,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:43:52,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:43:52,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:43:52,253 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:43:52,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:43:52,254 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:43:52,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:43:52,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:43:52,263 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:43:52,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:43:52,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:43:52,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:43:52,266 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:43:52,267 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:43:52,267 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:43:52,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:43:52,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:43:52,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:43:52,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:43:52,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:43:52,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:43:52,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:43:52,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:43:52,273 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:43:52,274 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:43:52,275 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:43:52,303 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:43:52,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:43:52,304 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:43:52,304 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:43:52,305 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:43:52,305 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:43:52,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:43:52,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:43:52,306 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:43:52,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:43:52,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:43:52,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:43:52,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:43:52,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:43:52,308 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:43:52,308 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:43:52,308 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:43:52,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:43:52,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:43:52,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:43:52,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:43:52,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:43:52,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:43:52,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:43:52,311 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:43:52,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:43:52,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:43:52,311 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:43:52,311 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:43:52,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:43:52,312 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e17534f736f8f0727327ccce9421d9a9e89801b3a6ab68095fc479caa060175 [2022-07-12 11:43:52,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:43:52,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:43:52,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:43:52,562 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:43:52,562 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:43:52,564 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2022-07-12 11:43:52,615 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b37c17bbe/ce15ef5bdc89445dad2801555628b045/FLAG93f06c8c0 [2022-07-12 11:43:53,321 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:43:53,322 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2022-07-12 11:43:53,357 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b37c17bbe/ce15ef5bdc89445dad2801555628b045/FLAG93f06c8c0 [2022-07-12 11:43:53,618 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b37c17bbe/ce15ef5bdc89445dad2801555628b045 [2022-07-12 11:43:53,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:43:53,622 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:43:53,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:43:53,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:43:53,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:43:53,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:43:53" (1/1) ... [2022-07-12 11:43:53,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fa62823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:43:53, skipping insertion in model container [2022-07-12 11:43:53,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:43:53" (1/1) ... [2022-07-12 11:43:53,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:43:53,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:43:54,717 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/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i[202834,202847] [2022-07-12 11:43:54,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:43:54,784 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:43:55,074 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/ldv-commit-tester/m0_drivers-net-slip-ko--108_1a--1b0b0ac.i[202834,202847] [2022-07-12 11:43:55,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:43:55,171 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:43:55,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:43:55 WrapperNode [2022-07-12 11:43:55,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:43:55,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:43:55,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:43:55,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:43:55,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:43:55" (1/1) ... [2022-07-12 11:43:55,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:43:55" (1/1) ... [2022-07-12 11:43:55,340 INFO L137 Inliner]: procedures = 157, calls = 810, calls flagged for inlining = 80, calls inlined = 79, statements flattened = 2783 [2022-07-12 11:43:55,341 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:43:55,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:43:55,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:43:55,343 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:43:55,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:43:55" (1/1) ... [2022-07-12 11:43:55,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:43:55" (1/1) ... [2022-07-12 11:43:55,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:43:55" (1/1) ... [2022-07-12 11:43:55,382 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:43:55" (1/1) ... [2022-07-12 11:43:55,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:43:55" (1/1) ... [2022-07-12 11:43:55,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:43:55" (1/1) ... [2022-07-12 11:43:55,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:43:55" (1/1) ... [2022-07-12 11:43:55,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:43:55,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:43:55,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:43:55,559 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:43:55,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:43:55" (1/1) ... [2022-07-12 11:43:55,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:43:55,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:43:55,593 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-12 11:43:55,619 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-12 11:43:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 11:43:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2022-07-12 11:43:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 11:43:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 11:43:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:43:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-12 11:43:55,641 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-12 11:43:55,641 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer_sync [2022-07-12 11:43:55,641 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer_sync [2022-07-12 11:43:55,642 INFO L130 BoogieDeclarations]: Found specification of procedure slhc_free [2022-07-12 11:43:55,642 INFO L138 BoogieDeclarations]: Found implementation of procedure slhc_free [2022-07-12 11:43:55,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 11:43:55,642 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 11:43:55,642 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-12 11:43:55,642 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-12 11:43:55,642 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 11:43:55,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 11:43:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-12 11:43:55,643 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-12 11:43:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive_int [2022-07-12 11:43:55,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive_int [2022-07-12 11:43:55,643 INFO L130 BoogieDeclarations]: Found specification of procedure rtnl_unlock [2022-07-12 11:43:55,644 INFO L138 BoogieDeclarations]: Found implementation of procedure rtnl_unlock [2022-07-12 11:43:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 11:43:55,644 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 11:43:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure sl_free_bufs [2022-07-12 11:43:55,644 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_free_bufs [2022-07-12 11:43:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:43:55,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-12 11:43:55,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-12 11:43:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2022-07-12 11:43:55,645 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2022-07-12 11:43:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-12 11:43:55,645 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-12 11:43:55,645 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 11:43:55,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 11:43:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-12 11:43:55,646 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-12 11:43:55,646 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-07-12 11:43:55,646 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-07-12 11:43:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:43:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure sl_bump [2022-07-12 11:43:55,647 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_bump [2022-07-12 11:43:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure slip_ioctl [2022-07-12 11:43:55,647 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_ioctl [2022-07-12 11:43:55,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:43:55,648 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2022-07-12 11:43:55,648 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2022-07-12 11:43:55,648 INFO L130 BoogieDeclarations]: Found specification of procedure slip_close [2022-07-12 11:43:55,648 INFO L138 BoogieDeclarations]: Found implementation of procedure slip_close [2022-07-12 11:43:55,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:43:55,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:43:55,649 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-12 11:43:55,649 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-12 11:43:55,649 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-12 11:43:55,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:43:55,650 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-07-12 11:43:55,651 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-07-12 11:43:55,651 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-12 11:43:55,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-12 11:43:55,655 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-12 11:43:55,655 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-12 11:43:55,656 INFO L130 BoogieDeclarations]: Found specification of procedure sl_ioctl [2022-07-12 11:43:55,656 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_ioctl [2022-07-12 11:43:55,656 INFO L130 BoogieDeclarations]: Found specification of procedure tty_hangup [2022-07-12 11:43:55,656 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_hangup [2022-07-12 11:43:55,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:43:55,657 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2022-07-12 11:43:55,657 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2022-07-12 11:43:55,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:43:55,657 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2022-07-12 11:43:55,657 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2022-07-12 11:43:55,657 INFO L130 BoogieDeclarations]: Found specification of procedure tty_devnum [2022-07-12 11:43:55,657 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_devnum [2022-07-12 11:43:55,658 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-12 11:43:55,658 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-12 11:43:55,658 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-12 11:43:55,658 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-12 11:43:55,659 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-12 11:43:55,659 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-12 11:43:55,659 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-12 11:43:55,659 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-12 11:43:55,659 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-12 11:43:55,659 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-12 11:43:55,660 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-12 11:43:55,660 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-12 11:43:55,660 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-12 11:43:55,660 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-12 11:43:55,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:43:55,661 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-07-12 11:43:55,661 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-07-12 11:43:55,661 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2022-07-12 11:43:55,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2022-07-12 11:43:55,661 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_clear_bit [2022-07-12 11:43:55,662 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_clear_bit [2022-07-12 11:43:55,662 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-07-12 11:43:55,662 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-07-12 11:43:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 11:43:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:43:55,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:43:55,663 INFO L130 BoogieDeclarations]: Found specification of procedure sl_unlock [2022-07-12 11:43:55,664 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_unlock [2022-07-12 11:43:55,664 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-07-12 11:43:55,664 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-07-12 11:43:56,161 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:43:56,163 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:43:58,044 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:43:58,063 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:43:58,063 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 11:43:58,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:43:58 BoogieIcfgContainer [2022-07-12 11:43:58,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:43:58,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:43:58,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:43:58,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:43:58,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:43:53" (1/3) ... [2022-07-12 11:43:58,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f1cde7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:43:58, skipping insertion in model container [2022-07-12 11:43:58,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:43:55" (2/3) ... [2022-07-12 11:43:58,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f1cde7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:43:58, skipping insertion in model container [2022-07-12 11:43:58,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:43:58" (3/3) ... [2022-07-12 11:43:58,076 INFO L111 eAbstractionObserver]: Analyzing ICFG m0_drivers-net-slip-ko--108_1a--1b0b0ac.i [2022-07-12 11:43:58,088 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:43:58,089 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:43:58,144 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:43:58,150 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@7eab0a4f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7a387940 [2022-07-12 11:43:58,151 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:43:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 968 states, 716 states have (on average 1.4329608938547487) internal successors, (1026), 743 states have internal predecessors, (1026), 207 states have call successors, (207), 43 states have call predecessors, (207), 43 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) [2022-07-12 11:43:58,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 11:43:58,173 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:43:58,174 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:43:58,174 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:43:58,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:43:58,179 INFO L85 PathProgramCache]: Analyzing trace with hash -579474216, now seen corresponding path program 1 times [2022-07-12 11:43:58,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:43:58,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036887427] [2022-07-12 11:43:58,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:43:58,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:43:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:43:58,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:43:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:43:58,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:43:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:43:58,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:43:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:43:58,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:43:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:43:58,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:43:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:43:58,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:43:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:43:58,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 11:43:58,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:43:58,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036887427] [2022-07-12 11:43:58,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036887427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:43:58,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:43:58,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:43:58,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301362407] [2022-07-12 11:43:58,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:43:58,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:43:58,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:43:58,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:43:58,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:43:58,635 INFO L87 Difference]: Start difference. First operand has 968 states, 716 states have (on average 1.4329608938547487) internal successors, (1026), 743 states have internal predecessors, (1026), 207 states have call successors, (207), 43 states have call predecessors, (207), 43 states have return successors, (207), 205 states have call predecessors, (207), 207 states have call successors, (207) Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 11:43:59,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:43:59,553 INFO L93 Difference]: Finished difference Result 1950 states and 2923 transitions. [2022-07-12 11:43:59,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:43:59,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2022-07-12 11:43:59,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:43:59,580 INFO L225 Difference]: With dead ends: 1950 [2022-07-12 11:43:59,580 INFO L226 Difference]: Without dead ends: 947 [2022-07-12 11:43:59,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-12 11:43:59,618 INFO L413 NwaCegarLoop]: 1370 mSDtfsCounter, 1580 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1716 SdHoareTripleChecker+Valid, 1980 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:43:59,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1716 Valid, 1980 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 11:43:59,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-07-12 11:43:59,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 929. [2022-07-12 11:43:59,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 686 states have (on average 1.4183673469387754) internal successors, (973), 710 states have internal predecessors, (973), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-07-12 11:43:59,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1371 transitions. [2022-07-12 11:43:59,744 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1371 transitions. Word has length 59 [2022-07-12 11:43:59,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:43:59,744 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1371 transitions. [2022-07-12 11:43:59,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 11:43:59,745 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1371 transitions. [2022-07-12 11:43:59,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-12 11:43:59,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:43:59,756 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:43:59,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:43:59,756 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:43:59,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:43:59,757 INFO L85 PathProgramCache]: Analyzing trace with hash -155827494, now seen corresponding path program 1 times [2022-07-12 11:43:59,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:43:59,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040177812] [2022-07-12 11:43:59,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:43:59,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:43:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:43:59,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:43:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:43:59,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:43:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:43:59,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:43:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:43:59,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:43:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:43:59,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:43:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:43:59,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:43:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:43:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 11:43:59,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:43:59,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040177812] [2022-07-12 11:43:59,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040177812] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:43:59,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:43:59,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:43:59,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315225168] [2022-07-12 11:43:59,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:43:59,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:43:59,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:43:59,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:43:59,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:43:59,965 INFO L87 Difference]: Start difference. First operand 929 states and 1371 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 11:44:01,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:44:01,365 INFO L93 Difference]: Finished difference Result 1859 states and 2750 transitions. [2022-07-12 11:44:01,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:44:01,366 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2022-07-12 11:44:01,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:44:01,372 INFO L225 Difference]: With dead ends: 1859 [2022-07-12 11:44:01,372 INFO L226 Difference]: Without dead ends: 947 [2022-07-12 11:44:01,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:44:01,376 INFO L413 NwaCegarLoop]: 1319 mSDtfsCounter, 372 mSDsluCounter, 2196 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 3515 SdHoareTripleChecker+Invalid, 1577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:44:01,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 3515 Invalid, 1577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 11:44:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-07-12 11:44:01,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 929. [2022-07-12 11:44:01,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 686 states have (on average 1.4169096209912537) internal successors, (972), 710 states have internal predecessors, (972), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-07-12 11:44:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1370 transitions. [2022-07-12 11:44:01,422 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1370 transitions. Word has length 59 [2022-07-12 11:44:01,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:44:01,422 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 1370 transitions. [2022-07-12 11:44:01,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-12 11:44:01,422 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1370 transitions. [2022-07-12 11:44:01,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 11:44:01,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:44:01,424 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:44:01,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 11:44:01,425 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:44:01,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:44:01,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1779924711, now seen corresponding path program 1 times [2022-07-12 11:44:01,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:44:01,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332364803] [2022-07-12 11:44:01,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:44:01,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:44:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:01,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:44:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:01,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:01,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:01,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:44:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:01,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:44:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:01,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:01,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:44:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:01,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 11:44:01,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:44:01,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332364803] [2022-07-12 11:44:01,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332364803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:44:01,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:44:01,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:44:01,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945602499] [2022-07-12 11:44:01,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:44:01,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:44:01,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:44:01,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:44:01,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:44:01,560 INFO L87 Difference]: Start difference. First operand 929 states and 1370 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 11:44:03,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:44:03,367 INFO L93 Difference]: Finished difference Result 1461 states and 2231 transitions. [2022-07-12 11:44:03,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:44:03,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 62 [2022-07-12 11:44:03,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:44:03,377 INFO L225 Difference]: With dead ends: 1461 [2022-07-12 11:44:03,377 INFO L226 Difference]: Without dead ends: 1459 [2022-07-12 11:44:03,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:44:03,379 INFO L413 NwaCegarLoop]: 2135 mSDtfsCounter, 1296 mSDsluCounter, 3170 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 5305 SdHoareTripleChecker+Invalid, 1969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:44:03,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1379 Valid, 5305 Invalid, 1969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-12 11:44:03,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2022-07-12 11:44:03,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 931. [2022-07-12 11:44:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 688 states have (on average 1.4156976744186047) internal successors, (974), 712 states have internal predecessors, (974), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-07-12 11:44:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1372 transitions. [2022-07-12 11:44:03,442 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1372 transitions. Word has length 62 [2022-07-12 11:44:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:44:03,443 INFO L495 AbstractCegarLoop]: Abstraction has 931 states and 1372 transitions. [2022-07-12 11:44:03,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 11:44:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1372 transitions. [2022-07-12 11:44:03,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-12 11:44:03,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:44:03,446 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:44:03,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 11:44:03,446 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:44:03,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:44:03,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2124530077, now seen corresponding path program 1 times [2022-07-12 11:44:03,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:44:03,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913751368] [2022-07-12 11:44:03,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:44:03,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:44:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:03,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:44:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:03,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:03,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:44:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:03,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:44:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:03,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:03,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:44:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:03,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:44:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 11:44:03,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:44:03,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913751368] [2022-07-12 11:44:03,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913751368] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:44:03,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:44:03,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:44:03,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502958547] [2022-07-12 11:44:03,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:44:03,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:44:03,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:44:03,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:44:03,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:44:03,666 INFO L87 Difference]: Start difference. First operand 931 states and 1372 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-12 11:44:05,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:44:05,418 INFO L93 Difference]: Finished difference Result 2375 states and 3581 transitions. [2022-07-12 11:44:05,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:44:05,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 72 [2022-07-12 11:44:05,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:44:05,427 INFO L225 Difference]: With dead ends: 2375 [2022-07-12 11:44:05,427 INFO L226 Difference]: Without dead ends: 1463 [2022-07-12 11:44:05,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:44:05,432 INFO L413 NwaCegarLoop]: 1818 mSDtfsCounter, 2025 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2295 SdHoareTripleChecker+Valid, 3407 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:44:05,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2295 Valid, 3407 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-12 11:44:05,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2022-07-12 11:44:05,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 932. [2022-07-12 11:44:05,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 689 states have (on average 1.4150943396226414) internal successors, (975), 713 states have internal predecessors, (975), 199 states have call successors, (199), 43 states have call predecessors, (199), 43 states have return successors, (199), 197 states have call predecessors, (199), 199 states have call successors, (199) [2022-07-12 11:44:05,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1373 transitions. [2022-07-12 11:44:05,488 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1373 transitions. Word has length 72 [2022-07-12 11:44:05,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:44:05,488 INFO L495 AbstractCegarLoop]: Abstraction has 932 states and 1373 transitions. [2022-07-12 11:44:05,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-12 11:44:05,488 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1373 transitions. [2022-07-12 11:44:05,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-12 11:44:05,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:44:05,491 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:44:05,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 11:44:05,491 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:44:05,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:44:05,491 INFO L85 PathProgramCache]: Analyzing trace with hash -45216834, now seen corresponding path program 1 times [2022-07-12 11:44:05,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:44:05,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580909076] [2022-07-12 11:44:05,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:44:05,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:44:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:05,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:44:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:05,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:05,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:44:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:05,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:44:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:05,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:05,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:44:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:05,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:44:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 11:44:05,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:44:05,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580909076] [2022-07-12 11:44:05,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580909076] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:44:05,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:44:05,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:44:05,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98518791] [2022-07-12 11:44:05,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:44:05,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:44:05,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:44:05,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:44:05,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:44:05,596 INFO L87 Difference]: Start difference. First operand 932 states and 1373 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 11:44:08,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:44:08,366 INFO L93 Difference]: Finished difference Result 2242 states and 3484 transitions. [2022-07-12 11:44:08,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:44:08,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2022-07-12 11:44:08,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:44:08,383 INFO L225 Difference]: With dead ends: 2242 [2022-07-12 11:44:08,383 INFO L226 Difference]: Without dead ends: 2240 [2022-07-12 11:44:08,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:44:08,387 INFO L413 NwaCegarLoop]: 2586 mSDtfsCounter, 2635 mSDsluCounter, 5558 mSDsCounter, 0 mSdLazyCounter, 2667 mSolverCounterSat, 818 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2834 SdHoareTripleChecker+Valid, 8144 SdHoareTripleChecker+Invalid, 3485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 818 IncrementalHoareTripleChecker+Valid, 2667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:44:08,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2834 Valid, 8144 Invalid, 3485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [818 Valid, 2667 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-12 11:44:08,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2022-07-12 11:44:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 934. [2022-07-12 11:44:08,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 690 states have (on average 1.4144927536231884) internal successors, (976), 713 states have internal predecessors, (976), 200 states have call successors, (200), 43 states have call predecessors, (200), 43 states have return successors, (200), 198 states have call predecessors, (200), 200 states have call successors, (200) [2022-07-12 11:44:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1376 transitions. [2022-07-12 11:44:08,476 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1376 transitions. Word has length 74 [2022-07-12 11:44:08,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:44:08,478 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 1376 transitions. [2022-07-12 11:44:08,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 11:44:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1376 transitions. [2022-07-12 11:44:08,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-12 11:44:08,483 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:44:08,483 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:44:08,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 11:44:08,484 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:44:08,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:44:08,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1411070669, now seen corresponding path program 1 times [2022-07-12 11:44:08,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:44:08,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262180648] [2022-07-12 11:44:08,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:44:08,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:44:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:08,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:44:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:08,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:08,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:44:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:08,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:44:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:08,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:08,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:44:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:08,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:44:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:08,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:44:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:08,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:44:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:08,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 11:44:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:08,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 11:44:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 11:44:08,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:44:08,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262180648] [2022-07-12 11:44:08,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262180648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:44:08,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:44:08,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:44:08,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427459182] [2022-07-12 11:44:08,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:44:08,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:44:08,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:44:08,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:44:08,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:44:08,675 INFO L87 Difference]: Start difference. First operand 934 states and 1376 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 11:44:09,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:44:09,517 INFO L93 Difference]: Finished difference Result 1896 states and 2786 transitions. [2022-07-12 11:44:09,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:44:09,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 104 [2022-07-12 11:44:09,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:44:09,523 INFO L225 Difference]: With dead ends: 1896 [2022-07-12 11:44:09,523 INFO L226 Difference]: Without dead ends: 981 [2022-07-12 11:44:09,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-12 11:44:09,526 INFO L413 NwaCegarLoop]: 1320 mSDtfsCounter, 1481 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1607 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:44:09,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1607 Valid, 1919 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 11:44:09,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2022-07-12 11:44:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 954. [2022-07-12 11:44:09,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 704 states have (on average 1.40625) internal successors, (990), 727 states have internal predecessors, (990), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2022-07-12 11:44:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1394 transitions. [2022-07-12 11:44:09,596 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1394 transitions. Word has length 104 [2022-07-12 11:44:09,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:44:09,597 INFO L495 AbstractCegarLoop]: Abstraction has 954 states and 1394 transitions. [2022-07-12 11:44:09,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 11:44:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1394 transitions. [2022-07-12 11:44:09,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 11:44:09,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:44:09,601 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:44:09,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 11:44:09,601 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:44:09,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:44:09,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1281162515, now seen corresponding path program 1 times [2022-07-12 11:44:09,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:44:09,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943620706] [2022-07-12 11:44:09,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:44:09,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:44:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:09,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:44:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:09,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:09,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:44:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:09,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:44:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:09,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:09,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:44:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:09,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:44:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:09,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:44:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:09,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:44:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:09,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:44:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:09,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 11:44:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:09,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 11:44:09,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:44:09,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943620706] [2022-07-12 11:44:09,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943620706] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:44:09,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:44:09,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:44:09,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623977720] [2022-07-12 11:44:09,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:44:09,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:44:09,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:44:09,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:44:09,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:44:09,806 INFO L87 Difference]: Start difference. First operand 954 states and 1394 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 11:44:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:44:11,612 INFO L93 Difference]: Finished difference Result 2412 states and 3616 transitions. [2022-07-12 11:44:11,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:44:11,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 106 [2022-07-12 11:44:11,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:44:11,621 INFO L225 Difference]: With dead ends: 2412 [2022-07-12 11:44:11,622 INFO L226 Difference]: Without dead ends: 1497 [2022-07-12 11:44:11,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:44:11,626 INFO L413 NwaCegarLoop]: 1877 mSDtfsCounter, 2123 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2394 SdHoareTripleChecker+Valid, 3506 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:44:11,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2394 Valid, 3506 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-12 11:44:11,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2022-07-12 11:44:11,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 958. [2022-07-12 11:44:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 708 states have (on average 1.405367231638418) internal successors, (995), 731 states have internal predecessors, (995), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2022-07-12 11:44:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1399 transitions. [2022-07-12 11:44:11,705 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1399 transitions. Word has length 106 [2022-07-12 11:44:11,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:44:11,706 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1399 transitions. [2022-07-12 11:44:11,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 11:44:11,706 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1399 transitions. [2022-07-12 11:44:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-12 11:44:11,716 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:44:11,716 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:44:11,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 11:44:11,716 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:44:11,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:44:11,717 INFO L85 PathProgramCache]: Analyzing trace with hash 10856094, now seen corresponding path program 1 times [2022-07-12 11:44:11,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:44:11,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751624741] [2022-07-12 11:44:11,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:44:11,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:44:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:11,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:44:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:11,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:11,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:44:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:11,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:44:11,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:11,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:11,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:44:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:11,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:44:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:11,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:44:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:11,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:44:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:11,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 11:44:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:11,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:44:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 11:44:11,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:44:11,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751624741] [2022-07-12 11:44:11,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751624741] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:44:11,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:44:11,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:44:11,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769168996] [2022-07-12 11:44:11,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:44:11,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:44:11,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:44:11,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:44:11,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:44:11,858 INFO L87 Difference]: Start difference. First operand 958 states and 1399 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 11:44:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:44:12,873 INFO L93 Difference]: Finished difference Result 1905 states and 2803 transitions. [2022-07-12 11:44:12,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:44:12,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2022-07-12 11:44:12,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:44:12,879 INFO L225 Difference]: With dead ends: 1905 [2022-07-12 11:44:12,879 INFO L226 Difference]: Without dead ends: 986 [2022-07-12 11:44:12,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-12 11:44:12,883 INFO L413 NwaCegarLoop]: 1314 mSDtfsCounter, 365 mSDsluCounter, 1389 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:44:12,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 2703 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 11:44:12,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2022-07-12 11:44:12,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 958. [2022-07-12 11:44:12,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 708 states have (on average 1.4011299435028248) internal successors, (992), 731 states have internal predecessors, (992), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2022-07-12 11:44:12,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1396 transitions. [2022-07-12 11:44:12,947 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1396 transitions. Word has length 109 [2022-07-12 11:44:12,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:44:12,947 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1396 transitions. [2022-07-12 11:44:12,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 11:44:12,948 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1396 transitions. [2022-07-12 11:44:12,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-12 11:44:12,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:44:12,952 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:44:12,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 11:44:12,952 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:44:12,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:44:12,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1938120389, now seen corresponding path program 1 times [2022-07-12 11:44:12,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:44:12,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307780943] [2022-07-12 11:44:12,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:44:12,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:44:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:13,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:44:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:13,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:13,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:44:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:13,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:44:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:13,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:13,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:44:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:13,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:44:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:13,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:44:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:13,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:44:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:13,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:44:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:13,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:44:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:13,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 11:44:13,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:44:13,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307780943] [2022-07-12 11:44:13,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307780943] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:44:13,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:44:13,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:44:13,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681988706] [2022-07-12 11:44:13,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:44:13,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:44:13,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:44:13,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:44:13,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:44:13,100 INFO L87 Difference]: Start difference. First operand 958 states and 1396 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-12 11:44:14,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:44:14,653 INFO L93 Difference]: Finished difference Result 1507 states and 2274 transitions. [2022-07-12 11:44:14,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:44:14,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2022-07-12 11:44:14,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:44:14,660 INFO L225 Difference]: With dead ends: 1507 [2022-07-12 11:44:14,660 INFO L226 Difference]: Without dead ends: 1505 [2022-07-12 11:44:14,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:44:14,662 INFO L413 NwaCegarLoop]: 2132 mSDtfsCounter, 1292 mSDsluCounter, 3166 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 5298 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:44:14,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 5298 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 11:44:14,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2022-07-12 11:44:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 958. [2022-07-12 11:44:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 708 states have (on average 1.4011299435028248) internal successors, (992), 731 states have internal predecessors, (992), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2022-07-12 11:44:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1396 transitions. [2022-07-12 11:44:14,735 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1396 transitions. Word has length 112 [2022-07-12 11:44:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:44:14,736 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1396 transitions. [2022-07-12 11:44:14,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-07-12 11:44:14,736 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1396 transitions. [2022-07-12 11:44:14,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-12 11:44:14,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:44:14,741 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:44:14,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 11:44:14,741 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:44:14,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:44:14,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1129348236, now seen corresponding path program 1 times [2022-07-12 11:44:14,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:44:14,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573117960] [2022-07-12 11:44:14,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:44:14,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:44:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:14,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:44:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:14,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:14,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:44:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:14,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:44:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:14,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:14,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:44:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:14,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:44:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:14,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 11:44:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:14,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:44:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:14,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:44:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:14,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:44:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:14,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:14,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:44:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:14,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 11:44:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:14,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:44:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:14,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 11:44:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:14,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:44:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:14,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 11:44:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:14,960 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-12 11:44:14,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:44:14,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573117960] [2022-07-12 11:44:14,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573117960] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:44:14,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058318259] [2022-07-12 11:44:14,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:44:14,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:44:14,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:44:14,967 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:44:14,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 11:44:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:15,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 11:44:15,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:44:15,540 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 11:44:15,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:44:15,675 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-12 11:44:15,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058318259] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:44:15,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:44:15,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 5] total 12 [2022-07-12 11:44:15,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694788548] [2022-07-12 11:44:15,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:44:15,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 11:44:15,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:44:15,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 11:44:15,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:44:15,678 INFO L87 Difference]: Start difference. First operand 958 states and 1396 transitions. Second operand has 12 states, 12 states have (on average 16.083333333333332) internal successors, (193), 10 states have internal predecessors, (193), 4 states have call successors, (46), 5 states have call predecessors, (46), 3 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2022-07-12 11:44:18,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:44:18,956 INFO L93 Difference]: Finished difference Result 3941 states and 6074 transitions. [2022-07-12 11:44:18,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:44:18,956 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 16.083333333333332) internal successors, (193), 10 states have internal predecessors, (193), 4 states have call successors, (46), 5 states have call predecessors, (46), 3 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) Word has length 151 [2022-07-12 11:44:18,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:44:18,969 INFO L225 Difference]: With dead ends: 3941 [2022-07-12 11:44:18,969 INFO L226 Difference]: Without dead ends: 3022 [2022-07-12 11:44:18,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:44:18,973 INFO L413 NwaCegarLoop]: 1910 mSDtfsCounter, 7057 mSDsluCounter, 4052 mSDsCounter, 0 mSdLazyCounter, 2962 mSolverCounterSat, 2975 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7468 SdHoareTripleChecker+Valid, 5962 SdHoareTripleChecker+Invalid, 5937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2975 IncrementalHoareTripleChecker+Valid, 2962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:44:18,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7468 Valid, 5962 Invalid, 5937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2975 Valid, 2962 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-12 11:44:18,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2022-07-12 11:44:19,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 965. [2022-07-12 11:44:19,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 715 states have (on average 1.4) internal successors, (1001), 738 states have internal predecessors, (1001), 202 states have call successors, (202), 47 states have call predecessors, (202), 47 states have return successors, (202), 200 states have call predecessors, (202), 202 states have call successors, (202) [2022-07-12 11:44:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1405 transitions. [2022-07-12 11:44:19,078 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1405 transitions. Word has length 151 [2022-07-12 11:44:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:44:19,079 INFO L495 AbstractCegarLoop]: Abstraction has 965 states and 1405 transitions. [2022-07-12 11:44:19,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.083333333333332) internal successors, (193), 10 states have internal predecessors, (193), 4 states have call successors, (46), 5 states have call predecessors, (46), 3 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2022-07-12 11:44:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1405 transitions. [2022-07-12 11:44:19,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-12 11:44:19,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:44:19,084 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:44:19,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 11:44:19,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 11:44:19,297 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:44:19,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:44:19,298 INFO L85 PathProgramCache]: Analyzing trace with hash -418278925, now seen corresponding path program 1 times [2022-07-12 11:44:19,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:44:19,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395242830] [2022-07-12 11:44:19,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:44:19,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:44:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:19,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:44:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:19,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:19,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:44:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:19,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:44:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:19,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:19,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:44:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:19,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:44:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:19,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:44:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:19,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:44:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:19,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:44:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:19,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 11:44:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:19,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:44:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:19,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:19,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:44:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:19,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 11:44:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:19,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:44:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:19,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 11:44:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:19,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 11:44:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:19,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 11:44:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:19,563 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 11:44:19,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:44:19,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395242830] [2022-07-12 11:44:19,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395242830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:44:19,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:44:19,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 11:44:19,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476846733] [2022-07-12 11:44:19,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:44:19,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 11:44:19,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:44:19,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 11:44:19,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:44:19,567 INFO L87 Difference]: Start difference. First operand 965 states and 1405 transitions. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 8 states have internal predecessors, (102), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 11:44:24,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:44:24,467 INFO L93 Difference]: Finished difference Result 3113 states and 4851 transitions. [2022-07-12 11:44:24,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 11:44:24,468 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 8 states have internal predecessors, (102), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2022-07-12 11:44:24,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:44:24,484 INFO L225 Difference]: With dead ends: 3113 [2022-07-12 11:44:24,484 INFO L226 Difference]: Without dead ends: 3111 [2022-07-12 11:44:24,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-07-12 11:44:24,486 INFO L413 NwaCegarLoop]: 3469 mSDtfsCounter, 3720 mSDsluCounter, 17625 mSDsCounter, 0 mSdLazyCounter, 7885 mSolverCounterSat, 1892 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3802 SdHoareTripleChecker+Valid, 21094 SdHoareTripleChecker+Invalid, 9777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1892 IncrementalHoareTripleChecker+Valid, 7885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:44:24,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3802 Valid, 21094 Invalid, 9777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1892 Valid, 7885 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-12 11:44:24,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2022-07-12 11:44:24,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 967. [2022-07-12 11:44:24,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 716 states have (on average 1.399441340782123) internal successors, (1002), 739 states have internal predecessors, (1002), 203 states have call successors, (203), 47 states have call predecessors, (203), 47 states have return successors, (203), 201 states have call predecessors, (203), 203 states have call successors, (203) [2022-07-12 11:44:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1408 transitions. [2022-07-12 11:44:24,630 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1408 transitions. Word has length 160 [2022-07-12 11:44:24,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:44:24,630 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1408 transitions. [2022-07-12 11:44:24,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 8 states have internal predecessors, (102), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 11:44:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1408 transitions. [2022-07-12 11:44:24,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-07-12 11:44:24,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:44:24,636 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:44:24,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 11:44:24,636 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:44:24,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:44:24,637 INFO L85 PathProgramCache]: Analyzing trace with hash -181531566, now seen corresponding path program 1 times [2022-07-12 11:44:24,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:44:24,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346776540] [2022-07-12 11:44:24,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:44:24,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:44:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:44:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:44:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:44:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:44:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:44:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:44:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:44:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:44:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 11:44:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:44:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:44:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 11:44:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:44:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 11:44:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 11:44:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 11:44:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 11:44:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:44:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 11:44:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:44:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:44:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-12 11:44:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 11:44:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-12 11:44:24,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:44:24,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346776540] [2022-07-12 11:44:24,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346776540] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:44:24,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:44:24,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:44:24,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489598242] [2022-07-12 11:44:24,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:44:24,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:44:24,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:44:24,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:44:24,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:44:24,844 INFO L87 Difference]: Start difference. First operand 967 states and 1408 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 11:44:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:44:25,832 INFO L93 Difference]: Finished difference Result 1923 states and 2815 transitions. [2022-07-12 11:44:25,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:44:25,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 202 [2022-07-12 11:44:25,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:44:25,837 INFO L225 Difference]: With dead ends: 1923 [2022-07-12 11:44:25,837 INFO L226 Difference]: Without dead ends: 995 [2022-07-12 11:44:25,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:44:25,839 INFO L413 NwaCegarLoop]: 1309 mSDtfsCounter, 724 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 2734 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:44:25,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 2734 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 11:44:25,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-12 11:44:25,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 967. [2022-07-12 11:44:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 716 states have (on average 1.3952513966480447) internal successors, (999), 739 states have internal predecessors, (999), 203 states have call successors, (203), 47 states have call predecessors, (203), 47 states have return successors, (203), 201 states have call predecessors, (203), 203 states have call successors, (203) [2022-07-12 11:44:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1405 transitions. [2022-07-12 11:44:25,928 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1405 transitions. Word has length 202 [2022-07-12 11:44:25,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:44:25,929 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1405 transitions. [2022-07-12 11:44:25,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 11:44:25,929 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1405 transitions. [2022-07-12 11:44:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-07-12 11:44:25,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:44:25,934 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:44:25,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 11:44:25,934 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:44:25,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:44:25,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1912426699, now seen corresponding path program 1 times [2022-07-12 11:44:25,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:44:25,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416020321] [2022-07-12 11:44:25,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:44:25,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:44:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:44:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:44:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:44:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:44:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:44:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:44:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:44:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:44:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 11:44:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:44:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:44:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 11:44:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:44:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 11:44:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 11:44:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 11:44:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 11:44:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 11:44:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:44:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 11:44:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:44:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 11:44:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-12 11:44:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-12 11:44:26,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:44:26,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416020321] [2022-07-12 11:44:26,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416020321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:44:26,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:44:26,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:44:26,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210822467] [2022-07-12 11:44:26,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:44:26,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:44:26,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:44:26,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:44:26,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:44:26,111 INFO L87 Difference]: Start difference. First operand 967 states and 1405 transitions. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 11:44:27,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:44:27,095 INFO L93 Difference]: Finished difference Result 1923 states and 2809 transitions. [2022-07-12 11:44:27,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:44:27,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 205 [2022-07-12 11:44:27,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:44:27,120 INFO L225 Difference]: With dead ends: 1923 [2022-07-12 11:44:27,121 INFO L226 Difference]: Without dead ends: 995 [2022-07-12 11:44:27,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:44:27,123 INFO L413 NwaCegarLoop]: 1305 mSDtfsCounter, 365 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 3286 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:44:27,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 3286 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 11:44:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-12 11:44:27,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 967. [2022-07-12 11:44:27,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 716 states have (on average 1.3910614525139664) internal successors, (996), 739 states have internal predecessors, (996), 203 states have call successors, (203), 47 states have call predecessors, (203), 47 states have return successors, (203), 201 states have call predecessors, (203), 203 states have call successors, (203) [2022-07-12 11:44:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1402 transitions. [2022-07-12 11:44:27,210 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1402 transitions. Word has length 205 [2022-07-12 11:44:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:44:27,210 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1402 transitions. [2022-07-12 11:44:27,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 3 states have internal predecessors, (123), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 11:44:27,211 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1402 transitions. [2022-07-12 11:44:27,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-12 11:44:27,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:44:27,216 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:44:27,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 11:44:27,216 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:44:27,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:44:27,217 INFO L85 PathProgramCache]: Analyzing trace with hash -2088105750, now seen corresponding path program 1 times [2022-07-12 11:44:27,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:44:27,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618785664] [2022-07-12 11:44:27,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:44:27,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:44:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:44:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:44:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:44:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:44:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:44:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:44:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:44:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:44:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 11:44:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:44:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:44:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 11:44:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:44:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 11:44:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 11:44:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 11:44:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 11:44:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 11:44:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:44:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:44:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 11:44:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-12 11:44:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 11:44:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-12 11:44:27,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:44:27,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618785664] [2022-07-12 11:44:27,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618785664] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:44:27,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:44:27,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:44:27,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461641633] [2022-07-12 11:44:27,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:44:27,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:44:27,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:44:27,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:44:27,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:44:27,407 INFO L87 Difference]: Start difference. First operand 967 states and 1402 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 11:44:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:44:28,338 INFO L93 Difference]: Finished difference Result 1923 states and 2803 transitions. [2022-07-12 11:44:28,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:44:28,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 208 [2022-07-12 11:44:28,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:44:28,343 INFO L225 Difference]: With dead ends: 1923 [2022-07-12 11:44:28,343 INFO L226 Difference]: Without dead ends: 995 [2022-07-12 11:44:28,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:44:28,346 INFO L413 NwaCegarLoop]: 1305 mSDtfsCounter, 365 mSDsluCounter, 1982 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 3287 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:44:28,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 3287 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 11:44:28,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-12 11:44:28,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 967. [2022-07-12 11:44:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 716 states have (on average 1.3868715083798884) internal successors, (993), 739 states have internal predecessors, (993), 203 states have call successors, (203), 47 states have call predecessors, (203), 47 states have return successors, (203), 201 states have call predecessors, (203), 203 states have call successors, (203) [2022-07-12 11:44:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1399 transitions. [2022-07-12 11:44:28,460 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1399 transitions. Word has length 208 [2022-07-12 11:44:28,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:44:28,464 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1399 transitions. [2022-07-12 11:44:28,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 3 states have internal predecessors, (126), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 11:44:28,464 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1399 transitions. [2022-07-12 11:44:28,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-07-12 11:44:28,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:44:28,469 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:44:28,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 11:44:28,469 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:44:28,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:44:28,470 INFO L85 PathProgramCache]: Analyzing trace with hash 338207523, now seen corresponding path program 1 times [2022-07-12 11:44:28,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:44:28,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167382752] [2022-07-12 11:44:28,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:44:28,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:44:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:44:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:44:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:44:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:44:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:44:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:44:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:44:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:44:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 11:44:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:44:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:44:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 11:44:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:44:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 11:44:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 11:44:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 11:44:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 11:44:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 11:44:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:44:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:44:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:44:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 11:44:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-12 11:44:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-12 11:44:28,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:44:28,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167382752] [2022-07-12 11:44:28,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167382752] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:44:28,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:44:28,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:44:28,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716667134] [2022-07-12 11:44:28,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:44:28,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:44:28,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:44:28,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:44:28,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:44:28,656 INFO L87 Difference]: Start difference. First operand 967 states and 1399 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 11:44:29,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:44:29,547 INFO L93 Difference]: Finished difference Result 1923 states and 2797 transitions. [2022-07-12 11:44:29,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:44:29,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 211 [2022-07-12 11:44:29,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:44:29,552 INFO L225 Difference]: With dead ends: 1923 [2022-07-12 11:44:29,552 INFO L226 Difference]: Without dead ends: 995 [2022-07-12 11:44:29,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:44:29,555 INFO L413 NwaCegarLoop]: 1300 mSDtfsCounter, 730 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 2696 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:44:29,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 2696 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 11:44:29,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-07-12 11:44:29,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 967. [2022-07-12 11:44:29,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 716 states have (on average 1.3826815642458101) internal successors, (990), 739 states have internal predecessors, (990), 203 states have call successors, (203), 47 states have call predecessors, (203), 47 states have return successors, (203), 201 states have call predecessors, (203), 203 states have call successors, (203) [2022-07-12 11:44:29,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1396 transitions. [2022-07-12 11:44:29,663 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1396 transitions. Word has length 211 [2022-07-12 11:44:29,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:44:29,663 INFO L495 AbstractCegarLoop]: Abstraction has 967 states and 1396 transitions. [2022-07-12 11:44:29,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 3 states have internal predecessors, (129), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 11:44:29,664 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1396 transitions. [2022-07-12 11:44:29,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-12 11:44:29,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:44:29,669 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:44:29,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 11:44:29,669 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:44:29,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:44:29,669 INFO L85 PathProgramCache]: Analyzing trace with hash -978948990, now seen corresponding path program 1 times [2022-07-12 11:44:29,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:44:29,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179468632] [2022-07-12 11:44:29,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:44:29,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:44:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:44:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:44:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 11:44:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:44:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 11:44:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:44:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:44:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:44:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-12 11:44:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:44:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:44:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:44:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 11:44:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 11:44:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 11:44:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 11:44:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 11:44:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 11:44:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-12 11:44:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 11:44:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:44:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 11:44:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-12 11:44:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 11:44:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:44:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-12 11:44:29,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:44:29,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179468632] [2022-07-12 11:44:29,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179468632] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:44:29,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:44:29,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 11:44:29,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361669468] [2022-07-12 11:44:29,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:44:29,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 11:44:29,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:44:29,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 11:44:29,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:44:29,960 INFO L87 Difference]: Start difference. First operand 967 states and 1396 transitions. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 8 states have internal predecessors, (135), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 11:44:35,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:44:35,206 INFO L93 Difference]: Finished difference Result 3553 states and 5556 transitions. [2022-07-12 11:44:35,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 11:44:35,207 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 8 states have internal predecessors, (135), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) Word has length 214 [2022-07-12 11:44:35,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:44:35,208 INFO L225 Difference]: With dead ends: 3553 [2022-07-12 11:44:35,208 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 11:44:35,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2022-07-12 11:44:35,216 INFO L413 NwaCegarLoop]: 3669 mSDtfsCounter, 3763 mSDsluCounter, 18576 mSDsCounter, 0 mSdLazyCounter, 8720 mSolverCounterSat, 1930 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3958 SdHoareTripleChecker+Valid, 22245 SdHoareTripleChecker+Invalid, 10650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1930 IncrementalHoareTripleChecker+Valid, 8720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:44:35,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3958 Valid, 22245 Invalid, 10650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1930 Valid, 8720 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-12 11:44:35,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 11:44:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 11:44:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 11:44:35,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 11:44:35,219 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2022-07-12 11:44:35,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:44:35,219 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 11:44:35,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 8 states have internal predecessors, (135), 2 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 11:44:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 11:44:35,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 11:44:35,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 11:44:35,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 11:44:35,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.